相关论文: Different thresholds of bond percolation in scale-…

Several studies on real complex networks from different fields as biology, economy, or sociology have shown that the degree of nodes (number of edges connected to each node) follows a scale-free power-law distribution like $P(k)\approx…

Recently the problem of classes of vulnerable vertices (represented by colors) in complex networks has been discussed, where all vertices with the same vulnerability are prone to fail together. Utilizing redundant paths each avoiding one…

Complex networks have been studied extensively due to their relevance to many real systems as diverse as the World-Wide-Web (WWW), the Internet, energy landscapes, biological and social networks…

We investigate the critical phenomena of the degree-ordered percolation (DOP) model on the hierarchical $(u,v)$ flower network. Using the renormalization-group like procedure, we derive the recursion relations for the percolating…

We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…

A general method is proposed for predicting the asymptotic percolation threshold of networks with bottlenecks, in the limit that the sub-net mesh size goes to zero. The validity of this method is tested for bond percolation on filled…

Percolation in a scale-free hierarchical network is solved exactly by renormalization-group theory, in terms of the different probabilities of short-range and long-range bonds. A phase of critical percolation, with algebraic…

Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…

Network growth is currently explained through mechanisms that rely on node prestige measures, such as degree or fitness. In many real networks those who create and connect nodes do not know the prestige values of existing nodes, but only…

The hidden variable formalism (based on the assumption of some intrinsic node parameters) turned out to be a remarkably efficient and powerful approach in describing and analyzing the topology of complex networks. Owing to one of its most…

Complex networks have abundant and extensive applications in real life. Recently, researchers have proposed a number of complex networks, in which some are deterministic and others are random. Compared with deterministic networks, random…

The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability…

Complex networks have been mostly characterized from the point of view of the degree distribution of their nodes and a few other motifs (or modules), with a special attention to triangles and cliques. The most exotic phenomena have been…

We analyze the spreading of viruses in scale-free networks with high clustering and degree correlations, as found in the Internet graph. For the Suscetible-Infected-Susceptible model of epidemics the prevalence undergoes a phase transition…

We address the problem of social network de-anonymization when relationships between people are described by scale-free graphs. In particular, we propose a rigorous, asymptotic mathematical analysis of the network de-anonymization problem…

Despite the recent advances in developing more effective thresholding methods to convert weighted networks to unweighted counterparts, there are still several limitations that need to be addressed. One such limitation is the inability of…

The concept of scale-free networks has been widely applied across natural and physical sciences. Many claims are made about the properties of these networks, even though the concept of scale-free is often vaguely defined. We present tools…

Self-similar networks with scale-free degree distribution have recently attracted much attention, since these apparently incompatible properties were reconciled in a paper by Song et al. by an appropriate box-counting method that enters the…

Very often, when studying topological or dynamical properties of random scale-free networks, it is tacitly assumed that degree-degree correlations are not present. However, simple constraints, such as the absence of multiple edges and…

Clustering and degree correlations are ubiquitous in real-world complex networks. Yet, understanding their role in critical phenomena remains a challenge for theoretical studies. Here, we provide the exact solution of site percolation in a…