A. Gillett, M. Nuyens
We introduce a continuum percolation model defined on the points of a d-dimensional homogeneous Poisson process. Each Poisson point is connected to all points within its connection range, which depends on the distances to the other Poisson points. We show that the new model exhibits a phase transition, and obtain results about the critical values in low and high dimensions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Sensitive bootstrap percolation second term
本文研究二维修正型两邻点自助渗流模型，证明其感染时间渐近展开第二项含对数因子，标度行为异于经典两邻点模型，给出了$p$趋于0时感染时间的高概率上界。
Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^3$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the $\pm e_i$-directions for each $i \in \{1,2,3\}$, where $a_1\le a_2\le a_3$. Suppose we infect any healthy vertex $x\in [L]^3$ already having $a_3+1$ infected neighbours, and that infected sites remain infected forever. In this paper we determine the critical length for percolation up to a constant factor in the exponent, for all triples $(a_1,a_2,a_3)$. To do so, we introduce a new algorithm called the bea…
Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^3$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the $\pm e_i$-directions for each $i \in \{1,2,3\}$, where $a_1\le a_2\le a_3$. Suppose we infect any healthy vertex $v\in [L]^3$ already having $r$ infected neighbours, and that infected sites remain infected forever. In this paper we determine $\log$ of the critical length for percolation up to a constant factor, for all $r\in \{a_3+1, \dots, a_3+a_2\}$ with $a_3\ge a_1+a_2$. We moreover give upper bounds fo…
We investigate continuum percolation for Cox point processes, that is, Poisson point processes driven by random intensity measures. First, we derive sufficient conditions for the existence of non-trivial sub- and super-critical percolation regimes based on the notion of stabilization. Second, we give asymptotic expressions for the percolation probability in large-radius, high-density and coupled regimes. In some regimes, we find universality, whereas in others, a sensitive dependence on the underlying random intensity measure survives.
Quenched Invariance Principle for a Reflecting Diffusion in a Continuum Percolation Cluster
本文研究了平稳遍历点过程上的连续渗流，在占据区域存在唯一无界簇且满足体积正则性和等周条件的假设下，证明了簇上反射扩散的淬火不变性原理。
The continuum percolation for Markov (or Gibbs) germ-grain models is investigated. The grains are assumed circular with random radii on a compact support. The morphological interaction is the so-called Quermass interaction defined by a linear combination of the classical Minkowski functionals (area, perimeter and Euler-Poincaré characteristic). We show that the percolation occurs for any coefficient of this linear combination and for a large enough activity parameter. An application to the phase transition of the multi-type Quermass model is given.
In r-neighbour bootstrap percolation on the vertex set of a graph G, vertices are initially infected independently with some probability p. At each time step, the infected set expands by infecting all uninfected vertices that have at least r infected neighbours. We study the distribution of the time t at which all vertices become infected. Given t = t(n) = o(log n/log log n), we prove a sharp threshold result for the probability that percolation occurs by time t in d-neighbour bootstrap percolation on the d-dimensional discrete torus T_n^d. Moreover, we show that for certain ranges of p = p(n)…
We consider percolation properties of the Boolean model generated by a Gibbs point process and balls with deterministic radius. We show that for a large class of Gibbs point processes there exists a critical activity, such that percolation occurs a.s. above criticality. For locally stable Gibbs point processes we show a converse result, i.e. they do not percolate a.s. at low activity.
We consider some continuum percolation models. We are mainly interested in giving some sufficient conditions for absence of percolation. We give some general conditions and then focuse on two examples. The first one is a multiscale percolation model based on the Boolean model. It was introduced by Meester and Roy and subsequently studied by Menshikov, Popov and Vachkovskaia. The second one is based on the stable marriage of Poisson and Lebesgue introduced by Hoffman, Holroyd and Peres and whose percolation properties have been studied by Freire, Popov and Vachkovskaia.
In the $r$-neighbour bootstrap process on a graph $G$, vertices are infected (in each time step) if they have at least $r$ already-infected neighbours. Motivated by its close connections to models from statistical physics, such as the Ising model of ferromagnetism, and kinetically constrained spin models of the liquid-glass transition, the most extensively-studied case is the two-neighbour bootstrap process on the two-dimensional grid $[n]^2$. Around 15 years ago, in a major breakthrough, Holroyd determined the sharp threshold for percolation in this model, and his bounds were subsequently sha…
The study of real-life network modeling has become very popular in recent years. An attractive model is the scale-free percolation model on the lattice $\mathbb{Z}^d$, $d\ge1$, because it fulfills several stylized facts observed in large real-life networks. We adopt this model to continuum space which leads to a heterogeneous random-connection model on $\mathbb{R}^d$: particles are generated by a homogeneous marked Poisson point process on $\mathbb{R}^d$, and the probability of an edge between two particles is determined by their marks and their distance. In this model we study several propert…
Answering questions of Itai Benjamini, we show that the event of complete occupation in 2-neighbour bootstrap percolation on the d-dimensional box [n]^d, for d\geq 2, at its critical initial density p_c(n), is noise sensitive, while in k-neighbour bootstrap percolation on the d-regular random graph G_{n,d}, for 2\leq k\leq d-2, it is insensitive. Many open problems remain.
We study the problem of continuum percolation in infinite volume Gibbs measures for particles with an attractive pair potential, with a focus on low temperatures (large $β$). The main results are bounds on percolation thresholds $ρ_\pm(β)$ in terms of the density rather than the chemical potential or activity. In addition, we prove a variational formula for a large deviations rate function for cluster size distributions. This formula establishes a link with the Gibbs variational principle and a form of equivalence of ensembles, and allows us to combine knowledge on finite volume, canonical Gib…
We consider the Poisson Boolean model of continuum percolation. We show that there is a subcritical phase if and only if $E(R^d)$ is finite, where $R$ denotes the radius of the balls around Poisson points and $d$ denotes the dimension. We also give related results concerning the integrability of the diameter of subcritical clusters.
Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^d$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the $\pm e_i$-directions for each $i \in \{1,2,\dots, d\}$, where $a_1\le a_2\le \dots \le a_d$. Suppose we infect any healthy vertex $v\in [L]^d$ already having $r$ infected neighbours, and that infected sites remain infected forever. In this paper we determine the $(d-1)$-times iterated logarithm of the critical length for percolation up to a constant factor, for all $d$-tuples $(a_1,\dots ,a_d)$ and all $r\…
Any infinite graph has site and bond percolation critical probabilities satisfying $p_c^{site}\geq p_c^{bond}$. The strict version of this inequality holds for many, but not all, infinite graphs. In this paper, the class of graphs for which the strict inequality holds is extended to a continuum percolation model. In Gilbert's graph with supercritical density on the Euclidean plane, there is almost surely a unique infinite connected component. We show that on this component $p_c^{site} > p_c^{bond}$. This also holds in higher dimensions.
We consider the Poisson Boolean model of continuum percolation on a homogeneous Riemannian manifold $M$. Let $lambda$ be intensity of the Poisson process in the model and let $lambda_u$ be the infimum of the set of intensities that a.s. produce a unique unbounded component. We show that above $λ_u$ there is a.s. a unique unbounded component. We also study what happens at $λ_u$ for some spaces. In particular, if $M$ is the product of the hyperbolic disc and the real line, then at $λ_u$ there is a.s. not a unique unbounded component. The results are inspired by results for Bernoulli bond percola…
We consider the Poisson Boolean percolation model in $\mathbb{R}^2$, where the radii of each ball is independently chosen according to some probability measure with finite second moment. For this model, we show that the two thresholds, for the existence of an unbounded occupied and an unbounded vacant component, coincide. This complements a recent study of the sharpness of the phase transition in Poisson Boolean percolation by the same authors. As a corollary it follows that for Poisson Boolean percolation in $\mathbb{R}^d$, for any $d\ge2$, finite moment of order $d$ is both necessary and suf…
Continuum Percolation in a Nonstabilizing Environment
本文研究非稳定环境中基于Cox点过程的布尔模型的连续渗流相变，通过离散化与随机拉伸晶格比较，证明参数单独或联合变化时的相变存在性。
We consider the Boolean model with random radii based on Cox point processes. Under a condition of stabilization for the random environment, we establish existence and non-existence of subcritical regimes for the size of the cluster at the origin in terms of volume, diameter and number of points. Further, we prove uniqueness of the infinite cluster for sufficiently connected environments.
Extremal Bounds for Three-Neighbour Bootstrap Percolation in Dimensions Two and Three
本文精确确定了三维网格中三邻居自举渗流的最小感染集合基数，并刻画了二维网格中基数为(ab+a+b)/3的渗流集合存在的整数条件，解决了Benevides等人提出的公开问题。
The continuum random cluster model is a Gibbs modification of the standard boolean model of intensity $z > 0$ and law of radii $Q$. The formal unormalized density is given by $q^{N_{cc}}$ where $q$ is a fixed parameter and $N_{cc}$ is the number of connected components in the random structure. We prove for a large class of parameters that percolation occurs for $z$ large enough and does not occur for $z$ small enough. An application to the phase transition of the Widom-Rowlinson model with random radii is given. Our main tools are stochastic domination properties, a fine study of the interacti…
We consider the Boolean model on $\R^d$. We prove some equivalences between subcritical percolation properties. Let us introduce some notations to state one of these equivalences. Let $C$ denote the connected component of the origin in the Boolean model. Let $|C|$ denotes its volume. Let $\ell$ denote the maximal length of a chain of random balls from the origin. Under optimal integrability conditions on the radii, we prove that $E(|C|)$ is finite if and only if there exists $A,B >0$ such that $¶(\ell \ge n) \le Ae^{-Bn}$ for all $n \ge 1$.
Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $λ,μ$. For any $λ>0$ we consider the percolation threshold $μ_c(λ)$ associated to the parameter $μ$. Denoting by $λ_c:= λ_c(2r)$ the percolation threshold for the standard Poisson Boolean model with radii $r$, we show the lower bound $μ_c(λ)\ge c\log(c/(λ-λ_c))$ for any $λ>λ_c$ with $c>0$ a fixed constant. In particular, $μ_c(λ)$ tends to infinity when $λ$ tends to $λ_c$ from above.
In this note, we study the directed first passage percolation introduced in [F. Comets, R. Fukushima, S. Nakajima and N. Yoshida: Journal of Statistical Physics, 161-(3), 577-597 (2015)]. It is proved that the shortest path from the origin to the $n$-th hyperplane makes a jump larger than a small power of $\log n$. Some numerical results are also provided, which indicates that the maximal jump size is much larger in a certain parameter region.
Consider a Boolean model $Σ$ in $\R^d$. The centers are given by a homogeneous Poisson point process with intensity $λ$ and the radii of distinct balls are i.i.d.\ with common distribution $ν$. The critical covered volume is the proportion of space covered by $Σ$ when the intensity $λ$ is critical for percolation. Previous numerical simulations and heuristic arguments suggest that the critical covered volume may be minimal when $ν$ is a Dirac measure. In this paper, we prove that it is not the case in sufficiently high dimension.
Consider an independent site percolation model with parameter $p \in (0,1)$ on $\Z^d,\ d\geq 2$ where there are only nearest neighbor bonds and long range bonds of length $k$ parallel to each coordinate axis. We show that the percolation threshold of such model converges to $p_c(\Z^{2d})$ when $k$ goes to infinity, the percolation threshold for ordinary (nearest neighbour) percolation on $\Z^{2d}$. We also generalize this result for models whose long range bonds have several lengths.
Graph distances of continuum long-range percolation
本文研究了基于 Poisson 点过程的连续长程渗流模型中的图论距离，证明了该随机图模型在 $s=d$ 和 $s=2d$ 处发生相变，与经典长程渗流类似。
Largest component and sharpness in continuum percolation
本文研究了在非临界情况下泊松随机连接模型中大连接组件的行为，证明了在亚临界情况下最大组件大小在窗口体积上以对数增长，在超临界情况下线性增长，并证明了在亚临界情况下原点集群的尾部呈指数衰减。
In this work, we study a new model for continuum line-of-sight percolation in a random environment driven by the Poisson-Voronoi tessellation in the $d$-dimensional Euclidean space. The edges (one-dimensional facets, or simply 1-facets) of this tessellation are the support of a Cox point process, while the vertices (zero-dimensional facets or simply 0-facets) are the support of a Bernoulli point process. Taking the superposition $Z$ of these two processes, two points of $Z$ are linked by an edge if and only if they are sufficiently close and located on the same edge (1-facet) of the supporting…
We consider the supercritical finite-range random connection model where the points $x,y$ of a homogeneous planar Poisson process are connected with probability $f(|y-x|)$ for a given $f$. Performing percolation on the resulting graph, we show that the critical probabilities for site and bond percolation satisfy the strict inequality $p_c^{\rm site} > p_c^{\rm bond}$. We also show that reducing the connection function $f$ strictly increases the critical Poisson intensity. Finally, we deduce that performing a spreading transformation on $f$ (thereby allowing connections over greater distances b…
Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $λ,μ$. We show for $d \geq 2$ that if $λ$ is supercritical for the one-type random geometric graph with distance parameter $2r$, there exists $μ$ such that $(λ,μ)$ is supercritical (this was previously known for $d=2$). For $d=2$ we also consider the restriction of this graph to points in the unit square. Taking $μ= τλ$ for fixed $τ$, we give a strong law of large numbers as $λ\to \infty$, for the connectivity threshold of thi…
Spatial random graphs capture several important properties of real-world networks. We prove quenched results for the continuum space version of scale-free percolation introduced in [DW18]. This is an undirected inhomogeneous random graph whose vertices are given by a Poisson point process in $\mathbb R^d$. Each vertex is equipped with a random weight and the probability that two vertices are connected by an edge depends on their weights and on their distance. Under suitable conditions on the parameters of the model, we show that, for almost all realizations of the point process, the degree dis…
Consider a Boolean model $Σ$ in $\R^d$. The centers are given by a homogeneous Poisson point process with intensity $λ$ and the radii of distinct balls are i.i.d.\ with common distribution $ν$. The critical covered volume is the proportion of space covered by $Σ$ when the intensity $λ$ is critical for percolation. Previous numerical simulations and heuristic arguments suggest that the critical covered volume may be minimal when $ν$ is a Dirac measure. In this paper, we prove that it is not the case at least in high dimension. To establish this result we study the asymptotic behaviour, as $d$ t…
We study the percolation time of the $r$-neighbour bootstrap percolation model on the discrete torus $(\Z/n\Z)^d$. For $t$ at most a polylog function of $n$ and initial infection probabilities within certain ranges depending on $t$, we prove that the percolation time of a random subset of the torus is exactly equal to $t$ with high probability as $n$ tends to infinity. Our proof rests crucially on three new extremal theorems that together establish an almost complete understanding of the geometric behaviour of the $r$-neighbour bootstrap process in the dense setting. The special case $d-r=0$ o…
Degenerate Diffusions on Continuum Percolation and Hamilton-Jacobi-Bellman Equations
研究在连续渗流簇上的退化受控扩散和Hamilton-Jacobi-Bellman方程，证明扩散永不触及边界并存在唯一全局强解，建立随机控制表示公式，验证布尔模型等具体模型满足假设。
Scaling limit of critical percolation clusters on hyperbolic random half-planar triangulations and the associated random walks
本文证明了半平面随机双曲三角剖分上临界渗流簇的Gromov-Hausdorff-Prohorov标度极限为布朗连续随机树，并推得其上的简单随机游走重标度为该树上的布朗运动。
Local Central Limit Theorem for Reflecting Diffusions in a Continuum Percolation Cluster
本文研究连续渗流簇上的反射扩散问题，在无界簇唯一且满足若干几何条件的假设下，证明了对应的淬火局部中心极限定理。
Consider the long-range percolation model on the integer lattice $\mathbb{Z}^d$ in which all nearest-neighbour edges are present and otherwise $x$ and $y$ are connected with probability $q_{x,y}:=1-\exp(-|x-y|^{-s})$, independently of the state of other edges. Throughout the regime where the model yields a locally-finite graph, (i.e.\ for $s>d$,) we determine the spectral dimension of the associated simple random walk, apart from at the exceptional value $d=1$, $s=2$, where the spectral dimension is discontinuous. Towards this end, we present various on-diagonal heat kernel bounds, a number of…
Lipschitz continuity of the time constant for continuum percolation
研究布尔模型连续渗流中时间常数关于强度的Lipschitz连续性，通过改编Can、Nakajima和Nguyen的论证方法证明。
We discuss the interrelation between phase transitions in interacting lattice or continuum models, and the existence of infinite clusters in suitable random-graph models. In particular, we describe a random-geometric approach to the phase transition in the continuum Ising model of two species of particles with soft or hard interspecies repulsion. We comment also on the related area-interaction process and on perfect simulation.
Sharp phase transition for percolation with short-range dependencies
研究\(\mathbb{Z}^d\)上最近邻渗流模型相变的尖锐性，用OSSS不等式及改进方法证明，还对伯努利键渗流和位点渗流相结合的特殊情况做更广泛研究。
Spectra of Poisson functionals and applications in continuum percolation
本文为泊松泛函引入谱点过程概念，并利用其证明临界连续渗流模型（泊松布尔与泊松沃罗诺伊）中交叉事件的尖锐噪声不稳定性和敏感性，核心工具是 Wiener-Itô 展开与拟乘性估计。
We study continuum percolation on certain negatively dependent point processes on \R^2. Specifically, we study the Ginibre ensemble and the planar Gaussian zero process, which are the two main natural models of translation invariant point processes on the plane exhibiting local repulsion. For the Ginibre ensemble, we establish the uniqueness of infinite cluster in the supercritical phase. For the Gaussian zero process, we establish that a non-trivial critical radius exists, and we prove the uniqueness of infinite cluster in the supercritical regime.
Sharp metastability transition for two-dimensional bootstrap percolation with symmetric isotropic threshold rules
本文证明二维临界自举渗流中所有具有凸对称邻域的各向同性阈值规则均发生尖锐亚稳态相变，推广了此前仅对特定规则成立的结果。
We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation. More precisely, we show that - for $p<p_c$, the probability that the origin is connected by an open path to distance $n$ decays exponentially fast in $n$. - for $p>p_c$, the probability that the origin belongs to an infinite cluster satisfies the mean-field lower bound $θ(p)\ge\tfrac{p-p_c}{p(1-p_c)}$. This note presents the argument of \cite{DumTas15}, which is valid for long-range Bernoulli percolation (and for the Ising model) on arbitrary transitive graphs in the simpler framework o…
We study the continuum percolation model, which is defined on $\mathbb{Z}^d\times \mathbb{R}$ so that the connections in the continuous directions are not oriented in time, with quasiperiodically disordered fields. The oriented version of the model is the contact process. We consider intermediate strengths of disorder of the fields and show stretched exponential decay of correlations.
We prove that the Poisson Boolean model, also known as the Gilbert disc model, is noise sensitive at criticality. This is the first such result for a Continuum Percolation model, and the first for which the critical probability p_c \ne 1/2. Our proof uses a version of the Benjamini-Kalai-Schramm Theorem for biased product measures. A quantitative version of this result was recently proved by Keller and Kindler. We give a simple deduction of the non-quantitative result from the unbiased version. We also develop a quite general method of approximating Continuum Percolation models by discrete mod…
We study the distribution of the percolation time $T$ of two-neighbour bootstrap percolation on $[n]^2$ with initial set $A\sim\mathrm{Bin}([n]^2,p)$. We determine $T$ with high probability up to a constant factor for all $p$ above the critical probability for percolation, and to within a $1+o(1)$ factor for a large range of $p$.
Under some general assumptions, we construct the scaling limit of open clusters and their associated counting measures in a class of two dimensional percolation models. Our results apply, in particular, to critical Bernoulli site percolation on the triangular lattice and to the critical FK-Ising model on the square lattice. Fundamental properties of the scaling limit, such as conformal covariance, are explored. As an application to Bernoulli percolation, we obtain the scaling limit of the largest cluster in a bounded domain. We also apply our results to the critical, two-dimensional Ising mode…
We consider point to point last passage times to every vertex in a neighbourhood of size $δN^{\frac{2}{3}}$, distance $N$ away from the starting point. The increments of these last passage times in this neighbourhood are shown to be jointly equal to their stationary versions with high probability that depends on $δ$ only. With the help of this result we show that 1) the $\text{Airy}_2$ process is locally close to a Brownian motion in total variation; 2) the tree of point to point geodesics starting from every vertex in a box of side length $δN^{\frac{2}{3}}$ going to a point at distance $N$ ag…
We use the lace expansion to prove that the critical values for nearest-neighbour bond percolation on the $n$-cube $\{0,1\}^n$ and on $\mathbb{Z}^n$ have asymptotic expansions, with rational coefficients, to all orders in powers of $n^{-1}$.
We study the phase transition of random radii Poisson Boolean percolation: Around each point of a planar Poisson point process, we draw a disc of random radius, independently for each point. The behavior of this process is well understood when the radii are uniformly bounded from above. In this article, we investigate this process for unbounded (and possibly heavy tailed) radii distributions. Under mild assumptions on the radius distribution, we show that both the vacant and occupied sets undergo a phase transition at the same critical parameter $λ_c$. Moreover, - For $λ< λ_c$, the vacant set …
Let A be the annulus in R^2 centered at the origin with inner and outer radii r(1-ε) and r, respectively. Place points {x_i} in R^2 according to a Poisson process with intensity 1 and let G_A be the random graph with vertex set {x_i} and edges x_ix_j whenever x_i-x_j\in A. We show that if the area of A is large, then G_A almost surely has an infinite component. Moreover, if we fix ε, increase r and let n_c=n_c(ε) be the area of A when this infinite component appears, then n_c\to1 as ε\to 0. This is in contrast to the case of a ``square'' annulus where we show that n_c is bounded away from 1.
Motivated by an application in wireless telecommunication networks, we consider a two-type continuum-percolation problem involving a homogeneous Poisson point process of users and a stationary and ergodic point process of base stations. Starting from a randomly chosen point of the Poisson point process, we investigate distribution of the minimum number of hops that are needed to reach some point of the second point process. In the supercritical regime of continuum percolation, we use the close relationship between Euclidean and chemical distance to identify the distributional limit of the resc…
Percolation theory has become a useful tool for the analysis of large-scale wireless networks. We investigate the fundamental problem of characterizing the critical density $λ_c^{(d)}$ for $d$-dimensional Poisson random geometric graphs in continuum percolation theory. By using a probabilistic analysis which incorporates the clustering effect in random geometric graphs, we develop a new class of analytical lower bounds for the critical density $λ_c^{(d)}$ in $d$-dimensional Poisson random geometric graphs. The lower bounds are the tightest known to date. In particular, for the two-dimensional …
Discrete and continuum Liouville first passage percolation (DLFPP, LFPP) are two approximations of the conjectural $γ$-Liouville quantum gravity (LQG) metric, obtained by exponentiating the discrete Gaussian free field (GFF) and the circle average regularization of the continuum GFF respectively. We show that these two models can be coupled so that with high probability distances in these models agree up to $o(1)$ errors in the exponent, and thus have the same distance exponent. Ding and Gwynne (2018) give a formula for the continuum LFPP distance exponent in terms of the $γ$-LQG dimension exp…
Bootstrap percolation on the high-dimensional Hamming graph
本文研究高维Hamming图上的2-邻域随机bootstrap渗流，将超立方体上的相关临界概率渐近结果推广至该图，确定了特定k值范围下临界概率相差至多乘积常数的渐近行为。
Critical Poisson hyperplane percolation in hyperbolic space has no unbounded cells
该研究证明在双曲空间中，临界强度下泊松超平面渗流不存在无界单元，揭示了该模型的基本相变特性。
Explosive appearance of cores and bootstrap percolation on lattices
研究了二维格子上自激发渗透现象中核心大小的突然跃变及多种感染规则下的击中时间结果。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。