Related papers: No-exclaves percolation on random networks
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant…
We consider cumulative merging percolation (CMP), a long-range percolation process describing the iterative merging of clusters in networks, depending on their mass and mutual distance. For a specific class of CMP processes, which…
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…
We study a generic model of self-assembling chains which can branch and form networks with branching points (junctions) of arbitrary functionality. The physical realizations include physical gels, wormlike micells, dipolar fluids and…
We consider a network, bonds of which are being sequentially removed; that is done at random, but conditioned on the system remaining connected (Self-Repairing Bond Percolation SRBP). This model is the simplest representative of a class of…
The percolation phase transitions of two-dimensional lattice networks under a generalized Achlioptas process (GAP) are investigated. During the GAP, two edges are chosen randomly from the lattice and the edge with minimum product of the two…
In the last two decades, network science has blossomed and influenced various fields, such as statistical physics, computer science, biology and sociology, from the perspective of the heterogeneous interaction patterns of components…
Highly nonconvex granular particles, such as staples and metal shavings, can form solid-like cohesive structures through geometric entanglement (interlocking). The network structure formed by this entanglement, however, remains largely…
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…
Maximum entropy principle (MEP) offers an effective and unbiased approach to inferring unknown probability distributions when faced with incomplete information, while neural networks provide the flexibility to learn complex distributions…
Classical percolation theory underlies many processes of information transfer along the links of a network. In these standard situations, the requirement for two nodes to be able to communicate is the presence of at least one uninterrupted…
As a fundamental structural transition in complex networks, core percolation is related to a wide range of important problems. Yet, previous theoretical studies of core percolation have been focusing on the classical Erd\H{o}s-R\'enyi…
We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…
We study the two-dimensional site-percolation model on a square lattice. In this paradigmatic model, sites are randomly occupied with probability $p$; a second-order phase transition from a non-percolating to a fully percolating phase…
We present an exact solution of percolation in a generalized class of Watts-Strogatz graphs defined on a 1-dimensional underlying lattice. We find a non-classical critical point in the limit of the number of long-range bonds in the system…
Quantum networks are essential to quantum information distributed applications, and communicating over them is a key challenge. Complex networks have rich and intriguing properties, which are as yet unexplored in the quantum setting. Here,…
We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…
The $k$-core percolation is a fundamental structural transition in complex networks. Through the analysis of the size jump behaviors of $k$-core in the evolution process of networks, we confirm that $k$-core percolation is continuous phase…
Traditional random graph models of networks generate networks that are locally tree-like, meaning that all local neighborhoods take the form of trees. In this respect such models are highly unrealistic, most real networks having strongly…
We study site percolation on a sequence of graphs $\{G_n\}_{n\geq1}$ on $n$ vertices where degree of each vertex is in the interval $(np -a_n, np+a_n)$ and the co-degree of every pair of vertices is at most ${n}p^2+ b_n$, where $p \in…