Related papers: Isoperimetric lower bounds for critical exponents …

We provide the first nontrivial upper bound for the chemical distance exponent in two-dimensional critical percolation. Specifically, we prove that the expected length of the shortest horizontal crossing path of a box of side length $n$ in…

We prove exponential concentration in i.i.d. first-passage percolation in $Z^d$ for all $d \geq 2$ and general edge-weights $(t_e)$. Precisely, under an exponential moment assumption $E e^{\alpha t_e}< \infty$ for some $\alpha>0$) on the…

We study the long range percolation model on $\mathbb{Z}$ where sites $i$ and $j$ are connected with probability $\beta |i-j|^{-s}$. Graph distances are now well understood for all exponents $s$ except in the case $s=2$ where the model…

Fractal percolation has been introduced by Mandelbrot in 1974. We study the two-dimensional case, with integer subdivision index M and survival probability p. It is well known that there exists a non-trivial critical value p_c(M) such that…

Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and…

We compute the critical exponents for nonextensive $\lambda\phi^{3}$ scalar field theory for all loop orders and $|q - 1| < 1$. We apply the results for both nonextensive percolation and Lee-Yang edge singularity problems. The corresponding…

We consider the vacant set of random interlacements on Z^d, with d bigger or equal to 3, in the percolative regime. Motivated by the large deviation principles obtained in our recent work arXiv:1304.7477, we investigate the asymptotic…

Consider random Schr\"odinger operators $H_n$ defined on $[0,n]\cap\mathbb{Z}$ with zero boundary conditions: $$ (H_n\psi)_\ell=\psi_{\ell-1}+\psi_{\ell+1}+\sigma\frac{\mathfrak{a}(\ell)}{n^{\alpha}}\psi_{\ell},\quad \ell=1,\cdots,n,\quad…

We use isoperimetric inequalities combined with a new technique to prove upper bounds for the site percolation threshold of plane graphs with given minimum degree conditions. In the process we prove tight new isoperimetric bounds for…

We propose a method of studying the continuous percolation of aligned objects as a limit of a corresponding discrete model. We show that the convergence of a discrete model to its continuous limit is controlled by a power-law dependency…

We consider a large class of spatially-embedded random graphs that includes among others long-range percolation, continuum scale-free percolation and the age-dependent random connection model. We assume that the model is supercritical:…

We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

We study limit laws for simple random walks on supercritical long-range percolation clusters on the integer lattice. For the long range percolation model, the probability that two vertices are connected behaves asymptotically as a negative…

We analyze the geometry of scaling limits of near-critical 2D percolation, i.e., for $p=p_c+\lambda\delta^{1/\nu}$, with $\nu=4/3$, as the lattice spacing $\delta \to 0$. Our proposed framework extends previous analyses for $p=p_c$, based…

We study the independent alignment percolation model on $\mathbb{Z}^d$ introduced by Beaton, Grimmett and Holmes [arXiv:1908.07203]. It is a model for random intersecting line segments defined as follows. First the sites of $\mathbb{Z}^d$…

Monte Carlo data simulating phase transitions in Ising strips $D\times L,$ ($D\llL) $ with periodic boundary conditions show that $T_{c}(D)=0$ for $D\leq D^{\ast}\simeq 6$ and $0<T_{c}(D)<T_{c}(d=2)$ for $D>D^{\ast}.$ Regular scaling of…

We identify the asymptotic distribution of the chemical distance in high-dimensional critical Bernoulli percolation. Namely, we show that the distance between the origin and a distant vertex conditioned to lie in the cluster of the origin…

We show that random walk on the incipient infinite cluster (IIC) of two-dimensional critical percolation is subdiffusive in the chemical distance (i.e., in the intrinsic graph metric). Kesten (1986) famously showed that this is true for the…

We prove optimal quantitative estimates on the first-order correctors on supercritical percolation clusters: we show that they are bounded in $d\geq 3$ and have logarithmic growth in $d = 2$, in the sense of stretched exponential moments.…