English
Related papers

Related papers: Entanglement percolation and spheres in $\mathbb{Z…

200 papers

Classical bond percolation theory studies the conditions for a given point in a random graph to be connected to infinity, or "escape" to infinity, via a sequence of random edges. In this work, we present a higher-dimensional generalization…

Probability · Mathematics 2026-05-15 Shu Kanazawa , Omer Bobrowski , Primoz Skraba

We have generalized the idea of backbend in a nearest-neighbor oriented bond percolation process by considering a backbend sequence $\beta : \mathbb{Z}_+ \to \mathbb{Z}_+ \cup \{\infty\}$, and defining a $\beta$-backbend path from the…

Probability · Mathematics 2021-08-24 Pinaki Mandal , Souvik Roy

Consider long-range Bernoulli percolation on $\mathbb{Z}^d$ in which we connect each pair of distinct points $x$ and $y$ by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta\geq 0$ is a…

Probability · Mathematics 2022-11-23 Tom Hutchcroft

We study long-range Bernoulli percolation on $\mathbb{Z}^d$ in which each two vertices $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta \|x-y\|^{-d-\alpha})$. It is a theorem of Noam Berger (CMP, 2002) that if…

Probability · Mathematics 2021-02-15 Tom Hutchcroft

We present a new proof (based on spectral decomposition) of a bound originally proved by Sidelnikov~\, for the frame potentials $\sum_{ij} \left( {\bf P}_i \cdot {\bf P}_j \right)^\ell $ on a unit--sphere in $d$ dimensions. Sidelnikov's…

Mathematical Physics · Physics 2024-12-10 Paolo Amore , Ricardo A. Sáenz

We consider random interlacements on $\mathbb{Z}^d$, $d \ge 3$. We show that the percolation function that to each $u \ge 0$ attaches the probability that the origin does not belong to an infinite cluster of the vacant set at level $u$, is…

Probability · Mathematics 2021-04-23 Alain-Sol Sznitman

We study bond percolation on the hypercube $\{0,1\}^m$ in the slightly subcritical regime where $p = p_c (1-\varepsilon_m)$ and $\varepsilon_m = o(1)$ but $\varepsilon_m \gg 2^{-m/3}$ and study the clusters of largest volume and diameter.…

Probability · Mathematics 2016-12-07 Tim Hulshof , Asaf Nachmias

We consider oriented percolation on Z^d times Z_+ whose bond-occupation probability is pD(...), where p is the percolation parameter and D is a probability distribution on Z^d. Suppose that D(x) decays as |x|^{-d-\alpha} for some \alpha>0.…

Probability · Mathematics 2007-08-21 Lung-Chi Chen , Akira Sakai

In high dimensional percolation at parameter $p < p_c$, the one-arm probability $\pi_p(n)$ is known to decay exponentially on scale $(p_c - p)^{-1/2}$. We show the same statement for the ratio $\pi_p(n) / \pi_{p_c}(n)$, establishing a form…

Probability · Mathematics 2021-08-02 Shirshendu Chatterjee , Jack Hanson , Philippe Sosoe

We consider the Cheeger constant $\phi(n)$ of the giant component of supercritical bond percolation on $\mathbb{Z}^d/n\mathbb{Z}^d$. We show that the variance of $\phi(n)$ is bounded by $\frac{\xi}{n^d}$, where $\xi$ is a positive constant…

Probability · Mathematics 2015-08-31 Eviatar B. Procaccia , Ron Rosenthal

We investigate random interlacements on Z^d, d bigger or equal to 3. This model recently introduced in arXiv:0704.2560 corresponds to a Poisson cloud on the space of doubly infinite trajectories modulo time-shift tending to infinity at…

Probability · Mathematics 2009-07-06 Vladas Sidoravicius , Alain-Sol Sznitman

We prove a lower bound on the entropy of sphere packings of $\mathbb R^d$ of density $\Theta(d \cdot 2^{-d})$. The entropy measures how plentiful such packings are, and our result is significantly stronger than the trivial lower bound that…

Probability · Mathematics 2019-12-04 Matthew Jenssen , Felix Joos , Will Perkins

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…

Probability · Mathematics 2021-07-22 Bernardo N. B. de Lima , Sébastien Martineau , Humberto C. Sanna , Daniel Valesin

We consider the following oriented percolation model of $\mathbb {N} \times \mathbb{Z}^d$: we equip $\mathbb {N}\times \mathbb{Z}^d$ with the edge set $\{[(n,x),(n+1,y)] | n\in \mathbb {N}, x,y\in \mathbb{Z}^d\}$, and we say that each edge…

Probability · Mathematics 2012-02-08 Hubert Lacoin

We study the problem of maximizing the minimal value over the sphere $S^{d-1}\subset \mathbb R^d$ of the potential generated by a configuration of $d+1$ points on $S^{d-1}$ (the maximal discrete polarization problem). The points interact…

Metric Geometry · Mathematics 2020-03-05 Sergiy Borodachov

In this work, we study the critical long-range percolation on $\mathbb{Z}$, where an edge connects $i$ and $j$ independently with probability $1-\exp\{-\beta |i-j|^{-2}\}$ for some fixed $\beta>0$. Viewing this as a random electric network…

Probability · Mathematics 2024-05-07 Jian Ding , Zherui Fan , Lu-Jing Huang

We prove a lower bound of $\Omega (d^{3/2} \cdot (2/\sqrt{3})^d)$ on the kissing number in dimension $d$. This improves the classical lower bound of Chabauty, Shannon, and Wyner by a linear factor in the dimension. We obtain a similar…

Metric Geometry · Mathematics 2018-07-10 Matthew Jenssen , Felix Joos , Will Perkins

We consider random interlacements on $ \mathbb{Z}^d$, $d \ge 3$, when their vacant set is in a strongly percolative regime. Given a large box centered at the origin, we establish an asymptotic upper bound on the exponential rate of decay of…

Probability · Mathematics 2021-11-03 Alain-Sol Sznitman

We consider first passage percolation with i.i.d. weights on edges of the d-dimensional cubic lattice. Under the assumptions that a weight is equal to zero with probability smaller than the critical probability of bond percolation in the…

Probability · Mathematics 2015-09-17 Naoki Kubota

Let $d\ge 3$ be a fixed integer, $p\in (0,1)$, and let $n\geq 1$ be a positive integer such that $dn$ is even. Let $\mathbb{G}(n, d, p)$ be a (random) graph on $n$ vertices obtained by drawing uniformly at random a $d$-regular (simple)…

Probability · Mathematics 2021-12-10 Umberto De Ambroggio , Matthew I. Roberts