Related papers: The threshold for jigsaw percolation on random gra…
We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…
The social percolation model \citep{solomon-et-00} considers a 2-dimensional regular lattice. Each site is occupied by an agent with a preference $x_{i}$ sampled from a uniform distribution $U[0,1]$. Agents transfer the information about…
In this paper, we study a model of long-range site percolation on graphs of bounded degree, namely the Boolean percolation model. In this model, each vertex of an infinite connected graph is the center of a ball of random radius, and…
We consider site (vertex) percolation on $d$-regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergence of the ``Erd\H{o}s-R\'enyi component phenomenon" in the…
In many systems consisting of interacting subsystems, the complex interactions between elements can be represented using multilayer networks. However percolation, key to understanding connectivity and robustness, is not trivially…
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…
We prove tight bounds on the site percolation threshold for $k$-uniform hypergraphs of maximum degree $\Delta$ and for $k$-uniform hypergraphs of maximum degree $\Delta$ in which any pair of edges overlaps in at most $r$ vertices. The…
A bootstrap percolation process on a graph $G$ is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round each uninfected node which has at least $r$ infected neighbours…
In many real network systems, nodes usually cooperate with each other and form groups, in order to enhance their robustness to risks. This motivates us to study a new type of percolation, group percolation, in interdependent networks under…
We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, Random graphs with a given degree distribution, in a way that admits a…
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure communication in the presence of eavesdroppers is possible. The…
In this Letter, we show that the explosive percolation is a novel continuous phase transition. The order-parameter-distribution histogram at the percolation threshold is studied in Erd\H{o}s-R\'{e}nyi networks, scale-free networks, and…
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…
Percolation on a one-dimensional lattice and fractals such as the Sierpinski gasket is typically considered to be trivial because they percolate only at full bond density. By dressing up such lattices with small-world bonds, a novel…
In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain…
K-clique percolation is an overlapping community finding algorithm which extracts particular structures, comprised of overlapping cliques, from complex networks. While it is conceptually straightforward, and can be elegantly expressed using…
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 generalize the random graph evolution process of Bohman, Frieze, and Wormald [T. Bohman, A. Frieze, and N. C. Wormald, Random Struct. Algorithms, 25, 432 (2004)]. Potential edges, sampled uniformly at random from the complete graph, are…
A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…
Let $G$ be a vertex-transitive graph of superlinear polynomial growth. Given $r>0$, let $G_r$ be the graph on the same vertex set as $G$, with two vertices joined by an edge if and only if they are at graph distance at most $r$ apart in…