Related papers: Alignment percolation
We present an analytical approach to determining the expected cascade size in a broad range of dynamical models on the class of random networks with arbitrary degree distribution and nonzero clustering introduced in [M.E.J. Newman, Phys.…
We prove quenched invariance principle for simple random walk on the unique infinite percolation cluster for a general class of percolation models on Z^d, d>=2, with long-range correlations introduced in arXiv:1212.2885, solving one of the…
We introduce the notion of topological electronic states on random lattices in non-integer dimensions. By considering a class $D$ model on critical percolation clusters embedded in two dimensions, we demonstrate that these topological…
We investigate properties of two-dimensional finite-scale percolation systems whose size along the current flow is smaller than the perpendicular size. Successive thresholds of appearing multiple percolation channels in such systems have…
We examine a model in which a nonequilibrium phase transition from an active to an extinct state is observed. The order of this phase transition has been shown to be either continuous or first-order, depending on the parameter values and…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
We study the recently-introduced directed percolation depinning (DPD) model for interface roughening with quenched disorder for which the interface becomes pinned by a directed percolation (DP) cluster for $d = 1$, or a directed surface…
In order to clarify how the percolation theory governs the conductivities in real materials which consist of small conductive particles, e.g., nanoparticles, with random configurations in an insulator, we numerically investigate the…
A sandpile model with stochastic toppling rule is studied. The control parameters and the phase diagram are determined through a MF approach, the subcritical and critical regions are analyzed. The model is found to have some similarities…
We solve exactly a special case of the anisotropic directed bond percolation problem in three dimensions, in which the occupation probability is 1 along two spatial directions, by mapping it to a five-vertex model. We determine the…
We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of…
The probability distributions of the masses of the clusters spanning from top to bottom of a percolating lattice at the percolation threshold are obtained in all dimensions from two to five. The first two cumulants and the exponents for the…
We consider the task of detecting a salient cluster in a sensor network, that is, an undirected graph with a random variable attached to each node. Motivated by recent research in environmental statistics and the drive to compete with the…
We show that choosing appropriate distributions of the randomness, the search for optimal paths links diverse problems of disordered media like directed percolation, invasion percolation, directed and non-directed spanning polymers. We also…
We consider the standard model of i.i.d. bond percolation on $\mathbb Z^d$ of parameter $p$. When $p>p_c$, there exists almost surely a unique infinite cluster $\mathcal C_p$. Using the recent techniques of Cerf and Dembin, we prove that…
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 study the percolation of strongly connected clusters (SCCs), in which sites are mutually reachable through directed paths, in systems with randomly oriented bonds by extensive simulations on hypercubic lattices from dimension $d=2$ to…
We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
We study some percolation problems on the complete graph over $\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the…