Related papers: Infinite cycles in the interchange process in five…
Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$.…
We consider homological edge percolation on a sequence $(\mathcal{G}_t)_t$ of finite graphs covered by an infinite (quasi)transitive graph $\mathcal{H}$, and weakly convergent to $\mathcal{H}$. Namely, we use the covering maps to classify…
We consider systems of spatial random permutations, where permutations are weighed according to the point locations. Infinite cycles are present at high densities. The critical density is given by an exact expression. We discuss the…
Quantum walks, the quantum counterpart of classical random walks, are extensively studied for their applications in mathematics, quantum physics, and quantum information science. This study explores the periods and absolute zeta functions…
Infinitely many particles of two types ("plus" and "minus") jump randomly along the one-dimensional lattice $\mathbf{Z}_{\varepsilon}=\varepsilon\mathbf{Z}$. Annihillations occur when two particles of different time occupy the same site.…
In this paper we consider a class of one-dimensional interacting particle systems in equilibrium, constituting a dynamic random environment, together with a nearest-neighbor random walk that on occupied/vacant sites has a local drift to the…
We offer a unified approach to the theory of concave majorants of random walks by providing a path transformation for a walk of finite length that leaves the law of the walk unchanged whilst providing complete information about the concave…
We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical…
Consider a model of $N$ independent, increasing $\mathbb{N}_0$-valued processes, with random, independent waiting times between jumps. It is known that there is either an emergent `leader', in which a single process possesses the maximal…
We study a model of multi-excited random walk on a regular tree which generalizes the models of the once excited random walk and the digging random walk introduced by Volkov (2003). We show the existence of a phase transition of the…
In this paper we prove that every sufficiently large 4-edge-connected graph contains the double cycle, $C_{2,r}$, as an immersion. In proving this, we develop a new tool we call a ring-decomposition. We also prove that linear…
We consider random walks on $\Z^8$ indexed by the infinite invariant tree, which consists of an infinite spine and finite random trees attached to it on both sides. We establish the precise order of the non-intersection probability between…
Consider a large system of $N$ Brownian motions in $\mathbb{R}^d$ on some fixed time interval $[0,\beta]$ with symmetrised initial-terminal condition. That is, for any $i$, the terminal location of the $i$-th motion is affixed to the…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…
We consider two continuous-time generalizations of conservative random walks introduced in [J.Englander and S.Volkov (2022)], an orthogonal and a spherically-symmetrical one; the latter model is known as {\em random flights}. For both…
The graph of overlapping permutations is a directed graph that is an analogue to the De Bruijn graph. It consists of vertices that are permutations of length $n$ and edges that are permutations of length $n+1$ in which an edge $a_1\cdots…
We consider biased random walks in a one-dimensional percolation model. This model goes back to Axelson-Fisk and H\"aggstr\"om and exhibits the same phase transition as biased random walk on the infinite cluster of supercritical Bernoulli…
We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…
If a system is at thermodynamic equilibrium, an observer cannot tell whether a film of it is being played forward or in reverse: any transition will occur with the same frequency in the forward as in the reverse direction. However, if…