相关论文: Indistinguishability of Percolation Clusters

In this paper we consider Bernoulli percolation on an infinite connected bounded degrees graph $G$. Assuming the uniqueness of the infinite open cluster and a quasi-multiplicativity of crossing probabilities, we prove the existence of…

In this paper, we alternately obtain the almost sure uniqueness of the infinite open cluster in bond percolation in $\mathbb{Z}^d, d \geq 2,$ without requiring the use of ergodicity of translation action. If $N$ denotes the number of…

We introduce and analyse a class of fragmentation-coalescence processes defined on finite systems of particles organised into clusters. Coalescent events merge multiple clusters simultaneously to form a single larger cluster, while…

The percolation transitions on hyperbolic lattices are investigated numerically using finite-size scaling methods. The existence of two distinct percolation thresholds is verified. At the lower threshold, an unbounded cluster appears and…

Let $G$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. We prove that if $G$ is nonamenable and $p > p_c(G)$ then there exists a positive constant $c_p$ such that \[\mathbf{P}_p(n \leq |K| <…

Answering a question of Benjamini, we present an isometry-invariant random partition of the Euclidean space $\mathbb{R}^d$, $d\geq 3$, into infinite connected indistinguishable pieces, such that the adjacency graph defined on the pieces is…

We consider robustness and percolation properties of the networks of networks, in which random nodes in different individual networks (layers) can be interdependent. We explore the emergence of the giant mutually connected component,…

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

Percolation problems appear in a large variety of different contexts ranging from the design of composite materials to vaccination strategies on community networks. The key observable for many applications is the percolation threshold.…

We reinvestigate the 2D problem of the inhomogeneous incipient infinite cluster where, in an independent percolation model, the density decays to p_c with an inverse power, \lambda, of the distance to the origin. Assuming the existence of…

We give a new proof of a theorem of D. Calegari that says that the Cayley graph of a surface group with respect to any generating set lying in finitely many mapping class group orbits has infinite diameter. This applies, for instance, to…

We construct a 2-generated group $\Gamma $ such that its Cayley graph possesses finite connected subsets with arbitrarily big finite Heesch number.

We introduce and study a model of percolation with constant freezing (PCF) where edges open at constant rate 1, and clusters freeze at rate \alpha independently of their size. Our main result is that the infinite volume process can be…

Let $(G_n)_{n \geq 1} = ((V_n,E_n))_{n \geq 1}$ be a sequence of finite, connected, vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)_{n \geq 1}$ in $[0,1]$ is supercritical with respect…

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…

The linked cluster expansion has been shown to be highly efficient in calculating equilibrium and nonequilibrium properties of a variety of 1D and 2D classical and quantum lattice models. In this article, we extend the linked cluster method…

It is shown that there are groups $\Gamma$ with finite generating sets $S$ such that the adjacency operator of the Cayley graph ${\rm Cay}(\Gamma,S)$ is a disjoint union of $N$ intervals, for arbitrarily large integers $N$.

In critical percolation models, in a large cube there will typically be more than one cluster of comparable diameter. In 2D, the probability of $k>>1$ spanning clusters is of the order $e^{-\alpha k^{2}}$. In dimensions d>6, when $\eta = 0$…

Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…

We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…