1 citations · 1 across the 3 of their papers we have counts for
7 papers · 1 filter
On Fixation of Activated Random Walks
Gideon Amir, Ori Gurel-Gurevich
We prove that for the Activated Random Walks model on transitive unimodular graphs, if there is fixation, then every particle eventually fixates, almost surely. We deduce that the…
Pursuit-Evasion Games with Incomplete Information in Discrete Time
Ori Gurel-Gurevich
Pursuit-Evasion Games (in discrete time) are stochastic games with nonnegative daily payoffs, with the final payoff being the cumulative sum of payoffs during the game. We show tha…
The Biham-Middleton-Levine traffic model for a single junction
Itai Benjamini, Ori Gurel-Gurevich, Roey Izkovsky
In the Biham-Middleton-Levine traffic model cars are placed with some density p on a two dimensional torus, and move according to a (simple) set of predefined rules. Computer simul…
The diameter of a random Cayley graph of Z_q
Gideon Amir, Ori Gurel-Gurevich
Consider the Cayley graph of the cyclic group of prime order q with k uniformly chosen generators. For fixed k, we prove that the diameter of said graph is asymptotically (in q) of…
Recurrence of random walk traces
Itai Benjamini, Ori Gurel-Gurevich, Russell Lyons
We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings.
Giant Components in Biased Graph Processes
Gideon Amir, Ori Gurel-Gurevich, Eyal Lubetzky +1
A random graph process, $\Gorg[1](n)$, is a sequence of graphs on vertices which begins with the edgeless graph, and where at each step a single edge is added according to a un…