Related papers: Power laws in zero-range processes on random netwo…
A free zero-range process (FRZP) is a simple stochastic process describing the dynamics of a gas of particles hopping between neighboring nodes of a network. We discuss three different cases of increasing complexity: (a) FZRP on a rigid…
The steady-state distributions and dynamical behaviour of Zero Range Processes with hopping rates which are non-monotonic functions of the site occupation are studied. We consider two classes of non-monotonic hopping rates. The first…
We review recent progress on the zero-range process, a model of interacting particles which hop between the sites of a lattice with rates that depend on the occupancy of the departure site. We discuss several applications which have…
We study the condensation phenomenon in a zero range process on scale-free networks. We show that the stationary state property depends only on the degree distribution of underlying networks. The model displays a stationary state phase…
We study a zero range process on scale-free networks in order to investigate how network structure influences particle dynamics. The zero range process is defined with the particle jumping rate function $p(n)=n^\delta$. We show analytically…
We study the dynamics of density fluctuations in the steady state of a non-equilibrium system, the Zero-Range Process on a ring lattice. Measuring the time series of the total number of particles in a \emph{segment} of the lattice, we find…
We introduce and solve exactly a class of interacting particle systems in one dimension where particles hop asymmetrically. In its simplest form, namely asymmetric zero range process (AZRP), particles hop on a one dimensional periodic…
A one dimensional exclusion process is introduced where particles hop to a neighbouring vacant site with a rate that depends on the size of the block they belong to. This model is equivalent to a zero range process (ZRP) and shares the same…
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 study the asymmetric zero-range process (ZRP) with L sites and open boundaries, conditioned to carry an atypical current. Using a generalized Doob h-transform we compute explicitly the transition rates of an effective process for which…
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…
Clustering is well-known to play a prominent role in the description and understanding of complex networks, and a large spectrum of tools and ideas have been introduced to this end. In particular, it has been recognized that the abundance…
This paper investigates properties of the class of graphs based on exchangeable point processes. We provide asymptotic expressions for the number of edges, number of nodes and degree distributions, identifying four regimes: (i) a dense…
We evaluate analytically and numerically the size of the frozen core and various scaling laws for critical Boolean networks that have a power-law in- and/or out-degree distribution. To this purpose, we generalize an efficient method that…
In this paper we describe the emergence of scale-free degree distributions from statistical mechanics principles. We define an energy associated to a degree sequence as the logarithm of the number of indistinguishable simple networks it is…
We study a system of hard-core particles sliding downwards on a fluctuating one-dimensional surface which is characterized by a dynamical exponent $z$. In numerical simulations, an initially random particle density is found to coarsen and…
Several studies on real complex networks from different fields as biology, economy, or sociology have shown that the degree of nodes (number of edges connected to each node) follows a scale-free power-law distribution like $P(k)\approx…
The entropy of network ensembles characterizes the amount of information encoded in the network structure, and can be used to quantify network complexity, and the relevance of given structural properties observed in real network datasets…
Zero-range processes, in which particles hop between sites on a lattice, are closely related to equilibrium networks, in which rewiring of links take place. Both systems exhibit a condensation transition for appropriate choices of the…
The origin of scale-free degree distributions in the context of networks is addressed through an analogous non-network model in which the node degree corresponds to the number of balls in a box and the rewiring of links to balls moving…