Related papers: Bounds for the annealed return probability on larg…
We consider the simple random walk on Galton-Watson trees with supercritical offspring distribution, conditioned on non-extinction. In case the offspring distribution has finite support, we prove an upper bound for the annealed return…
We establish several equivalent characterisations of the anchored isoperimetric dimension of supercritical clusters in Bernoulli bond percolation on transitive graphs. We deduce from these characterisations together with a theorem of…
We consider the simple random walk on the infinite cluster of a general class of percolation models on $\mathbb{Z}^d$, $d\geq 3$, including Bernoulli percolation as well as models with strong, algebraically decaying correlations. For almost…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
We consider supercritical long-range percolation on transitive graphs of polynomial growth. In this model, any two vertices $x$ and $y$ of the underlying graph $G$ connect by a direct edge with probability $1-\exp(-\beta J(x,y))$, where…
In this paper, we derive upper bounds for the heat kernel of the simple random walk on the infinite cluster of a supercritical long range percolation process. For any $d \geq 1$ and for any exponent $s \in (d, (d+2) \wedge 2d)$ giving the…
This text is based on a lecture for the Sheffield Probability Day; its main purpose is to survey some recent asymptotic results about Bernoulli bond percolation on certain large random trees with logarithmic height. We also provide a…
We consider biased random walks in a one-dimensional percolation model. This model goes back to Axelson-Fisk and H\"aggstr\"om and exhibits the same phase transition as biased random walk on the infinite cluster of supercritical Bernoulli…
We consider a directed random walk on the backbone of the supercritical oriented percolation cluster in dimensions $d+1$ with $d \ge 3$ being the spatial dimension. For this random walk we prove an annealed local central limit theorem and a…
We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…
On a locally finite, infinite tree $T$, let $p_c(T)$ denote the critical probability for Bernoulli percolation. We prove that every positively associated, finite-range dependent percolation model on $T$ with marginals $p > p_c(T)$ must…
We describe a probabilistic methodology, based on random walk estimates, to obtain exponential upper bounds for the probability of observing unusually small maximal components in two classical (near-)critical random graph models. More…
We derive a general formula for computing the expected first return time of a random walk on a finite graph. Using this framework, we calculate the expected first return time in various settings over bounded rectangular grids with different…
A question relating the critical probability for percolation, the critical probability for a unique infinite cluster and graph limits is presented, together with some partial results.
We consider the model of random trees introduced by Devroye (1999), the so-called random split trees. The model encompasses many important randomized algorithms and data structures. We then perform supercritical Bernoulli bond-percolation…
We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…
Hermon and Hutchcroft have recently proved the long-standing conjecture that in Bernoulli(p) bond percolation on any nonamenable transitive graph G, at any p > p_c(G), the probability that the cluster of the origin is finite but has a large…
We give several algebraic bounds for percolation on directed and undirected graphs: proliferation of strongly-connected clusters, proliferation of in- and out-clusters, and the transition associated with the number of giant components.
We consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.
We construct an example of a bounded degree, nonamenable, unimodular random rooted graph with $p_c=p_u$ for Bernoulli bond percolation, as well as an example of a bounded degree, unimodular random rooted graph with $p_c<1$ but with an…