相关论文: Activity patterns on random scale-free networks: G…

Scale-free networks (SFN) arise from simple growth processes, which can encourage efficient, centralized and fault tolerant communication (1). Recently its been shown that stable network hub structure is governed by a phase transition at…

The dynamics of Boolean networks (the N-K model) with scale-free topology are studied here. The existence of a phase transition governed by the value of the scale-free exponent of the network is shown analytically by analyzing the overlap…

We study the condensation phenomenon in a zero range process on scale-free networks. We show that the stationary state property depends only on the degree distribution of underlying networks. The model displays a stationary state phase…

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.…

Empirical results show that spatial factors such as distance, population density and communication range affect our social activities, also reflected by the development of ties in social networks. This motivates the need for social network…

We propose a novel paradigm for modeling real-world scale-free networks, where the integration of new nodes is driven by the combined attractiveness of degree and betweenness centralities, the competition of which (expressed by a parameter…

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…

Scale-free (SF) network structures observed in many complex systems affect the size of epidemic spreading and the efficiency of communication, statistical properties of the degree-degree correlations are important for studying the average…

The dynamics of neural networks is often characterized by collective behavior and quasi-synchronous events, where a large fraction of neurons fire in short time intervals, separated by uncorrelated firing activity. These global temporal…

We study network growth from a fixed set of initially isolated nodes placed at random on the surface of a sphere. The growth mechanism we use adds edges to the network depending on strictly local gain and cost criteria. Only nodes that are…

A dynamical model of small-world network, with directed links which describe various correlations in social and natural phenomena, is presented. Random responses of every site to the imput message are introduced to simulate real systems.…

We study the statistics and scaling of extreme fluctuations in noisy task-completion landscapes, such as those emerging in synchronized distributed-computing networks, or generic causally-constrained queuing networks, with scale-free…

We propose a geometric growth model for weighted scale-free networks, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks, which are partially determined by the parameters. Analytical…

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…

We study the spreading of a disease on top of structured scale-free networks recently introduced. By means of numerical simulations we analyze the SIS and the SIR models. Our results show that when the connectivity fluctuations of the…

In this paper, a simply rule that generates scale-free networks with very large clustering coefficient and very small average distance is presented. These networks are called {\bf Multistage Random Growing Networks}(MRGN) as the adding…

Although real-world complex systems typically interact through sparse and heterogeneous networks, analytic solutions of their dynamics are limited to models with all-to-all interactions. Here, we solve the dynamics of a broad range of…

Using numerical simulations and scaling theory we study the dynamics of the world-wide Web from the growth rules recently proposed in Ref. [1] with appropriate parameters. We demonstrate that the emergence of power-law behavior of the out-…

A central claim in modern network science is that real-world networks are typically "scale free," meaning that the fraction of nodes with degree $k$ follows a power law, decaying like $k^{-\alpha}$, often with $2 < \alpha < 3$. However,…

We study a simple model in which the growth of a network is determined by the location of one or more random walkers. Depending on walker speed, the model generates a spectrum of structures situated between well-known limiting cases. We…