Related papers: On random walks on the mapping class group
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…
Recent progress on the understanding of the Random Conductance Model is reviewed. A particular emphasis is on homogenization results such as functional central limit theorems, local limit theorems and heat kernel estimates for almost every…
An efficient algorithm is developed to construct disconnectivity graphs by a random walk over basins of attraction. This algorithm can detect a large number of local minima, find energy barriers between them, and estimate local thermal…
Branched n-coverings of Riemann surfaces are described by a 2d lattice gauge theory of the symmetric group S(n) defined on a cell discretization of the surface. We study the theory in the large-n limit, and we find a rich phase diagram with…
We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…
Given a simple transient random walk $(S_n)_{n\geq 0}$ in $\mathbf{Z}$ and a stationary sequence of real random variables $(\xi(s))_{s\in \mathbf{Z}}$, we investigate the extremes of the sequence $(\xi(S_n))_{n\geq 0}$. Under suitable…
Random walk methods are used to calculate the moments of negative image equilibrium distributions in synaptic weight dynamics governed by spike-timing dependent plasticity (STDP). The neural architecture of the model is based on the…
Let $S$ be a hyperbolic oriented Riemann surface of finite type. The main purpose of this paper is to show that non-trivial geometric intersection between closed curves on $S$ is detected by some symplectic submodules they naturally…
In this paper, we introduce random walks with absorbing states on simplicial complexes. Given a simplicial complex of dimension $d$, a random walk with an absorbing state is defined which relates to the spectrum of the $k$-dimensional…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups $S_n$ and $A_n$. We consider the following models: random transposition, transpose top with…
Let $\mu$ be a borelian probability measure on $\mathbf{G}:=\mathrm{SL}_d(\mathbb{Z}) \ltimes \mathbb{T}^d$. Define, for $x\in \mathbb{T}^d$, a random walk starting at $x$ denoting for $n\in \mathbb{N}$, \[ \left\{\begin{array}{rcl} X_0…
We study the Poisson-Furstenberg boundary of random walks on permutational wreath products. We give a sufficient condition for a group to admit a symmetric measure of finite first moment with non-trivial boundary, and show that this…
A major topic of (classical) ergodic theory is to examine qualitatively how the phase space of dynamical systems is penetrated by the orbits of their dynamics. We consider interacting qubit systems with dynamics according to 4-local…
We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…
We introduce a general model of trapping for random walks on graphs. We give the possible scaling limits of these Randomly Trapped Random Walks on $\mathbb {Z}$. These scaling limits include the well-known fractional kinetics process, the…
We consider the operator associated to a random walk on finite volume surfaces with hyperbolic cusps. We study the spectral gap (upper and lower bound) associated to this operator and deduce some rate of convergence of the iterated kernel…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We consider a variant of random walks on finite groups. At each step, we choose an element from a set of generators ("directions") uniformly, and an integer from a power law ("speed") distribution associated with the chosen direction. We…
We define a random walk on the set of primitive points of $\mathbb{Z}^d$. We prove that for walks generated by measures satisfying mild conditions these walks are recurrent in a strong sense. That is, we show that the associated Markov…