Related papers: Scaling of spin avalanches in growing networks
A damped chain of particles with harmonic nearest-neighbor interactions in a spatially periodic, piecewise harmonic potential (Frenkel-Kontorova model) is studied numerically. One end of the chain is pulled slowly which acts as a weak…
The statistical property of a growing scale-free network is studied based on an earlier model proposed by Krapivsky, Rodgers, and Redner [Phys. Rev. Lett. 86, 5401 (2001)], with the additional constraints of forbidden of self-connection and…
The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics…
Elastic systems, such as magnetic domain walls, density waves, contact lines, and cracks, are all pinned by substrate disorder. When driven, they move via successive jumps called avalanches, with power law distributions of size, duration…
The scale-free (SF) networks that have been studied so far contained quenched disorder generated by random dilution which does not vary with the time. In practice, if a SF network is to represent, for example, the worldwide web, then the…
We report exact predictions for universal scaling exponents and scaling functions associated with the distribution of the maximum collective avalanche propagation velocities $v_m$ in the mean field theory of the interface depinning…
We investigate a non-equilibrium one-dimensional model known as the raise and peel model describing a growing surface which grows locally and has non-local desorption. For specific values of adsorption ($u_a$) and desorption($u_d$) rates…
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…
Susceptibility of scale free Power Law (PL) networks to attacks has been traditionally studied in the context of what may be termed as {\em instantaneous attacks}, where a randomly selected set of nodes and edges are deleted while the…
In this letter, we investigate the detailed epidemic spreading process in scale-free networks with links' weights that denote familiarity between two individuals and find that spreading velocity reaches a peak quickly then decays in a…
In spiking neural networks an action potential could in principle trigger subsequent spikes in the neighbourhood of the initial neuron. A successful spike is that which trigger subsequent spikes giving rise to cascading behaviour within the…
We study partition of networks into basins of attraction based on a steepest ascent search for the node of highest degree. Each node is associated with, or "attracted" to its neighbor of maximal degree, as long as the degree is increasing.…
We study the scaling behavior of the size of minimum dominating set (MDS) in scale-free networks, with respect to network size $N$ and power-law exponent $\gamma$, while keeping the average degree fixed. We study ensembles generated by…
We review limiting models for fracture in bundles of fibers, with statistically distributed thresholds for breakdown of individual fibers. During the breakdown process, avalanches consisting of simultaneous rupture of several fibers occur,…
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particular those mediated by the Internet). We use analytical and…
We present a statistical mechanics approach for the description of complex networks. We first define an energy and an entropy associated to a degree distribution which have a geometrical interpretation. Next we evaluate the distribution…
It is a mainstream idea that scale-free network would be fragile under the selective attacks. Internet is a typical scale-free network in the real world, but it never collapses under the selective attacks of computer viruses and hackers.…
We show how scale-free degree distributions can emerge naturally from growing networks by using random walks for selecting vertices for attachment. This result holds for several variants of the walk algorithm and for a wide range of…
Many systems in Nature exhibit avalanche dynamics with scale-free features. A general scaling theory has been proposed for critical avalanche profiles in crackling noise, predicting the collapse onto a universal avalanche shape, as well as…
With a simple attack and repair evolution model, we investigate the stability and structural changes of the Erdos-Renyi random graphs (RG) and Barabasi-Albert scale-free (SF) networks. We introduce a new quantity, invulnerability I(s), to…