相关论文: Approaching the thermodynamic limit in equilibrate…
Scaling behavior of scale-free evolving networks arising in communications, citations, collaborations, etc. areas is studied. We derive universal scaling relations describing properties of such networks and indicate limits of 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,…
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…
We evaluate analytically and numerically the size of the frozen core and various scaling laws for critical Boolean networks that have a power-law in- and/or out-degree distribution. To this purpose, we generalize an efficient method that…
Contrary to many recent models of growing networks, we present a model with fixed number of nodes and links, where it is introduced a dynamics favoring the formation of links between nodes with degree of connectivity as different as…
Synchronization problems in complex networks are very often studied by researchers due to its many applications to various fields such as neurobiology, e-commerce and completion of tasks. In particular, Scale Free networks with degree…
A scale-free network is grown in the Euclidean space with a global directional bias. On a vertical plane, nodes are introduced at unit rate at randomly selected points and a node is allowed to be connected only to the subset of nodes which…
Many weighted scale-free networks are known to have a power-law correlation between strength and degree of nodes, which, however, has not been well explicated. We investigate the dynamic behaviors of resource/traffic flow on scale-free…
Critical phenomena on scale-free networks with a degree distribution $p_k \sim k^{-\lambda}$ exhibit rich finite-size effects due to its structural heterogeneity. We systematically study the finite-size scaling of percolation and identify…
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…
We study the traffic-driven epidemic spreading on scale-free networks with tunable degree distribution. The heterogeneity of networks is controlled by the exponent $\gamma$ of power-law degree distribution. It is found that the epidemic…
In this paper we describe the emergence of scale-free degree distributions from statistical mechanics principles. We define an energy associated to a degree sequence as the logarithm of the number of indistinguishable simple networks it is…
We propose and study a model of traffic in communication networks. The underlying network has a structure that is tunable between a scale-free growing network with preferential attachments and a random growing network. To model realistic…
In contrast to the conventional wisdom that scale-free networks are prone to epidemic propagation, in the paper we present that disease spreading is inhibited in fractal scale-free networks. We first propose a novel network model and show…
We describe an ensemble of growing scale-free networks in an equilibrium framework, providing insight into why the exponent of empirical scale-free networks in nature is typically robust. In an analogy to thermostatistics, to describe the…
We consider the self organizing process of merging and regeneration of vertices in complex networks and demonstrate that a scale-free degree distribution emerges in a steady state of such a dynamics. The merging of neighbor vertices in a…
While degree correlations are known to play a crucial role for spreading phenomena in networks, their impact on the propagation speed has hardly been understood. Here we investigate a tunable spreading model on scale-free networks and show…
Many networks are characterized by highly heterogeneous distributions of links, which are called scale-free networks and the degree distributions follow $p(k)\sim ck^{-\alpha}$. We study the robustness of scale-free networks to random…
We investigate the higher-order connectivity of scale-free networks using algebraic topology. We model scale-free networks as preferential attachment graphs, and we study the algebraic-topological properties of their clique complexes. We…
We study the synchronization transition in scale-free networks that display power-law asymptotic behaviors in their degree distributions. The critical coupling strength and the order-parameter critical exponent derived by the mean field…