相关论文: A signature of power law network dynamics

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 examine the heterogeneous responses of individual nodes in sparse networks to the random removal of a fraction of edges. Using the message-passing formulation of percolation, we discover considerable variation across the network in the…

Many recent large-scale studies of interaction networks have focused on networks of accumulated contacts. In this paper we explore social networks of ongoing relationships with an emphasis on dynamical aspects. We find a distribution of…

We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…

There has been a long history of research into the structure and evolution of mankind's scientific endeavor. However, recent progress in applying the tools of science to understand science itself has been unprecedented because only recently…

Scale-free (SF) networks and small world networks have been found to occur in very diverse contexts. It is this striking universality which makes one look for widely applicable mechanisms which lead to the formation of such networks. In…

Individual nodes in evolving real-world networks typically experience growth and decay --- that is, the popularity and influence of individuals peaks and then fades. In this paper, we study this phenomenon via an intrinsic nodal fitness…

We study diffusion of information packets on several classes of structured networks. Packets diffuse from a randomly chosen node to a specified destination in the network. As local transport rules we consider random diffusion and an…

We consider a stochastic model for directed scale-free networks following power-laws in the degree distributions in both incoming and outgoing directions. In our model, the number of vertices grow geometrically with time with growth rate p.…

Biomolecular networks have already found great utility in characterizing complex biological systems arising from pair-wise interactions amongst biomolecules. Here, we review how graph theoretical approaches can be applied not only for a…

The linear preferential attachment hypothesis has been shown to be quite successful to explain the existence of networks with power-law degree distributions. It is then quite important to determine if this mechanism is the consequence of a…

We investigate several geometric models of network which simultaneously have some nice global properties, that the small diameter property, the small-community phenomenon, which is defined to capture the common experience that (almost)…

We generalize the poissonian evolving random graph model of Bauer and Bernard to deal with arbitrary degree distributions. The motivation comes from biological networks, which are well-known to exhibit non poissonian degree distribution. A…

Performing signal processing over graphs requires knowledge of the underlying fixed topology. However, graphs often grow in size with new nodes appearing over time, whose connectivity is typically unknown; hence, making more challenging the…

We study living neural networks by measuring the neurons' response to a global electrical stimulation. Neural connectivity is lowered by reducing the synaptic strength, chemically blocking neurotransmitter receptors. We use a…

The recently proposed DeGroot-Friedkin model describes the dynamical evolution of individual social power in a social network that holds opinion discussions on a sequence of different issues. This paper revisits that model, and uses…

We study a generic family of nonlinear dynamics on undirected networks generalising linear consensus. We find a compact expression for its equilibrium points in terms of the topology of the network and classify their stability using the…

We analyze about two hundred naturally occurring networks with distinct dynamical origins to formally test whether the commonly assumed hypothesis of an underlying scale-free structure is generally viable. This has recently been questioned…

The structure of many real networks is not locally tree-like and hence, network analysis fails to characterise their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, and S. Dobson, Percolation in…

We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power law distribution of degree, linear preferential attachment of new links and a negative…