Related papers: Scaling of spin avalanches in growing networks
We study a random walk problem on the hierarchical network which is a scale-free network grown deterministically. The random walk problem is mapped onto a dynamical Ising spin chain system in one dimension with a nonlocal spin update rule,…
Systems as diverse as genetic networks or the world wide web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This…
The dynamics of swollen fractal networks (Rouse model) has been studied through computer simulations. The fluctuation-relaxation theorem was used instead of the usual Langevin approach to Brownian dynamics. We measured the equivalent of the…
Our goal is to analyze performance of stable linear dynamical networks subject to external stochastic disturbances. The square of the $\mathcal H_2$-norm of the network is used as a performance measure to quantify the expected steady-state…
We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free networks in an external bias (magnetic field). Previous studies at zero field have shown a remarkable equilibrium…
The spectral densities of the weighted Laplacian, random walk and weighted adjacency matrices associated with a random complex network are studied using the replica method. The link weights are parametrized by a weight exponent $\beta$.…
Scaling phenomena have been intensively studied during the past decade in the context of complex networks. As part of these works, recently novel methods have appeared to measure the dimension of abstract and spatially embedded networks. In…
We consider a quasi two-dimensional network connection growth model that minimizes the wiring cost while maximizing the network connections, but at the same time edge crossings are penalized or forbidden. This model is mapped to a dilute…
We study the breakdown of a random fiber bundle model (RFBM) with $n$-discontinuities in the threshold distribution using the global load sharing scheme. In other words, $n+1$ different classes of fibers identified on the basis of their…
Correlations may affect propagation processes on complex networks. To analyze their effect, it is useful to build ensembles of networks constrained to have a given value of a structural measure, such as the degree-degree correlation $r$,…
After a zero temperature quench, we study the kinetics of the one-dimensional Ising model with long-range interactions between spins at distance $r$ decaying as $r^{-\alpha}$, with $\alpha \le 1$. As shown in our recent study [SciPost Phys…
Using large scale numerical simulations we analyze the statistical properties of fracture in the two dimensional random spring model and compare it with its scalar counterpart: the random fuse model. We first consider the process of crack…
We investigate the searchability of complex systems in terms of their interconnectedness. Associating searchability with the number and size of branch points along the paths between the nodes, we find that scale-free networks are relatively…
We analyze the ferromagnetic Ising model on a scale-free tree; the growing random network model with the linear attachment kernel $A_k=k+\alpha$ introduced by [Krapivsky et al.: Phys. Rev. Lett. {\bf 85} (2000) 4629-4632]. We derive an…
In this paper we study a simple model of a purely excitatory neural network that, by construction, operates at a critical point. This model allows us to consider various markers of criticality and illustrate how they should perform in a…
The dynamics of complex systems in nature often occurs in terms of punctuations, or avalanches, rather than following a smooth, gradual path. A comprehensive theory of avalanche dynamics in models of growth, interface depinning, and…
Many real networks are complex and have power-law vertex degree distribution, short diameter, and high clustering. We analyze the network model based on thresholding of the summed vertex weights, which belongs to the class of networks…
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,…
The area of networks is very interdisciplinary and exhibits many applications in several fields of science. Nevertheless, there are few studies focusing on geographically located $d$-dimensional networks. In this paper, we study scaling…
We propose a simple model that aims at describing, in a stylized manner, how local breakdowns due unbalances or congestion propagate in real dynamical networks. The model converges to a self-organized critical stationary state in which the…