Related papers: Sandpile model on an optimized scale-free network …
We study a deterministic scale-free network recently proposed by Barab\'{a}si, Ravasz and Vicsek. We find that there are two types of nodes: the hub and rim nodes, which form a bipartite structure of the network. We first derive the exact…
We numerically investigate the scale-free network model of Barab{\'a}si and Albert [A. L. Barab{\'a}si and R. Albert, Science {\bf 286}, 509 (1999)] through the use of various path finding strategies. In real networks, global network…
Abelian sandpile models, both deterministic, such as the Bak, Tang, Wiesenfeld (BTW) model [P. Bak, C. Tang and K. Wiesenfeld, Phys. Rev. Lett. {\bf 59}, 381 (1987)], and stochastic, such as the Manna model [S.S. Manna, J. Phys. A {\bf 24},…
Networks that have power-law connectivity, commonly referred to as the scale-free networks, are an important class of complex networks. A heterogeneous mean-field approximation has been previously proposed for the Ising model of the…
There is a pressing need for a description of complex systems that includes considerations of the underlying network of interactions, for a diverse range of biological, technological and other networks. In this work relationships between…
Real growing networks like the WWW or personal connection based networks are characterized by a high degree of clustering, in addition to the small-world property and the absence of a characteristic scale. Appropriate modifications of the…
Correlation between nodes is found to be a common and important property in many complex networks. Here we investigate degree correlations of the Barabasi-Albert (BA) Scale-Free model with both analytical results and simulations, and find…
Controlling self-organizing systems is challenging because the system responds to the controller. Here we develop a model that captures the essential self-organizing mechanisms of Bak-Tang-Wiesenfeld (BTW) sandpiles on networks, a…
Scale-free networks are quite popular nowadays since many systems are well represented by such structures. In order to study these systems, several models were proposed. However, most of them do not take into account the node-to-node…
We show that deterministic systems with strong nonlinearities seem to be more appropriate to model sandpiles than stochastic systems or deterministic systems in which discontinuities are the only nonlinearity. In particular, we are able to…
The degree distributions of many real world networks follow power-laws whose exponents tend to fall between two and three. Within the framework of the Barabasi-Albert model (BA model), we explain this empirical observation by a simple fact.…
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…
We introduce the sandpile model on multiplex networks with more than one type of edge and investigate its scaling and dynamical behaviors. We find that the introduction of multiplexity does not alter the scaling behavior of avalanche…
Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…
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…
We present a novel type of weighted scale-free network model, in which the weight grows independently of the attachment of new nodes. The evolution of this network is thus determined not only by the preferential attachment of new nodes to…
Network infrastructures are essential for the distribution of resources such as electricity and water. Typical strategies to assess their resilience focus on the impact of a sequence of random or targeted failures of network nodes or links.…
Critical behavior of the contact process is studied in annealed scale-free networks by mapping it on the random walk problem. We obtain the analytic results for the critical scaling, using the event-driven dynamics approach. These results…
A new model about cascading occurrences caused by perturbation is established to search after the mechanism because of which catastrophes in networks occur. We investigate the avalanche dynamics of our model on 2-dimension Euclidean…
Motivated by the hierarchial network model of E. Ravasz, A.-L. Barabasi, and T. Vicsek, we introduce deterministic scale-free networks derived from a graph directed self-similar fractal $\Lambda $. With rigorous mathematical results we…