Related papers: Weighted scale-free network with self-organizing l…
We review the recent fast progress in statistical physics of evolving networks. Interest has focused mainly on the structural properties of random complex networks in communications, biology, social sciences and economics. A number of giant…
In this paper, we investigate the epidemic spreading for SIR model in weighted scale-free networks with nonlinear infectivity, where the transmission rate in our analytical model is weighted. Concretely, we introduce the infectivity…
Since some realistic networks are influenced not only by increment behavior but also by tunable clustering mechanism with new nodes to be added to networks, it is interesting to characterize the model for those actual networks. In this…
Using a simple model with link removals as well as link additions, we show that an evolving network is scale free with a degree exponent in the range of (2, 4]. We then establish a relation between the network evolution and a set of…
Network topology plays a key role in many phenomena, from the spreading of diseases to that of financial crises. Whenever the whole structure of a network is unknown, one must resort to reconstruction methods that identify the least biased…
A large number of complex networks, both natural and artificial, share the presence of highly heterogeneous, scale-free degree distributions. A few mechanisms for the emergence of such patterns have been suggested, optimization not being…
In this paper we introduce a model of spatial network growth in which nodes are placed at randomly selected locations on a unit square in $\mathbb{R}^2$, forming new connections to old nodes subject to the constraint that edges do not…
Scale-free networks are ubiquitous in social, biological and technological networked systems. Dynamic Scale-free networks and their synchronizations are important to understand and predict the behavior of social, biological and…
Motivated by the empirical analysis of the air transportation system, we define a network model that includes geographical attributes along with topological and weight (traffic) properties. The introduction of geographical attributes is…
In this paper, firstly, we study analytically the topological features of a family of hierarchical lattices (HLs) from the view point of complex networks. We derive some basic properties of HLs controlled by a parameter $q$. Our results…
We derive the sampling properties of random networks based on weights whose pairwise products parameterize independent Bernoulli trials. This enables an understanding of many degree-based network models, in which the structure of realized…
In real networks complex topological features are often associated with a diversity of interactions as measured by the weights of the links. Moreover, spatial constraints may as well play an important role, resulting in a complex interplay…
Tie strength prediction, sometimes named weight prediction, is vital in exploring the diversity of connectivity pattern emerged in networks. Due to the fundamental significance, it has drawn much attention in the field of network analysis…
In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small world effect. While the average shortest path length increases…
The spectrum of network is an important tool to study the function and dynamic properties of network, and graph operation and product is an effective mechanism to construct a specific local and global topological structure. In this study, a…
Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…
The concept of network efficiency, recently proposed to characterize the properties of small-world networks, is here used to study the effects of errors and attacks on scale-free networks. Two different kinds of scale-free networks, i.e.…
We bring rigor to the vibrant activity of detecting power laws in empirical degree distributions in real-world networks. We first provide a rigorous definition of power-law distributions, equivalent to the definition of regularly varying…
Preferential attachment is one possible way to obtain a scale-free network. We develop a self-consistent method to determine whether preferential attachment occurs during the growth of a network, and to extract the preferential attachment…
Motivated by data on the evolution of the Internet and World Wide Web we consider scenarios of self-organization of the nonlinearly growing networks into free-scale structures. We find that the accelerating growth of the networks…