Related papers: Mean-field behavior for nearest-neighbor percolati…
We study independent long-range percolation on $\mathbb{Z}^d$ where the vertices $u$ and $v$ are connected with probability asymptotic to $\frac{\beta}{\|u-v\|^{2d}}$ for $\|u-v\|_\infty\geq 2$ and with probability 1 for $\|u-v\|_\infty=1$,…
We consider a $d$-dimensional correlated percolation problem of sites {\em not} visited by a random walk on a hypercubic lattice $L^d$ for $d=3$, 4 and 5. The length of the random walk is ${\cal N}=uL^d$. Close to the critical value…
Consider a long-range percolation model on $\mathbb{Z}^d$ where the probability that an edge $\{x,y\} \in \mathbb{Z}^d \times \mathbb{Z}^d$ is open is proportional to $\|x-y\|_2^{-d-\alpha}$ for some $\alpha >0$ and where $d > 3…
We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…
We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…
We study a percolation model on $\mathbb R^d$ called the random connection model. For $d$ large, we use the lace expansion to prove that the critical two-point connection probability decays like $|x|^{-(d-2)}$ as $|x| \to \infty$, with…
We point out a new mechanism which can lead to mean field type behaviour in nonequilibrium critical phenomena. We demonstrate this mechanism on a two-dimensional model which can be understood as a stochastic and non-conservative version of…
The $q=2$ random cluster model is studied in the context of two mean field models: The Bethe lattice and the complete graph. For these systems, the critical exponents that are defined in terms of finite clusters have some anomalous values…
We consider learning two layer neural networks using stochastic gradient descent. The mean-field description of this learning dynamics approximates the evolution of the network weights by an evolution in the space of probability…
We consider $Z^d$, with d bigger or equal to three. We investigate the vacant set of random interlacements in the strongly percolative regime, the vacant set of the simple random walk, and the excursion set above a given level of the…
The vacant set of random interlacements on ${\mathbb{Z}}^d$, $d\ge3$, has nontrivial percolative properties. It is known from Sznitman [Ann. Math. 171 (2010) 2039--2087], Sidoravicius and Sznitman [Comm. Pure Appl. Math. 62 (2009) 831--858]…
The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the…
We prove that the growth constants for nearest-neighbour lattice trees and lattice (bond) animals on the integer lattice Zd are asymptotic to 2de as the dimension goes to infinity, and that their critical one-point functions converge to e.…
How does removal of sites by a random walk lead to blockage of percolation? To study this problem of correlated site percolation, we consider a random walk (RW) of $N=uL^d$ steps on a $d$-dimensional hypercubic lattice of size $L^d$ (with…
We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…
In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the…
We examine the percolation model on $\mathbb{Z}^d$ by an approach involving lattice animals and their surface-area-to-volume ratio. For $\beta \in [0,2(d-1))$, let $f(\beta)$ be the asymptotic exponential rate in the number of edges of the…
We prove $|x|^{-2}$ decay of the critical two-point function for the continuous-time weakly self-avoiding walk on $\mathbb{Z}^d$, in the upper critical dimension $d=4$. This is a statement that the critical exponent $\eta$ exists and is…
The $r$-neighbour bootstrap process on a graph $G$ begins with a set of infected vertices; subsequently, healthy vertices become infected once they have at least $r$ infected neighbours. The central extremal problem in bootstrap percolation…
In the mean field (or random link) model there are $n$ points and inter-point distances are independent random variables. For $0 < \ell < \infty$ and in the $n \to \infty$ limit, let $\delta(\ell) = 1/n \times$ (maximum number of steps in a…