Related papers: Scale-freeness under node removal: a finite-size s…
We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent $2<\gamma<3$. Degree heterogeneity increases the presence of triangles in…
What is the underlying mechanism leading to power-law degree distributions of many natural and artificial networks is still at issue. We consider that scale-free networks emerges from self-organizing process, and such a evolving model is…
We investigate how the graph topology influences the robustness to noise in undirected linear consensus networks. We measure the structural robustness by using the smallest possible value of steady state population variance of states under…
In complex scale-free networks, ranking the individual nodes based upon their importance has useful applications, such as the identification of hubs for epidemic control, or bottlenecks for controlling traffic congestion. However, in most…
We have analysed some structural properties of scale-free networks with the same degree distribution. Departing from a degree distribution obtained from the Barab\'asi-Albert (BA) algorithm, networks were generated using four additional…
Scale-free networks are characterized by a degree distribution with power-law behavior and have been shown to arise in many areas, ranging from the World Wide Web to transportation or social networks. Degree distributions of observed…
Nestedness characterizes the linkage pattern of networked systems, indicating the likelihood that a node is linked to the nodes linked to the nodes with larger degrees than it. Networks of mutualistic relationship between distinct groups of…
In recent years, community structure has emerged as a key component of complex network analysis. As more data has been collected, researchers have begun investigating changing community structure across multiple networks. Several methods…
We investigate the evolution rules and degree distribution properties of the Software Heritage dataset, a large-scale growing network linking software source-code versions from open-source communities. The network spans more than 40 years…
It is widely believed that fractality of complex networks origins from hub repulsion behaviors (anticorrelation or disassortativity), which means large degree nodes tend to connect with small degree nodes. This hypothesis was demonstrated…
We study the vulnerability of dominating sets against random and targeted node removals in complex networks. While small, cost-efficient dominating sets play a significant role in controllability and observability of these networks, a fixed…
We extend the previously observed scaling equation connecting the internode distances and nodes' degrees onto the case of weighted networks. We show that the scaling takes a similar form in the empirical data obtained from networks…
The correlations among elements that break in random fuse network fracture are studied, for disorder strong enough to allow for volume damage before final failure. The growth of microfractures is found to be uncorrelated above a…
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…
The scale-fee networks, having connectivity distribution $P(k)\sim k^{-\alpha}$ (where $k$ is the site connectivity), is very resilient to random failures but fragile to intentional attack. The purpose of this paper is to find the network…
Several fundamental properties of real complex networks, such as the small-world effect, the scale-free degree distribution, and recently discovered topological fractal structure, have presented the possibility of a unique growth mechanism…
The pivotal quality of proximity graphs is connectivity, i.e. all nodes in the graph are connected to one another either directly or via intermediate nodes. These types of graphs are robust, i.e., they are able to function well even if they…
We give an intuitive though general explanation of the finite-size effect in scale-free networks in terms of the degree distribution of the starting network. This result clarifies the relevance of the starting network in the final degree…
We analyze the correlation properties of the Erdos-Renyi random graph (RG) and the Barabasi-Albert scale-free network (SF) under the attack and repair strategy with detrended fluctuation analysis (DFA). The maximum degree k_max,…
We study the effect of the connectivity pattern of complex networks on the propagation dynamics of epidemics. The growth time scale of outbreaks is inversely proportional to the network degree fluctuations, signaling that epidemics spread…