Related papers: Sandpile model on an optimized scale-free network …

A numerical model is developed for the simulation of debris flow in landslides over a complex three dimensional topography. The model is based on a lattice, in which debris can be transferred among nearest neighbors according to established…

We present empirical evidence that land values are scale-free and introduce a network model that reproduces the observations. The network approach to urban modelling is based on the assumption that the market dynamics that generates land…

Networks have been used to model many real-world phenomena to better understand the phenomena and to guide experiments in order to predict their behavior. Since incorrect models lead to incorrect predictions, it is vital to have a correct…

Directed sandpile models with different toppling rules are studied by means of numerical simulations in two dimensions, with the purpose of determining the different universality classes. It is concluded that the random-threshold directed…

Sequential decision-making is central to sustainable agricultural management and precision agriculture, where resource inputs must be optimized under uncertainty and over time. However, such decisions must often be made with limited…

We study a nonconservative sandpile model in one dimension, in which, if the height at any site exceeds a threshold value, the site topples by transferring one particle along each bond connecting it to its neighbours. Its height is then set…

This paper establishes a relation between scale-free networks and Markov chains, and proposes a computation framework for degree distributions of scale-free networks. We first find that, under the BA model, the degree evolution of…

We numerically study the directed version of the fixed energy sandpile. On a closed square lattice, the dynamical evolution of a fixed density of sand grains is studied. The activity of the system shows a continuous phase transition around…

A growing body of evidence suggests that the structure of mitochondrial networks is poised near criticality, an intermediate regime lying in between order and disorder. Such description fits well with the idea that biological systems, in…

Link prediction is a technique that uses the topological information in a given network to infer the missing links in it. Since past research on link prediction has primarily focused on enhancing performance for given empirical systems,…

We study fully synchronized states in scale-free networks of chaotic logistic maps as a function of both dynamical and topological parameters. Three different network topologies are considered: (i) random scale-free topology, (ii)…

Random networks with complex topology are common in Nature, describing systems as diverse as the world wide web or social and business networks. Recently, it has been demonstrated that most large networks for which topological information…

Complex networks have abundant and extensive applications in real life. Recently, researchers have proposed a number of complex networks, in which some are deterministic and others are random. Compared with deterministic networks, random…

Barab\'asi-Albert's `Scale Free' model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however,…

Weighted scale-free networks with topology-dependent interactions are studied. It is shown that the possible universality classes of critical behaviour, which are known to depend on topology, can also be explored by tuning the form of the…

Recent studies on the complex systems have shown that the synchronization of oscillators including neuronal ones is faster, stronger, and more efficient in the small-world networks than in the regular or the random networks, and many…

We consider critical phenomena on heterogeneous small-world networks having a scale-free character but also arbitrary short-loops. After deriving the self-consistent equation for the order parameter and the critical surface, we prove that…

As the Internet becomes severely overburdened with exponentially growing traffic demand, it becomes a general belief that a new generation data network is in urgent need today. However, standing at this crossroad, we find that we are in a…

We analyze the asymptotic properties of a Euclidean optimization problem on the plane. Specifically, we consider a network with three bins and $n$ objects spatially uniformly distributed, each object being allocated to a bin at a cost…

To explore the relation between network structure and function, we studied the computational performance of Hopfield-type attractor neural nets with regular lattice, random, small-world and scale-free topologies. The random net is the most…