Related papers: Generating multi-scaling networks with different t…

The past two decades have seen significant successes in our understanding of complex networked systems, from the mapping of real-world social, biological and technological networks to the establishment of generative models recovering their…

One explanation for the impressive recent boom in network theory might be that it provides a promising tool for an understanding of complex systems. Network theory is mainly focusing on discrete large-scale topological structures rather…

Based on a rigorous extension of classical statistical mechanics to networks, we study a specific microscopic network Hamiltonian. The form of this Hamiltonian is derived from the assumption that individual nodes increase/decrease their…

Complex networks as the World Wide Web, the web of human sexual contacts or criminal networks often do not have an engineered architecture but instead are self-organized by the actions of a large number of individuals. From these local…

We propose a simple dynamical model that generates networks with power-law degree distributions with the exponent 2 through rewiring only. At each time step, two nodes, i and j, are randomly selected, and one incoming link to i is…

Using each node's degree as a proxy for its importance, the topological hierarchy of a complex network is introduced and quantified. We propose a simple dynamical process used to construct networks which are either maximally or minimally…

Community structures have been identified in various complex real-world networks, for example, communication, information, internet and shareholder networks. The scaling of community size distribution indicates the heterogeneity in the…

A wealth of evidence shows that real world networks are endowed with the small-world property i.e., that the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. In addition, most…

Complex networks have gained more attention from the last few years. The size of real-world complex networks, such as online social networks, WWW network, collaboration networks, is increasing exponentially with time. It is not feasible to…

In a recent Letter [F.C. Santos and J. M. Pacheco Phys. Rev. Lett. \textbf{95}, 098104 (2005)], the scale-free networks are found to be advantageous for the emergence of cooperation. In the present work an evolutionary prisoner's dilemma…

Activity or spin patterns on random scale-free network are studied by mean field analysis and computer simulations. These activity patterns evolve in time according to local majority-rule dynamics which is implemented using (i) parallel or…

Latent space models are frequently used for modeling single-layer networks and include many popular special cases, such as the stochastic block model and the random dot product graph. However, they are not well-developed for more complex…

Many complex systems, such as communication networks, display a surprising degree of robustness: while key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability of the network.…

Motivated by the hierarchial network model of E. Ravasz, A.-L. Barabasi, and T. Vicsek, we introduce deterministic scale-free networks derived from a graph directed self-similar fractal $\Lambda $. With rigorous mathematical results we…

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…

How does the shape of a network change as its size increases? Although random graph models provide some expectations for such "scaling behaviors" in the structure of networks, relatively little is known about how empirical network structure…

Real-world networks such as the Internet and WWW have many common traits. Until now, hundreds of models were proposed to characterize these traits for understanding the networks. Because different models used very different mechanisms, it…

Probabilistic message-passing algorithms are developed for routing transmissions in multi-wavelength optical communication networks, under node and edge-disjoint routing constraints and for various objective functions. Global routing…

We describe a new method for the random sampling of connected networks with a specified degree sequence. We consider both the case of simple graphs and that of loopless multigraphs. The constraints of fixed degrees and of connectedness are…

Real-world networks typically exhibit several aspects, or layers, of interactions among their nodes. By permuting the role of the nodes and the layers, we establish a new criterion to construct the dual of a network. This approach allows to…