Related papers: Chase-escape with conversion on the complete graph
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…
A lot of research activity has recently taken place around the chase procedure, due to its usefulness in data integration, data exchange, query optimization, peer data exchange and data correspondence, to mention a few. As the chase has…
We consider the representation of a continuous-time quantum walk in a graph $X$ by the matrix $\exp(itA(X))$. We provide necessary and sufficient criteria for distance-regular graphs and, more generally, for graphs in association schemes to…
The interchange process on a finite graph is obtained by placing a particle on each vertex of the graph, then at rate 1, selecting an edge uniformly at random and swapping the two particles at either end of this edge. In this paper we…
We study a system of simple random walks on graphs, known as frog model. This model can be described as follows: There are active and sleeping particles living on some graph G. Each active particle performs a simple random walk with…
Spontaneous switching events in most characterized genetic switches are rare, resulting in extremely stable epigenetic properties. We show how simple arguments lead to theories of the rate of such events much like the absolute rate theory…
We study the time that the simple exclusion process on the complete graph needs to reach equilibrium in terms of total variation distance. For the graph with n vertices and 1<<k<n/2 particles we show that the mixing time is of order…
This paper introduced a pursuit and evasion game to be played on a connected graph. One player moves invisibly around the graph, and the other player must guess his position. At each time step the second player guesses a vertex, winning if…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
This investigation is motivated by a result we proved recently for the random transposition random walk: the distance from the starting point of the walk has a phase transition from a linear regime to a sublinear regime at time $n/2$. Here,…
We study the variable-length ensemble of self-avoiding walks on the complete graph. We obtain the leading order asymptotics of the mean and variance of the walk length, as the number of vertices goes to infinity. Central limit theorems for…
We consider an interacting particle system where equal-sized populations of two types of particles move by random walk steps on a graph, the two types may have different speeds, and meetings of opposite-type particles result in…
We link two phenomena concerning the asymptotical behavior of stochastic processes: (i) abrupt convergence or cut-off phenomenon, and (ii) the escape behavior usually associated to exit from metastability. The former is characterized by…
We present explicit formulas for total crossing events in the multi-species asymmetric exclusion process ($r$-ASEP) with underlying $U_q(\widehat{\mathfrak{sl}}_{r+1})$ symmetry. In the case of the two-species TASEP these can be derived…
In this work we study a natural transition mechanism describing the passage from a quenched (almost sure) regime to an annealed (in average) one, for a symmetric simple random walk on random obstacles on sites having an identical and…
We introduce a generalisation of Sch\"{u}tz and Trimper's elephant random walk to finitely generated groups. We focus on the simplest non-abelian setting, i.e. groups whose Cayley graphs are homogeneous trees of degree $d \ge 3$. We show…
We apply periodic orbit theory to study the asymptotic distribution of escape times from an intermittent map. The dynamical zeta function exhibits a branch point which is associated with an asymptotic power law escape. By an analytic…
We study transport and escape in the Stochastic Web Map (SWM), an area-preserving system with phase-space structure controlled by a symmetry parameter $q$ and nonlinearity $K$. By analyzing the survival probability $P_{\text{S}}(n)$ and…
Dynamical phase transitions are defined through non-analyticities of the survival probability of an out-of-equilibrium time-evolving state at certain critical times. They ensue from zeros of the corresponding survival amplitude. By…
In this paper we are concerned with the contact process with semi-infected state on the complete graph $C_n$ with $n$ vertices. In our model, each vertex is in one of three states that `healthy', `semi-infected' or `wholly-infected'. Only…