相关论文: Approaching the thermodynamic limit in equilibrate…

It is generally accepted that scale-free networks is prone to epidemic spreading allowing the onset of large epidemics whatever the spreading rate of the infection. In the paper, we show that disease propagation may be suppressed in…

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…

Large real-world networks typically follow a power-law degree distribution. To study such networks, numerous random graph models have been proposed. However, real-world networks are not drawn at random. Therefore, Brach, Cygan, {\L}acki,…

We study ensemble-based graph-theoretical methods aiming to approximate the size of the minimum dominating set (MDS) in scale-free networks. We analyze both analytical upper bounds of dominating sets and numerical realizations for…

We investigate the role of degree correlation among nodes on the stability of complex networks, by studying spectral properties of randomly weighted matrices constructed from directed Erd\"{o}s-R\'enyi and scale-free random graph models. We…

We study the structural constraint of random scale-free networks that determines possible combinations of the degree exponent $\gamma$ and the upper cutoff $k_c$ in the thermodynamic limit. We employ the framework of graphicality…

We introduce a deterministic model for scale-free networks, whose degree distribution follows a power-law with the exponent $\gamma$. At each time step, each vertex generates its offsprings, whose number is proportional to the degree of…

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…

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…

The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the energy consumption under the latency constraint is analyzed for…

Through the distinction between ``real'' and ``virtual'' links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with…

Complex networks are characterized by several topological properties: degree distribution, clustering coefficient, average shortest path length, etc. Using a simple model to generate scale-free networks embedded on geographical space, we…

We propose a general geometric growth model for pseudofractal scale-free web, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks: degree distribution, second moment of degree…

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…

We consider distributed networks, such as peer-to-peer networks, whose structure can be manipulated by adjusting the rules by which vertices enter and leave the network. We focus in particular on degree distributions and show that, with…

We show that not only preferential attachment but also preferential depletion leads to scale-free networks. The resulting degree distribution exponents is typically less than two (5/3) as opposed to the case of the growth models studied…

We study spatial networks constructed by randomly placing nodes on a manifold and joining two nodes with an edge whenever their distance is less than a certain cutoff. We derive the general expression for the connectivity distribution of…

In a recent work [Proc. Natl. Acad. Sci. USA 108, 3838 (2011)], Schneider et al. proposed a new measure for network robustness and investigated optimal networks with respect to this quantity. For networks with a power-law degree…

Recently a distributed algorithm has been proposed for multi-agent networks to solve a system of linear algebraic equations, by assuming each agent only knows part of the system and is able to communicate with nearest neighbors to update…

Many complex systems--from social and communication networks to biological networks and the Internet--are thought to exhibit scale-free structure. However, prevailing explanations rely on the constant addition of new nodes, an assumption…