Related papers: The golf model on $\mathbb{Z}/n\mathbb{Z}$ and on …

A geometric graph is a drawing of a graph in the plane where the vertices are drawn as points in general position and the edges as straight-line segments connecting their endpoints. It is plane if it contains no crossing edges. We study…

Let $G$ be an edge-colored graph, a walk in $G$ is said to be a properly colored walk iff each pair of consecutive edges have different colors, including the first and the last edges in case that the walk be closed. Let $H$ be a graph…

We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…

We consider an interacting particle system on the one dimensional lattice $\bf Z$ modeling combustion. The process depends on two integer parameters $2\le a<M<\infty$. Particles move independently as continuous time simple symmetric random…

In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain…

We enumerate a class of fully parked trees. In a probabilistic context, this means computing the partition function $F(x,y)$ of the parking process where an i.i.d. number of cars arrives at each vertex of a Galton-Watson tree with a…

A traffic model on an open one-dimensional lattice is considered. At any discrete time moment, with prescribed probability, a particle arrives to the leftmost cell of the lattice, and, with prescribed probability, the arriving particle…

An influential theorem of Nikiforov states that if an $N$-vertex graph $G$ contains at least $\gamma N^h$ copies of some fixed $h$-vertex graph $H$, then $G$ contains an $H$-blowup of order $c_H(\gamma)\log N$. We provide a new proof of…

A particle driven by deterministic chaos and moving in a spatially extended environment can exhibit normal diffusion, with its mean square displacement growing proportional to the time. Here we consider the dependence of the diffusion…

We are concerned with random walks on $\mathbb{Z}^d$, $d\geq 3$, in an i.i.d. random environment with transition probabilities $\epsilon$-close to those of simple random walk. We assume that the environment is balanced in one fixed…

We study memory based random walk models to understand diffusive motion in crowded heterogeneous environment. The models considered are non-Markovian as the current move of the random walk models is determined by randomly selecting a move…

We study a particle system with hopping (random walk) dynamics on the integer lattice $\mathbb Z^d$. The particles can exist in two states, active or inactive (sleeping); only the former can hop. The dynamics conserves the number of…

H${\acute{e}}$non [8] used an inclined billiard to investigate aspects of chaotic scattering which occur in satellite encounters and in other situations. His model consisted of a piecewise mapping which described the motion of a point…

Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…

Given a fixed graph $H$ and an $n$-vertex graph $G$, the $H$-bootstrap percolation process on $G$ is defined to be the sequence of graphs $G_i$, $i\geq 0$ which starts with $G_0:=G$ and in which $G_{i+1}$ is obtained from $G_i$ by adding…

The mixer chain on a graph G is the following Markov chain. Place tiles on the vertices of G, each tile labeled by its corresponding vertex. A "mixer" moves randomly on the graph, at each step either moving to a randomly chosen neighbor, or…

A highly polydisperse granular gas is modeled by a continuous distribution of particle sizes, a, giving rise to a corresponding continuous temperature profile, T(a), which we compute approximately, generalizing previous results for binary…

We show, both heuristically and numerically, that three-dimensional periodic Lorentz gases -- clouds of particles scattering off crystalline arrays of hard spheres -- often exhibit normal diffusion, even when there are gaps through which…

We consider transport properties for a non-homogeneous persistent random walk, that may be viewed as a mean-field version of the L\'evy-Lorentz gas, namely a 1-d model characterized by a fat polynomial tail of the distribution of…

We introduce a class of random graph processes, which we call flip processes. Each such process is given by a rule which is a function $\mathcal{R}:\mathcal{H}_k\rightarrow \mathcal{H}_k$ from all labeled $k$-vertex graphs into itself ($k$…