相关论文: Nontrivial upper bound for chemical distance on th…
In this paper we introduce the two-sided level-set for the two-dimensional discrete Gaussian free field. Then we investigate the chemical distance for the two-sided level-set percolation. Our result shows that the chemical distance should…
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…
Despite great progress in the study of critical percolation on $\mathbb{Z}^d$ for $d$ large, properties of critical clusters in high-dimensional fractional spaces and boxes remain poorly understood, unlike the situation in two dimensions.…
Let $\mathcal{C}^n$ be the largest open cluster for supercritical Bernoulli bond percolation in $[-n, n]^d \cap \mathbb{Z}^d$ with $d \ge 2$. We obtain a sharp estimate for the effective resistance on $\mathcal{C}^n$. As an application we…
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 consider two-dimensional percolation in the scaling limit close to criticality and use integrable field theory to obtain universal predictions for the probability that at least one cluster crosses between opposite sides of a rectangle of…
We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…
This article proposes a new way of deriving mean-field exponents for sufficiently spread-out Bernoulli percolation in dimensions $d>6$. We obtain an upper bound for the full-space and half-space two-point functions in the critical and…
Analytical results are derived for the bond percolation threshold and the size of the giant connected component in a class of random networks with non-zero clustering. The network's degree distribution and clustering spectrum may be…
We study cluster sizes in supercritical $d$-dimensional inhomogeneous percolation models with long-range edges -- such as long-range percolation -- and/or heavy-tailed degree distributions -- such as geometric inhomogeneous random graphs…
We establish two-sided heat kernel estimates for random conductance models with non-uniformly elliptic (possibly degenerate) stable-like jumps on graphs. These are long range counterparts of well known two-sided Gaussian heat kernel…
We consider the cluster and backbone mass distributions between two lines of arbitrary orientations and lengths in porous media in three dimensions, and model the porous media by bond percolation at the percolation threshold $p_c$. We…
We propose a new model of cluster growth according to which the probability that a new unit is placed in a point at a distance $r$ from the city center is a Gaussian with mean equal to the cluster radius and variance proportional to the…
We present Monte Carlo estimates for site and bond percolation thresholds in simple hypercubic lattices with 4 to 13 dimensions. For d<6 they are preliminary, for d >= 6 they are between 20 to 10^4 times more precise than the best previous…
Consider Bernoulli bond percolation on a graph nicely embedded in hyperbolic space $\mathbb H^d$ in such a way that it admits a transitive action by isometries of $\mathbb H^d$. Let $p_0$ be the supremum of such percolation parameters that…
Let $ \mathbb{L}^{d} = ( \mathbb{Z}^{d},\mathbb{E}^{d} ) $ be the $ d $-dimensional hypercubic lattice. We consider a model of inhomogeneous Bernoulli percolation on $ \mathbb{L}^{d} $ in which every edge inside the $ s $-dimensional…
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 establish sharp upper and lower estimates of the Dunkl kernel in the case of dihedral groups.
It is known that the critical probability for the percolation transition is not a sharp threshold, actually it is a region of non-zero width $\Delta p_c$ for systems of finite size. Here we present evidence that for complex networks $\Delta…
Motivated by network resilience and insurance premiums in the context of cyber security, we derive universal upper bounds for the first and second moments of the size of bond percolation clusters on finite regular graphs. Thinking of the…