Related papers: Percolation in a multiscale Boolean model
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have…
Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and…
Recently it has been demonstrated that the connectivity transition from microscopic connectivity to macroscopic connectedness, known as percolation, is generically announced by a cascade of microtransitions of the percolation order…
We discuss averaged turbulence modeling of multi-scales of length for an incompressible Newtonian fluid, with the help of the maximum information principle. We suppose that there exists a function basis to decompose the turbulent…
Multiplicity fluctuations of intermediate-mass fragments are studied with the percolation model. It is shown that super-Poissonian fluctuations occur near the percolation transition and that this behavior is associated with the…
Percolation clusters are probably the simplest example for scale--invariant structures which either are governed by isotropic scaling--laws (``self--similarity'') or --- as in the case of directed percolation --- may display anisotropic…
Percolation is a paradigmatic model in disordered systems and has been applied to various natural phenomena. The percolation transition is known as one of the most robust continuous transitions. However, recent extensive studies have…
We answer the following question: if the occupied (or vacant) set of a planar Poisson Boolean percolation model does contain a crossing of an $n\times n$ square, how wide is this crossing? The answer depends on the whether we consider the…
We study the giant component problem slightly above the critical regime for percolation on Poissonian random graphs in the scale-free regime, where the vertex weights and degrees have a diverging second moment. Critical percolation on…
Survival and percolation probabilities are most important quantities in the theory and in the application of growth models with spreading. We construct field theoretical expressions for these probabilities which are feasible for…
Consider a Boolean model $\Sigma$ in $\R^d$. The centers are given by a homogeneous Poisson point process with intensity $\lambda$ and the radii of distinct balls are i.i.d.\ with common distribution $\nu$. The critical covered volume is…
The partition function of the finite $1+\epsilon$ state Potts model is shown to yield a closed form for the distribution of clusters in the immediate vicinity of the percolation transition. Various important properties of the transition are…
Complex networks display various types of percolation transitions. We show that the degree distribution and the degree-degree correlation alone are not sufficient to describe diverse percolation critical phenomena. This suggests that a…
We present exact solutions for the size of the giant connected component (GCC) of graphs composed of higher-order homogeneous cycles, including weak cycles and cliques, following bond percolation. We use our theoretical result to find the…
Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a deterministic "puzzle graph" by using connectivity properties of a random "people graph" on the same set of vertices. We presume the Erdos--Renyi…
Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the `people' graph…
While classical percolation is well understood, percolation effects in randomly packed or jammed structures are much less explored. Here we investigate both experimentally and theoretically the electrical percolation in a binary composite…
We study the process of bootstrap percolation on n x n permutation matrices, inspired by the work of Shapiro and Stephens [5]. In this percolation model, cells mutate (from 0 to 1) if at least two of their cardinal neighbors contain a 1,…
Traditional percolation theory assumes static microscopic rules, limiting its ability to describe real-world complex systems where macroscopic order actively regulates local interactions. Here, we introduce feedback percolation, an unified…
In $H$-percolation, we start with an Erd\H{o}s--R\'enyi graph ${\mathcal G}_{n,p}$ and then iteratively add edges that complete copies of $H$. The process percolates if all edges missing from ${\mathcal G}_{n,p}$ are eventually added. We…