Related papers: Scale-Free Growing Networks and Gravity
This work describes how the formalization of complex network concepts in terms of discrete mathematics, especially mathematical morphology, allows a series of generalizations and important results ranging from new measurements of the…
We propose a synthetical weights' dynamic mechanism for weighted networks which takes into account the influences of strengths of nodes, weights of links and incoming new vertices. Strength/Weight preferential strategies are used in these…
We study a social network consisting of over $10^4$ individuals, with a degree distribution exhibiting two power scaling regimes separated by a critical degree $k_{\rm crit}$, and a power law relation between degree and local clustering. We…
The community structure and motif-modular-network hierarchy are of great importance for understanding the relationship between structures and functions. In this paper, we investigate the distribution of clique-degree, which is an extension…
Delaunay triangulation can be considered as a type of complex networks. For complex networks, the degree distribution is one of the most important inherent characteristics. In this paper, we first consider the two- and three-dimensional…
Scale-free networks play a fundamental role in the study of complex networks and various applied fields due to their ability to model a wide range of real-world systems. A key characteristic of these networks is their degree distribution,…
The mechanisms by which modularity emerges in complex networks are not well understood but recent reports have suggested that modularity may arise from evolutionary selection. We show that finding the modularity of a network is analogous to…
Scale-free networks, in which the distribution of the degrees obeys a power-law, are ubiquitous in the study of complex systems. One basic network property that relates to the structure of the links found is the degree assortativity, which…
Inspired by scientific collaboration networks, especially our empirical analysis of the network of econophysicists, an evolutionary model for weighted networks is proposed. Both degree-driven and weight-driven models are considered.…
We study a recently introduced class of scale-free networks showing a high clustering coefficient and non-trivial connectivity correlations. We find that the connectivity probability distribution strongly depends on the fine details of the…
In this paper we deal with the structural properties of weighted networks. Starting from an empirical analysis of a linguistic network, we analyse the differences between the statistical properties of a real and a shuffled network and we…
Many systems in nature, society and technology can be described as networks, where the vertices are the system's elements and edges between vertices indicate the interactions between the corresponding elements. Edges may be weighted if the…
Link weight is crucial in weighted complex networks. It provides additional dimension for describing and adjusting the properties of networks. The topological role of weight is studied by the effects of random redistribution of link weights…
In this paper we provide numerical evidence of the richer behavior of the connectivity degrees in heterogeneous preferential attachment networks in comparison to their homogeneous counterparts. We analyze the degree distribution in the…
A large computer program is typically divided into many hundreds or even thousands of smaller units, whose logical connections define a network in a natural way. This network reflects the internal structure of the program, and defines the…
The origin of scale-free degree distributions in the context of networks is addressed through an analogous non-network model in which the node degree corresponds to the number of balls in a box and the rewiring of links to balls moving…
A majority of studied models for scale-free networks have degree distributions with exponents greater than $2$. Real networks, however, can demonstrate essentially more heavy-tailed degree distributions. We explore two models of scale-free…
Quantum spin networks overcome the challenges of traditional charge-based electronics by encoding the information into spin degrees of freedom. Although beneficial for transmitting information with minimal losses when compared to their…
A network is formed using the $N$ sites of an one-dimensional lattice in the shape of a ring as nodes and each node with the initial degree $k_{in}=2$. $N$ links are then introduced to this network, each link starts from a distinct node,…
We study partition of networks into basins of attraction based on a steepest ascent search for the node of highest degree. Each node is associated with, or "attracted" to its neighbor of maximal degree, as long as the degree is increasing.…