Related papers: Degree correlations in directed scale-free network…
The degree distributions of many real world networks follow power-laws whose exponents tend to fall between two and three. Within the framework of the Barabasi-Albert model (BA model), we explain this empirical observation by a simple fact.…
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…
Introduced recently, the concept of hierarchical degree allows a more complete characterization of the topological context of a node in a complex network than the traditional node degree. This article presents analytical characterization…
We prove that the presence of a diagonal assortative degree correlation, even if small, has the effect of dramatically lowering the epidemic threshold of large scale-free networks. The correlation matrix considered is…
We study the synchronization transition in scale-free networks that display power-law asymptotic behaviors in their degree distributions. The critical coupling strength and the order-parameter critical exponent derived by the mean field…
A number of problems in communication systems demand the distributed allocation of network resources in order to provide better services, sampling and distribution methods. The solution to these issues is becoming more challenging due to…
We introduce a network evolution process motivated by the network of citations in the scientific literature. In each iteration of the process a node is born and directed links are created from the new node to a set of target nodes already…
Degree correlation is a crucial measure in networks, significantly impacting network topology and dynamical behavior. The degree sequence of a network is a significant characteristic, and altering network degree correlation through…
We propose a growing network model that consists of two tunable mechanisms: growth by merging modules which are represented as complete graphs and a fitness-driven preferential attachment. Our model exhibits the three prominent statistical…
Network science have constantly been in the focus of research for the last decade, with considerable advances in the controllability of their structural. However, much less effort has been devoted to study that how to improve the…
It has been claimed that protein-protein interaction (PPI) networks are scale-free based on the observation that the node degree sequence follows a power law. Here we argue that these claims are likely to be based on erroneous statistical…
Networks with a scale-free degree distribution are widely thought to promote cooperation in various games. Herein, by studying the well-known prisoner's dilemma game, we demonstrate that this need not necessarily be true. For the very same…
It is often claimed that the entropy of a network's degree distribution is a proxy for its robustness. Here, we clarify the link between degree distribution entropy and giant component robustness to node removal by showing that the former…
We evaluate analytically and numerically the size of the frozen core and various scaling laws for critical Boolean networks that have a power-law in- and/or out-degree distribution. To this purpose, we generalize an efficient method that…
Nowadays there is a multitude of measures designed to capture different aspects of network structure. To be able to say if the structure of certain network is expected or not, one needs a reference model (null model). One frequently used…
We performed a large-scale crawl of the World Wide Web, covering 6.9 Million domains and 57 Million subdomains, including all high-traffic sites of the Internet. We present a study of the correlations found between quantities measuring the…
This article addresses the degree distribution of subnetworks, namely the number of links between the nodes in each subnetwork and the remainder of the structure (cond-mat/0408076). The transformation from a subnetwork-partitioned model to…
Reciprocal arcs represent the lowest order cycle possible to find in directed graphs without self-loops. Representing also a measure of feed-back between vertices, it is interesting to understand how reciprocal arcs influence other…
For any initial correlated network after any kind of attack where either nodes or edges are removed, we obtain general expressions for the degree-degree probability matrix and degree distribution. We show that the proposed analytical…
Perturbations made to networked systems may result in partial structural loss, such as a blackout in a power-grid system. Investigating the resultant disturbance in network properties is quintessential to understand real networks in action.…