相关论文: Sandpile model on Scale Free Networks with prefere…
Avalanche dynamics is an indispensable feature of complex systems. Here we study the self-organized critical dynamics of avalanches on scale-free networks with degree exponent $\gamma$ through the Bak-Tang-Wiesenfeld (BTW) sandpile model.…
Complex networks in different areas exhibit degree distributions with heavy upper tail. A preferential attachment mechanism in a growth process produces a graph with this feature. We herein investigate a variant of the simple preferential…
We show that not only preferential attachment but also preferential depletion leads to scale-free networks. The resulting degree distribution exponents is typically less than two (5/3) as opposed to the case of the growth models studied…
Using a steady state process of node duplication and deletion we produce networks with 1/k scale-free degree distributions in the limit of vanishing connectance. This occurs even though there is no growth involved and inherent preferential…
It is commonly believed that real networks are scale-free and fraction of nodes $P(k)$ with degree $k$ satisfies the power law $P(k) \propto k^{-\gamma} \text{ for } k > k_{min} > 0$. Preferential attachment is the mechanism that has been…
A dissipative stochastic sandpile model is constructed and studied on small world networks in one and two dimensions with different shortcut densities $\phi$, where $\phi=0$ represents regular lattice and $\phi=1$ represents random network.…
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…
We investigate a growing network model that combines preferential and uniform attachment with two distinct mechanisms of edge deletion. In addition to the usual uniform probability edge deletion, we introduce a novel node-based rule in…
We investigate sandpile models where the updating of unstable columns is done according to a stochastic rule. We examine the effect of introducing nonlocal relaxation mechanisms. We find that the models self-organize into critical states…
We study the critical properties of the Bak-Sneppen coevolution model on scale-free networks by Monte Carlo method. We report the distribution of the avalanche size and fractal activity through the branching process. We observe that the…
We investigate the avalanche dynamics of the Bak-Tang-Wiesenfeld (BTW) sandpile model on scale-free (SF) networks, where threshold height of each node is distributed heterogeneously, given as its own degree. We find that the avalanche size…
A dissipative stochastic sandpile model is constructed on one and two dimensional small-world networks with different shortcut densities $\phi$ where $\phi=0$ and $1$ represent a regular lattice and a random network respectively. In the…
A dissipative sandpile model (DSM) is constructed and studied on small world networks (SWN). SWNs are generated adding extra links between two arbitrary sites of a two dimensional square lattice with different shortcut densities $\phi$.…
We examine probability distribution for avalanche sizes observed in self-organized critical systems. While a power-law distribution with a cutoff because of finite system size is typical behavior, a systematic investigation reveals that it…
Rotational constraint representing a local external bias generally has non-trivial effect on the critical behavior of lattice statistical models in equilibrium critical phenomena. In order to study the effect of rotational bias in a out of…
Many real-world scale-free networks, such as neural networks and online communication networks, consist of a fixed number of nodes but exhibit dynamic edge fluctuations. However, traditional models frequently overlook scenarios where the…
We propose and study a model of scale-free growing networks that gives a degree distribution dominated by a power-law behavior with a model-dependent, hence tunable, exponent. The model represents a hybrid of the growing networks based on…
In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that…
Deterministic sandpile models are studied on a cost optimized Barab\'asi-Albert (BA) scale-free network whose nodes are the sites of a square lattice. For the optimized BA network, the sandpile model has the same critical behaviour as the…
We introduce a sandpile model where, at each unstable site, all grains are transferred randomly to downstream neighbors. The model is local and conservative, but not Abelian. This does not appear to change the universality class for the…