Related papers: Intersection conductance and canonical alternating…

We generalise the coarse Ricci curvature method of Ollivier by considering the coarse Ricci curvature of multiple steps in the Markov chain. This implies new spectral bounds and concentration inequalities. We also extend this approach to…

All finite Jacobson graphs with a Hamiltonian cycle or path, or Eulerian tour or trail are determined, and it is shown that a finite Jacobson graph is Hamiltonian if and only if it is pancyclic. Also, the length of the longest induced…

The continuous-time random walk is defined as a Poissonization of discrete-time random walk. We study the noncolliding system of continuous-time simple and symmetric random walks on ${\mathbb{Z}}$. We show that the system is determinantal…

We consider a class of skew product maps of interval diffeomorphisms over the doubling map. The interval maps fix the end points of the interval. It is assumed that the system has zero fiber Lyapunov exponent at one endpoint and zero or…

We provide new upper bounds for mixing times of general finite Markov chains. We use these bounds to show that the total variation mixing time is robust under rough isometry for bounded degree graphs that are roughly isometric to trees.

The problem of sampling from the stationary distribution of a Markov chain finds widespread applications in a variety of fields. The time required for a Markov chain to converge to its stationary distribution is known as the classical…

We consider discrete-time Markov bridges, chains whose initial and final states coincide. We derive exact finite-time formulae for the joint probability distributions of additive functionals of trajectories. We apply our theory to…

The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…

Synchronization transitions are investigated in coupled chaotic maps. Depending on the relative weight of linear versus nonlinear instability mechanisms associated to the single map two different scenarios for the transition may occur. When…

The asymptotic variance is an important criterion to evaluate the performance of Markov chains, especially for the central limit theorems. We give the variational formulas for the asymptotic variance of discrete-time (non-reversible) Markov…

We propose a procedure to generate dynamical networks with bursty, possibly repetitive and correlated temporal behaviors. Regarding any weighted directed graph as being composed of the accumulation of paths between its nodes, our…

In this survey paper, we describe and characterize an extension to the classical path coupling method applied statistical mechanical models, referred to as aggregate path coupling. In conjunction with large deviations estimates, we use this…

Depending on initial conditions, individual finite time trajectories of dynamical systems can have very different chaotic properties. Here we present a numerical method to identify trajectories with atypical chaoticity, pathways that are…

Contrary to the theory of Markov processes, no general theory exists for the so called nonlinear Markov processes. We study an example of "nonlinear Markov process" related to classical probability theory, merely to random walks. This model…

We propose a family of lagged random walk sampling methods in simple undirected graphs, where transition to the next state (i.e. node) depends on both the current and previous states -- hence, lagged. The existing random walk sampling…

We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…

We study a synchronization mechanism, based on one-way coupling of all-or-nothing type, applied to coupled map lattices with several different local rules. By analyzing the metric and the topological distance between the two systems, we…

We settle an open problem, raised by Y. Peres and D. Revelle, concerning the $L^2$ mixing time of the random walk on the lamplighter graph. We also provide general bounds relating the entropy decay of a Markov chain to the separation…

On a transient weighted graph, there are two models of random walk which continue after reaching infinity: random interlacements, and random walk reflected off of infinity, recently introduced in arXiv:2506.18827 [math.PR]. We prove these…

This paper is the second in a series of studies on developing efficient artificial intelligence-based approaches to pathfinding on extremely large graphs (e.g. $10^{70}$ nodes) with a focus on Cayley graphs and mathematical applications.…