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

We consider the shift transformation on the space of infinite sequences over a finite alphabet endowed with the invariant product measure, and examine the presence of a \emph{hole} on the space. The holes we study are specified by the…

For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge…

A class of graphs is called block-stable when a graph is in the class if and only if each of its blocks is. We show that, as for trees, for most $n$-vertex graphs in such a class, each vertex is in at most $(1+o(1)) \log n / \log\log n$…

The hypersphere model is a simple one-parameter model of the potential energy landscape of viscous liquids, which is defined as a percolating system of same-radius hyperspheres randomly distributed in $\mathbb{R}^{3N}$ in which $N$ is the…

In the open circular billiard particles are placed initially with a uniform distribution in their positions inside a planar circular vesicle. They all have velocities of the same magnitude, whose initial directions are also uniformly…

We analyse the properties of a very simple ``balls-in-boxes'' model which can exhibit a phase transition between a fluid and a condensed phase, similar to behaviour encountered in models of random geometries in one, two and four dimensions.…

A 1-independent bond percolation model on a graph $G$ is a probability distribution on the spanning subgraphs of $G$ in which, for all vertex-disjoint sets of edges $S_1$ and $S_2$, the states of the edges in $S_1$ are independent of the…

We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…

The voter model on $\mathbb{Z}^d$ is a particle system that serves as a rough model for changes of opinions among social agents or, alternatively, competition between biological species occupying space. When $d \geq 3$, the set of…

The hopping motion of lattice gases through potentials without mirror-reflection symmetry is investigated under various bias conditions. The model of 2 particles on a ring with 4 sites is solved explicitly; the resulting current in a…

A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…

Balls-in-bins models describe a random sequential allocation of infinitely many balls into a finite number of bins. In these models a ball is placed into a bin with probability proportional to a given function (feedback function), which…

Random geometric graphs (RGG) can be formalized as hidden-variables models where the hidden variables are the coordinates of the nodes. Here we develop a general approach to extract the typical configurations of a generic hidden-variables…

The infinite-bin model is a one-dimensional particle system on $\mathbb{Z}$ introduced by Foss and Konstantopoulos in relation with last passage percolation on complete directed acyclic graphs. In this model, at each integer time, a…

We study here the random diffusion model. This is a continuum model for a conserved scalar density field $\phi$ driven by diffusive dynamics. The interesting feature of the dynamics is that the {\it bare} diffusion coefficient $D$ is…

A graphon is said to have the $H$-property if a random undirected graph $G_n$ on $n$ nodes sampled from it has a node-wise disjoint cycle cover almost surely as $n\to\infty$. It has been shown in the earlier work that the $H$-property obeys…

Many-body dynamical models in which Boltzmann statistics can be derived directly from the underlying dynamical laws without invoking the fundamental postulates of statistical mechanics are scarce. Interestingly, one such model is found in…

We consider a system of $N$ particles on the real line that evolves through iteration of the following steps: 1) every particle splits into two, 2) each particle jumps according to a prescribed displacement distribution supported on the…

Given a symmetric $n\times n$ matrix $P$ with $0 \le P(u, v)\le 1$, we define a random graph $G_{n, P}$ on $[n]$ by independently including any edge $\{u, v\}$ with probability $P(u, v)$. For $k\ge 1$ let $\mathcal{A}_k$ be the property of…

We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p=c/n scaling for G(n,p)…