Page 1

Displaying 1 – 12 of 12

Showing per page

Collisions of random walks

Martin T. Barlow, Yuval Peres, Perla Sousi (2012)

Annales de l'I.H.P. Probabilités et statistiques

A recurrent graph G has the infinite collision property if two independent random walks on G , started at the same point, collide infinitely often a.s. We give a simple criterion in terms of Green functions for a graph to have this property, and use it to prove that a critical Galton–Watson tree with finite variance conditioned to survive, the incipient infinite cluster in d with d 19 and the uniform spanning tree in 2 all have the infinite collision property. For power-law combs and spherically symmetric...

Giant vacant component left by a random walk in a random d-regular graph

Jiří Černý, Augusto Teixeira, David Windisch (2011)

Annales de l'I.H.P. Probabilités et statistiques

We study the trajectory of a simple random walk on a d-regular graph with d ≥ 3 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders. For these graphs, we investigate percolative properties of the set of vertices not visited by the walk until time un, where u > 0 is a fixed positive parameter. We show that this so-called vacant set exhibits a phase transition in u in the following sense: there...

On eulerian irregularity in graphs

Eric Andrews, Chira Lumduanhom, Ping Zhang (2014)

Discussiones Mathematicae Graph Theory

A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circuit. A graph is Eulerian if it contains an Eulerian circuit. It is well known that a connected graph G is Eulerian if and only if every vertex of G is even. An Eulerian walk in a connected graph G is a closed walk that contains every edge of G at least once, while an irregular Eulerian walk in G is an Eulerian walk that encounters no two edges of G the same number of times. The minimum length of an...

Transitions on a noncompact Cantor set and random walks on its defining tree

Jun Kigami (2013)

Annales de l'I.H.P. Probabilités et statistiques

First, noncompact Cantor sets along with their defining trees are introduced as a natural generalization of p -adic numbers. Secondly we construct a class of jump processes on a noncompact Cantor set from given pairs of eigenvalues and measures. At the same time, we have concrete expressions of the associated jump kernels and transition densities. Then we construct intrinsic metrics on noncompact Cantor set to obtain estimates of transition densities and jump kernels under some regularity conditions...

Uniform mixing time for random walk on lamplighter graphs

Júlia Komjáthy, Jason Miller, Yuval Peres (2014)

Annales de l'I.H.P. Probabilités et statistiques

Suppose that 𝒢 is a finite, connected graph and X is a lazy random walk on 𝒢 . The lamplighter chain X associated with X is the random walk on the wreath product 𝒢 = 𝐙 2 𝒢 , the graph whose vertices consist of pairs ( f ̲ , x ) where f is a labeling of the vertices of 𝒢 by elements of 𝐙 2 = { 0 , 1 } and x is a vertex in 𝒢 . There is an edge between ( f ̲ , x ) and ( g ̲ , y ) in 𝒢 if and only if x is adjacent to y in 𝒢 and f z = g z for all z x , y . In each step, X moves from a configuration ( f ̲ , x ) by updating x to y using the transition rule of X and then sampling both...

Currently displaying 1 – 12 of 12

Page 1