Related papers: RMF accessibility percolation on oriented graphs
Bootstrap percolation is a type of cellular automaton which has been used to model various physical phenomena, such as ferromagnetism. For each natural number $r$, the $r$-neighbour bootstrap process is an update rule for vertices of a…
We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in…
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…
Suspensions of hard core spherical particles of diameter $D$ with inter-core connectivity range $\delta$ can be described in terms of random geometric graphs, where nodes represent the sphere centers and edges are assigned to any two…
Percolation is the paradigm for random connectivity and has been one of the most applied statistical models. With simple geometrical rules a transition is obtained which is related to magnetic models. This transition is, in all dimensions,…
We introduce a novel percolation model that generalizes the classical Random Connection Model (RCM) to a random simplicial complex, allowing for a more refined understanding of connectivity and emergence of large-scale structures in random…
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p=n^{-alpha} and alpha=alpha(n) is bounded away from 0. We show…
We study perturbations of the Erdos-Renyi model for which the statistical weight of a graph depends on the abundance of certain geometrical patterns. Using the formal correspondance with an exactly solvable effective model, we show the…
We consider first-passage percolation on the $d$ dimensional cubic lattice for $d \geq 2$; that is, we assign independently to each edge $e$ a nonnegative random weight $t_e$ with a common distribution and consider the induced random graph…
We study inhomogeneous Bernoulli bond percolation on the graph $G \times \mathbb{Z}$, where $G$ is a connected quasi-transitive graph. The inhomogeneity is introduced through a random region $R$ around the origin axis…
Charge transport in amorphous oxide semiconductors is often described as the band transport affected by disorder in the form of random potential barriers (RB). Theoretical studies in the framework of this approach neglected so far the…
Percolation in systems made up of randomly placed impermeable grains is often examined in the context of system spanning clusters of connected solids forming above a relatively low critical grain density $\rho_{c1}$ or networks of…
We investigate through direct molecular mechanics calculations the geometrical properties of hydrocarbon mantles subjected to percolation disorder. We show that the structures of mantles generated at the critical percolation point have a…
Fractal percolation exhibits a dramatic topological phase transition, changing abruptly from a dust-like set to a system spanning cluster. The transition points are unknown and difficult to estimate. In many classical percolation models the…
We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…
Random growth models are fundamental objects in modern probability theory, have given rise to new mathematics, and have numerous applications, including tumor growth and fluid flow in porous media. In this article, we introduce some of the…
Biological evolution can be conceptualized as a search process in the space of gene sequences guided by the fitness landscape, a mapping that assigns a measure of reproductive value to each genotype. Here we discuss probabilistic models of…
We consider inhomogeneous spatial random graphs on the real line. Each vertex carries an i.i.d. weight and edges are drawn such that short edges and edges to vertices with large weights occur with higher probability. This allows the study…
The square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…