Related papers: Explosive percolation in graphs
Percolation theory and the associated conductance networks have provided deep insights into the flow and transport properties of a vast number of heterogeneous materials and media. In practically all cases, however, the conductance of the…
We study an explosive percolation model in which a link is randomly added and neighboring nodes sequentially rewire their links to suppress the growth of large clusters. In this manner, the rewiring nodes spread outward starting from the…
We consider a continuum percolation model consisting of two types of nodes, namely legitimate and eavesdropper nodes, distributed according to independent Poisson point processes (PPPs) in $\bbR ^2$ of intensities $\lambda$ and $\lambda_E$…
Multiplex networks describe a large variety of complex systems including infrastructures, transportation networks and biological systems. Most of these networks feature a significant link overlap. It is therefore of particular importance to…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
We study the percolation in coupled networks with both inner-dependency and inter-dependency links, where the inner- and inter-dependency links represent the dependencies between nodes in the same or different networks, respectively. We…
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…
Percolation is a fundamental concept that brought new understanding on the robustness properties of complex systems. Here we consider percolation on weakly interacting networks, that is, network layers coupled together by much less…
By introducing a simple competition mechanism for bond insertion in random graphs, explosive percolation exhibits a sharp phase transition with rich critical phenomena. We investigate high-order connectivity in explosive percolation using…
The secrecy graph is a random geometric graph which is intended to model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the…
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$…
The explosive percolation problem on the complete graph is investigated via extensive numerical simulations. We obtain the cluster-size distribution at the moment when the cluster size heterogeneity becomes maximum. The distribution is…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
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…
In a new type of percolation phase transition, which was observed in a set of non-equilibrium models, each new connection between vertices is chosen from a number of possibilities by an Achlioptas-like algorithm. This causes preferential…
Many processes of spreading and diffusion take place on temporal networks, and their outcomes are influenced by correlations in the times of contact. These correlations have a particularly strong influence on processes where the spreading…
The evolution of the largest component has been studied intensely in a variety of random graph processes, starting in 1960 with the Erd\"os-R\'enyi process. It is well known that this process undergoes a phase transition at n/2 edges when,…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. Assuming that the nodes of the wireless network are distributed as a…
The jigsaw percolation process on graphs was introduced by Brummitt, Chatterjee, Dey, and Sivakoff as a model of collaborative solutions of puzzles in social networks. Percolation in this process may be viewed as the joint connectedness of…
Networks are ubiquitous in diverse real-world systems. Many empirical networks grow as the number of nodes increases with time. Percolation transitions in growing random networks can be of infinite order. However, when the growth of large…