相关论文: No-exclaves percolation on random networks

Percolation theory is an approach to study vulnerability of a system. We develop analytical framework and analyze percolation properties of a network composed of interdependent networks (NetONet). Typically, percolation of a single network…

Interdependent networks are ubiquitous in our society, ranging from infrastructure to economics, and the study of their cascading behaviors using percolation theory has attracted much attention in the recent years. To analyze the…

In this work, we study the percolation transition and large deviation properties of generalized canonical network ensembles. This new type of random networks might have a very rich complex structure, including high heterogeneous degree…

Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such directed scale-free networks with correlated in- and…

The traditional node percolation map of directed networks is reanalyzed in terms of edges. In the percolated phase, edges can mainly organize into five distinct giant connected components, interfaces bridging the communication of nodes in…

\emph{Full-bond percolation} with parameter $p$ is the process in which, given a graph, for every edge independently, we delete the edge with probability $1-p$. Bond percolation is motivated by problems in mathematical physics and it is…

Let $G=G(d)$ be a random graph with a given degree sequence $d$, such as a random $r$-regular graph where $r\ge 3$ is fixed and $n=|G|\to\infty$. We study the percolation phase transition on such graphs $G$, i.e., the emergence as $p$…

Extended-range percolation is a robust percolation process that has relevance for quantum communication problems. In extended-range percolation nodes can be trusted or untrusted. Untrusted facilitator nodes are untrusted nodes that can…

We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…

We study the effects of nonreciprocity and network structure on percolation. To this end, we investigate nonreciprocal random networks - directed networks for which the probability of a link occurring from node i to node j differs from the…

We study the percolation phase transition in hierarchical scale-free nets. Depending on the method of construction, the nets can be fractal or small-world (the diameter grows either algebraically or logarithmically with the net size),…

Complex networks display various types of percolation transitions. We show that the degree distribution and the degree-degree correlation alone are not sufficient to describe diverse percolation critical phenomena. This suggests that a…

We provide arguments for the property of the degree-degree correlations of giant components formed by the percolation process on uncorrelated random networks. Using the generating functions, we derive a general expression for the…

In their recent work Sheinman et al. [Phys. Rev. Lett. 114, 098104 (2015)] introduce a variation of percolation which they call no-enclaves percolation (NEP). The main claims are 1) the salient physics captured in NEP is closer to what…

We investigate bond percolation on the non-planar Hanoi network (HN-NP), which was studied in [Boettcher et al. Phys. Rev. E 80 (2009) 041115]. We calculate the fractal exponent of a subgraph of the HN-NP, which gives a lower bound for the…

We propose a statistical model defined on the three-dimensional diamond network where the splitting of randomly selected nodes leads to a spatially disordered network, with decreasing degree of connectivity. The terminal state, that is…

We study the critical behavior for percolation on inhomogeneous random networks on $n$ vertices, where the weights of the vertices follow a power-law distribution with exponent $\tau \in (2,3)$. Such networks, often referred to as…

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…

Using the finite-size scaling, we have investigated the percolation phase transitions of evolving random networks under a generalized Achlioptas process (GAP). During this GAP, the edge with minimum product of two connecting cluster sizes…

Majority bootstrap percolation on the random graph $G_{n,p}$ is a process of spread of "activation" on a given realisation of the graph with a given number of initially active nodes. At each step those vertices which have more active…