相关论文: Indistinguishability of Percolation Clusters
The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops…
We consider a random connection model (RCM) on a general space driven by a Poisson process whose intensity measure is scaled by a parameter $t\ge 0$. We say that the infinite clusters are deletion stable if the removal of a Poisson point…
Percolation theory can be used to describe the structural properties of complex networks using the generating function formulation. This mapping assumes that the network is locally tree-like and does not contain short-range loops between…
We consider the supercritical oriented percolation model. Let ${\fK}$ be all the percolation points. For each $u\in {\fK}$, we write $\gamma_u$ as its right-most path. Let $G=\cup_u \gamma_u$. In this paper, we show that $G$ is a single…
We consider a broad class of dependent site-percolation models on $\mathbb{Z}^d$ obtained by applying a monotone automaton to a random initial particle configuration drawn from a stochastically increasing family of measures. We prove that…
We study the distribution of finite clusters in slightly supercritical ($p \downarrow p_c$) Bernoulli bond percolation on transitive nonamenable graphs, proving in particular that if $G$ is a transitive nonamenable graph satisfying the…
We prove that for supercritical percolation on every infinite transitive graph, the probability that the origin belongs to a finite cluster of size at least $n$ decays exponentially in $\Phi(n)$, where $\Phi$ is the isoperimetric function…
Suppose each site independently and randomly chooses some sites around it, and it is weakly (strongly) connected with them (if there choose each other). What is the probability that the weak (strong) connected cluster is infinite? We…
We study Poisson--Voronoi percolation and its discrete analogue Bernoulli--Voronoi percolation in spaces with a non-amenable product structure. We develop a new method of proving smallness of the uniqueness threshold $p_u(\lambda)$ at small…
The percolation properties of clustered networks are analyzed in detail. In the case of weak clustering, we present an analytical approach that allows to find the critical threshold and the size of the giant component. Numerical simulations…
We characterise the group property of being with infinite conjugacy classes for wreath products of groups
We prove that critical percolation has no infinite clusters almost surely on any unimodular quasi-transitive graph satisfying a return probability upper bound of the form $p_n(v,v) \leq \exp\left[-\Omega(n^\gamma)\right]$ for some…
The Burton--Keane theorem for the almost-sure uniqueness of infinite clusters is a landmark of stochastic geometry. Let $\mu$ be a translation-invariant probability measure with the finite-energy property on the edge-set of a…
We show that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. This comes as a corollary of a similar decomposition theorem…
We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups. This technique allows us to provide examples of…
The structure of many real networks is not locally tree-like and hence, network analysis fails to characterise their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, and S. Dobson, Percolation in…
The incipient infinite cluster (IIC) measure is the percolation measure at criticality conditioned on the cluster of the origin to be infinite. Using the lace expansion, we construct the IIC measure for high-dimensional percolation models…
We investigate the formation of an infinite cluster of entangled threads in a (2+1)-dimensional system. We demonstrate that topological percolation belongs to the universality class of the standard 2D bond percolation. We compute the…
We consider the constrained-degree percolation (CDP) model on the hypercubic lattice. This is a continuous-time percolation model defined by a sequence $(U_e)_{e\in\mathcal{E}^d}$ of i.i.d. uniform random variables and a positive integer…
The number of clusters per site $n(p)$ in percolation at the critical point $p = p_c$ is not itself a universal quantity---it depends upon the lattice and percolation type (site or bond). However, many of its properties, including…