Related papers: Indistinguishability for recurrent clusters

We consider a system of independent branching random walks on $\R$ which start off a Poisson point process with intensity of the form $e_{\lambda}(du)=e^{-\lambda u}du$, where $\lambda\in\R$ is chosen in such a way that the overall…

The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…

Using a measure of clustering derived from the nearest neighbour distribution and the void probability function we are able to distinguish between regular and clustered structures. With an example we show that regularity is a property of a…

We prove an inequality on decision trees on monotonic measures which generalizes the OSSS inequality on product spaces. As an application, we use this inequality to prove a number of new results on lattice spin models and their…

The uniform even subgraph is intimately related to the Ising model, the random-cluster model, the random current model, and the loop $\mathrm{O}$(1) model. In this paper, we first prove that the uniform even subgraph of $Z^d$ percolates for…

We consider loop ensembles on random trees. The loops are induced by a Poisson process of links sampled on the underlying tree interpreted as a metric graph. We allow two types of links, crosses and double bars. The crosses-only case…

We prove rigorously that the ferromagnetic Ising model on any nonamenable Cayley graph undergoes a continuous (second-order) phase transition in the sense that there is a unique Gibbs measure at the critical temperature. The proof of this…

We examine the interplay between anisotropy and percolation, i.e., the spontaneous formation of a system spanning cluster in an anisotropic model. We simulate an extension of a benchmark model of continuum percolation, the Boolean model,…

This paper proves a new central limit theorem for a sample that exhibits two-way dependence and heterogeneity across clusters. Statistical inference for situations with both two-way dependence and cluster heterogeneity has thus far been an…

We extend the observability model to multiplex networks. We present mathematical frameworks, valid under the treelike ansatz, able to describe the emergence of the macroscopic cluster of mutually observable nodes in both synthetic and…

Techniques of `dynamic renormalization', developed earlier for undirected percolation and the contact model, are adapted to the setting of directed percolation, thereby obtaining solutions of several problems for directed percolation on…

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…

We consider cumulative merging percolation (CMP), a long-range percolation process describing the iterative merging of clusters in networks, depending on their mass and mutual distance. For a specific class of CMP processes, which…

We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…

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 study percolation properties of the upper invariant measure of the contact process on $\mathbb{Z}^d$. Our main result is a sharp percolation phase transition with exponentially small clusters throughout the subcritical regime and a…

Percolation clusters are random fractals whose geometrical and transport properties can be characterized with the help of probability distribution functions. Using renormalized field theory, we determine the asymptotic form of various of…

For any system $\{i\}$ of particles with the trajectories $x_{i}(t)$ in $R^{d}$ on a finite time interval $[0,\tau]$ we define the interaction graph $G$. Vertices of $G$ are the particles, there is an edge between two particles $i,j$ iff…

We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are…

We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…