Related papers: Interdependent networks: Reducing the coupling str…
We investigate percolation transitions in a nonlocal network model numerically. In this model, each node has an exclusive partner and a link is forbidden between two nodes whose $r$-neighbors share any exclusive pair. The $r$-neighbor of a…
Consider growing a network, in which every new connection is made between two disconnected nodes. At least one node is chosen randomly from a subset consisting of $g$ fraction of the entire population in the smallest clusters. Here we show…
Clustering network is one of which complex network attracting plenty of scholars to discuss and study the structures and cascading process. We primarily analyzed the effect of clustering coefficient to other various of the single clustering…
The functionality of an entity frequently necessitates the support of a group situated in another layer of the system. To unravel the profound impact of such group support on a system's resilience against cascading failures, we devise a…
The rigidity of elastic networks depends sensitively on their internal connectivity and the nature of the interactions between constituents. Particles interacting via central forces undergo a zero-temperature rigidity-percolation transition…
A common definition of a robust connection between two nodes in a network such as a communication network is that there should be at least two independent paths connecting them, so that the failure of no single node in the network causes…
Recent advances have shown that introducing dependency interactions between two superconducting networks can trigger abrupt, hysteretic normal-superconductor phase transitions. In this study, we demonstrate that such behavior can also arise…
We investigate the growth of connectivity in a network. In our model, starting with a set of disjoint nodes, links are added sequentially. Each link connects two nodes, and the connection rate governing this random process is proportional…
We investigate topologically biased failure in scale-free networks with degree distribution $P(k) \propto k^{-\gamma}$. The probability $p$ that an edge remains intact is assumed to depend on the degree $k$ of adjacent nodes $i$ and $j$…
In many real, directed networks, the strongly connected component of nodes which are mutually reachable is very small. This does not fit with current theory, based on random graphs, according to which strong connectivity depends on mean…
We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a…
A phase diagram for a one dimensional fiber bundle model is constructed with a continuous variation in two parameters guiding dynamics of the model: strength of disorder and system size. We monitor the successive events of fiber rupture in…
Real networks are vulnerable to random failures and malicious attacks. However, when a node is harmed or damaged, it may remain partially functional, which helps to maintain the overall network structure and functionality. In this paper, we…
We consider a general model in which there is a coupled dynamics of node states and links states in a network. This coupled dynamics coevolves with dynamical changes of the topology of the network caused by a link rewiring mechanism. Such…
We study neural connectivity in cultures of rat hippocampal neurons. We measure the neurons' response to an electric stimulation for gradual lower connectivity, and characterize the size of the giant cluster in the network. The connectivity…
Interconnected networks have been shown to be much more vulnerable to random and targeted failures than isolated ones, raising several interesting questions regarding the identification and mitigation of their risk. The paradigm to address…
Since the discovery a half century ago that 1/r^2-type long-range interactions in the one-dimensional Ising model change the phase transition type, long-range interactions in diverse systems have received considerable attention. Recently,…
We analyze the stability of the network's giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network…
The connectivity of individual neurons of large neural networks determine both the steady state activity of the network and its answer to external stimulus. Highly diluted random networks have zero activity. We show that increasing the…
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…