Related papers: Free zero-range processes on networks
The asymmetric simple exclusion process (ASEP) is an important model from statistical physics describing particles that hop randomly from one site to the next along an ordered lattice of sites, but only if the next site is empty. ASEP has…
We study the dynamics of the contact-process, one of the simplest nonequilibrium stochastic processes, taking place on a scale-free network. We consider the network topology as annealed, i.e. all links are rewired at each microscopic time…
The congestion formation on a urban road network is one of the key issue for the development of a sustainable mobility in the future smart cities. In this work we propose a reductionist approach studying the stationary states of a simple…
The joint probability distribution of many degrees of freedom in biological systems, such as firing patterns in neural networks or antibody sequence composition in zebrafish, often follow Zipf's law, where a power law is observed on a…
The paper is concerned with the interplay between network structure and traffic dynamics in a communications network, from the viewpoint of end-to-end performance of packet transfer. We use a model of network generation that allows the…
We consider the totally asymmetric simple exclusion process on a ring with flat and step initial conditions. We assume that the size of the ring and the number of particles tend to infinity proportionally and evaluate the fluctuations of…
Connectivity is one of the most fundamental properties of wireless multi-hop networks. A network is said to be connected if there is a path between any pair of nodes. A convenient way to study the connectivity of a random network is by…
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical…
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…
We introduce a model of epidemics among moving particles on any locally finite graph. At any time, each vertex is empty, occupied by a healthy particle, or occupied by an infected particle. Infected particles recover at rate $1$ and…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…
We study the contact process on a class of geometric random graphs with scale-free degree distribution, defined on a Poisson point process on $\mathbb{R}^d$. This class includes the age-dependent random connection model and the soft Boolean…
Phase transition from a free-flow phase to a jammed phase is an important feature of traffic networks. We study this transition in the case of a simple square lattice network for different values of data posting rate $(\rho)$ by introducing…
Process of stripe formation is analyzed numerically in a binary mixture. The system consists of particles of two sizes, without any direct mutual interactions. Overlapping of large particles, surrounded by a dense system of smaller…
We study expanding circle maps interacting in a heterogeneous random network. Heterogeneity means that some nodes in the network are massively connected, while the remaining nodes are only poorly connected. We provide a probabilistic…
We investigate the dynamics of a gas of non-interacting particle-like soliton waves, demonstrating that phase transitions originate from their collective behavior. This is predicted by solving exactly the nonlinear equations and by…
Condensation occurs in nonequilibrium steady states when a finite fraction of particles in the system occupies a single lattice site. We study condensation transitions in a one-dimensional zero-range process with a single defect site. The…
Proximity networks are time-varying graphs representing the closeness among humans moving in a physical space. Their properties have been extensively studied in the past decade as they critically affect the behavior of spreading phenomena…
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…
The nature of randomness in disordered packings of frictional and frictionless spheres is investigated using theory and simulations of identical spherical grains. The entropy of the packings is defined through the force and volume ensemble…