Related papers: Zero-range processes with rapidly growing rates
We consider a non-conserving zero-range process with hopping rate proportional to the number of particles at each site. Particles are added to the system with a site-dependent creation rate, and vanish with a uniform annihilation rate. On a…
A fast convergence in a fixed-time of solutions of nonlinear dynamical systems, for which special requirements are satisfied on the derivative of a quadratic function calculated along the solutions of the system, is proposed. The conditions…
We consider a class of zero-range processes exhibiting a condensation transition in the stationary state, with a critical single-site distribution decaying faster than a power law. We present the analytical study of the coarsening dynamics…
Consideration is given to the three different analytical methods for the computation of upper bounds for the rate of convergence to the limiting regime of one specific class of (in)homogeneous continuous-time Markov chains. This class is…
We study the condensation phenomenon in a zero range process on weighted scale-free networks in order to show how the weighted transport influences the particle condensation. Instead of the approach of grand canonical ensemble which is…
We consider a model of long-range first-passage percolation on the $d$ dimensional square lattice $Z^d$ in which any two distinct vertices $x, y \in Z^d$ are connected by an edge having exponentially distributed passage time with mean…
An exactly solvable model for the rewiring dynamics of weighted, directed networks is introduced. Simulations indicate that the model exhibits two types of condensation: (i) a phase in which, for each node, a finite fraction of its total…
We study the zero-range process on the complete graph. It is a Markov chain model for a microcanonical ensemble. We prove that the process converges to a fluid limit. The fluid limit rapidly relaxes to the appropriate Gibbs distribution.
We suggest an approach to obtaining general two-sided bounds on the rate of convergence in terms of special "weighted" norms related to total variation. Some important classes of continuous-time Markov chains are considered:…
Discrete supervised learning problems such as classification are often tackled by introducing a continuous surrogate problem akin to regression. Bounding the original error, between estimate and solution, by the surrogate error endows…
We show that the vertex-reinforced jump process on the $d$-dimensional lattice with long-range jumps is transient in any dimension $d$ as long as the initial weights do not decay too fast. The main ingredients in the proof are: an analysis…
Spatial birth-and-death processes with time dependent rates are obtained as solutions to certain stochastic equations. The existence, uniqueness, uniqueness in law and the strong Markov property of unique solutions are proven when the…
We establish necessary and sufficient conditions for the existence of factorizable steady states of the Generalized Zero Range Process. This process allows transitions from a site $i$ to a site $i+q$ involving multiple particles with rates…
We introduce a simple but powerful technique to study processes driven by two or more reinforcement mechanisms in competition. We apply our method to two types of models: to non conservative zero range processes on finite graphs, and to…
We study a zero-range process where the jump rates do not only depend on the local particle configuration, but also on the size of the system. Rigorous results on the equivalence of ensembles are presented, characterizing the occurrence of…
Let $(Z_n)$ be a supercritical branching process in a random environment $\xi$. We study the convergence rates of the martingale $W_n = Z_n/ E[Z_n| \xi]$ to its limit $W$. The following results about the convergence almost sur (a.s.), in…
We consider a symmetric finite-range contact process on $\mathbb{Z}$ with two types of particles (or infections), which propagate according to the same supercritical rate and die (or heal) at rate $1$. Particles of type $1$ can enter any…
We define a growing model of random graphs. Given a sequence of nonnegative integers $\{d_n\}_{n=0}^\infty$ with the property that $d_i\leq i$, we construct a random graph on countably infinitely many vertices $v_0,v_1\ldots$ by the…
The last decade has seen an explosive growth of interest in exploiting developments in machine learning to accelerate lattice QCD calculations. On the sampling side, generative models are a promising approach to mitigating critical slowing…
We introduce a class of (2+1)-dimensional stochastic growth processes, that can be seen as irreversible random dynamics of discrete interfaces. "Irreversible" means that the interface has an average non-zero drift. Interface configurations…