Related papers: Chase-escape on the configuration model
We introduce an evolving network model in which a new node attaches to a randomly selected target node and also to each of its neighbors with probability $p$. The resulting network is sparse for $p<\frac{1}{2}$ and dense (average degree…
To depict the complex relationship among nodes and the evolving process of a complex system, a Bose-Einstein hypernetwork is proposed in this paper. Based on two basic evolutionary mechanisms, growth and preference jumping, the distribution…
We consider an extension of the zero-range process to the case where the hop rate depends on the state of both departure and arrival sites. We recover the misanthrope and the target process as special cases for which the probability of the…
We combine the processes of resetting and first-passage to define \emph{first-passage resetting}, where the resetting of a random walk to a fixed position is triggered by a first-passage event of the walk itself. In an infinite domain,…
We investigate three different methods for systematically approximating the diffusion coefficient of a deterministic random walk on the line which contains dynamical correlations that change irregularly under parameter variation. Capturing…
We investigate a novel variant of the exclusion process in which particles perform asymmetric nearest-neighbor jumps across a bond \((k, k+1)\) only if the preceding site \((k-1)\) is unoccupied. This next-nearest-neighbor constraint…
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…
We have introduced evolutionary game dynamics to a one-dimensional cellular-automaton to investigate evolution and maintenance of cooperative avoiding behavior of self-driven particles in bidirectional flow. In our model, there are two…
Arrival processes to service systems often display fluctuations that are larger than anticipated under the Poisson assumption, a phenomenon that is referred to as overdispersion. Motivated by this, we analyze a class of discrete stochastic…
We consider the contact process on a dynamic graph defined as a random $d$-regular graph with a stationary edge-switching dynamics. In this graph dynamics, independently of the contact process state, each pair $\{e_1,e_2\}$ of edges of the…
A competition process on $\mathbb{Z}^d$ is considered, where two species compete to color the sites. The entities are driven by branching random walks. Specifically red (blue) particles reproduce in discrete time and place offspring…
Stochastic systems characterised by a random driving in a form of the general stable noise are considered. The particle experiences long rests due to the traps the density of which is position-dependent and obeys a power-law form attributed…
We use an effective Hamiltonian to characterize particle dynamics and find escape rates in a periodically kicked Hamiltonian. We study a model of particles in storage rings that is described by a chaotic symplectic map. Ignoring the…
In this paper, we consider a random walk and a random color scenery on Z. The increments of the walk and the colors of the scenery are assumed to be i.i.d. and to be independent of each other. We are interested in the random process of…
We introduce a new random graph model motivated by biological questions relating to speciation. This random graph is defined as the stationary distribution of a Markov chain on the space of graphs on $\{1, \ldots, n\}$. The dynamics of this…
Near a bifurcation point a system experiences critical slowing down. This leads to scaling behavior of fluctuations. We find that a periodically driven system may display three scaling regimes and scaling crossovers near a saddle-node…
The problem of appropriately matching items subject to compatibility constraints arises in a number of important applications. While most of the literature on matching theory focuses on a static setting with a fixed number of items, several…
We introduce and study a new percolation model, inspired by recent works on jigsaw percolation, graph bootstrap percolation, and percolation in polluted environments. Start with an oriented graph $G_0$ of initially occupied edges on $n$…
We consider chaotic (hyperbolic) dynamical systems which have a generating Markov partition. Then, open dynamical systems are built by making one element of a Markov partition a hole through which orbits escape. We compare various estimates…
The lasing threshold is studied of a multi-mode chaotic cavity (linear size D >> wavelength \lambda) coupled to the outside through a small hole (linear size d << \lambda). For sufficiently weak absorption by the boundaries, the statistical…