Domains of analytic continuation for the top Lyapunov exponent
Percolation on nonamenable products at the uniqueness threshold
Remarks on intersection-equivalence and capacity-equivalence
Intersecting random translates of invariant Cantor sets.
Mixing time for the Ising model : a uniform lower bound for all graphs
Consider Glauber dynamics for the Ising model on a graph of vertices. Hayes and Sinclair showed that the mixing time for this dynamics is at least log /(), where is the maximum degree and () = (log2). Their result applies to more general spin systems, and in that generality, they showed that some dependence on is necessary. In this paper, we focus on the ferromagnetic Ising model and prove that the mixing time of Glauber dynamics on any -vertex graph is at least (1/4 + o(1))log .
Random walks on a tree and capacity in the interval
The infinite valley for a recurrent random walk in random environment
We consider a one-dimensional recurrent random walk in random environment (RWRE). We show that the – suitably centered – empirical distributions of the RWRE converge weakly to a certain limit law which describes the stationary distribution of a random walk in an infinite valley. The construction of the infinite valley goes back to Golosov, see (1984) 491–506. As a consequence, we show weak convergence for both the maximal local time and the self-intersection local time of the RWRE...
Perfect filtering and double disjointness
Markov chain intersections and the loop-erased walk
Uniform mixing time for random walk on lamplighter graphs
Suppose that is a finite, connected graph and is a lazy random walk on . The lamplighter chain associated with is the random walk on the wreath product , the graph whose vertices consist of pairs where is a labeling of the vertices of by elements of and is a vertex in . There is an edge between and in if and only if is adjacent to in and for all . In each step, moves from a configuration by updating to using the transition rule of and then sampling both...
Collisions of random walks
A recurrent graph has the infinite collision property if two independent random walks on , 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 with and the uniform spanning tree in all have the infinite collision property. For power-law combs and spherically symmetric...
Dynamical Percolation
Poisson matching
Suppose that red and blue points occur as independent homogeneous Poisson processes in ℝ. We investigate translation-invariant schemes for perfectly matching the red points to the blue points. For any such scheme in dimensions =1, 2, the matching distance from a typical point to its partner must have infinite /2th moment, while in dimensions ≥3 there exist schemes where has finite exponential moments. The Gale–Shapley stable marriage is one natural matching scheme, obtained by iteratively matching...
Dynamical sensitivity of the infinite cluster in critical percolation
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last decade. Here we focus on graphs which percolate at criticality, and investigate the dynamical sensitivity of the infinite cluster. We first give two examples of bounded degree graphs, one which percolates for all times at criticality and one which has exceptional...
Thin points for brownian motion
Mixing times for random walks on finite lamplighter groups.
Recurrent graphs where two independent random walks collide finitely often.
Trees and matchings from point processes.
Entropy of convolutions on the circle.
Eventual intersection for sequences of Lévy processes.
Page 1 Next