Related papers: Cutoff Phenomenon for Random Walks on Kneser Graph…

We establish cutoff for a natural random walk (RW) on the set of perfect matchings (PMs). An $n$-PM is a pairing of $2n$ objects. The $k$-PM RW selects $k$ pairs uniformly at random, disassociates the corresponding $2k$ objects, then…

The cutoff phenomenon describes a sharp transition in the convergence of a Markov chain to equilibrium. In recent work, the authors established cutoff and its location for the stochastic Ising model on the $d$-dimensional torus $(Z/nZ)^d$…

We study analytically the order statistics of a time series generated by the successive positions of a symmetric random walk of n steps with step lengths of finite variance \sigma^2. We show that the statistics of the gap d_{k,n}=M_{k,n}…

We consider the Grover walk on a finite graph composed of two arbitrary simple graphs connected by one edge, referred to as a bridge. The parameter $\epsilon>0$ assigned at the bridge represents the strength of connectivity: if…

The cutoff phenomenon was recently shown to systematically follow from non-negative curvature and the product condition, for all Markov diffusions. The proof crucially relied on a classical \emph{chain rule} satisfied by the carr\'e du…

Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2\pi^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the…

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…

One interesting question is how a graph develops from some constrained random graph process, which is a fundamental mechanism in the formation and evolution of dynamic networks. The problem here is referred to the random $K_k$-removal…

Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…

We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes. We establish cutoff phenomena for…

Consider $G=SL_2(\mathbb{Z})/\{\pm I\}$ acting on the complex upper half plane $H$ by $h_M(z)=\frac{az+b}{cz+d},$ for $M \in G$. Let $D=\{z \in H: |z|\geq 1, |\Re(z)|\leq 1/2\}$. We consider the set $\mathcal{E} \subset G$ with the $9$…

For integers $k\geq 1$ and $n\geq 2k+1$, the Kneser graph $K(n,k)$ is the graph whose vertices are the $k$-element subsets of $\{1,\ldots,n\}$ and whose edges connect pairs of subsets that are disjoint. The Kneser graphs of the form…

Each vertex of an arbitrary simple graph on $n$ vertices chooses $k$ random incident edges. What is the expected number of edges in the original graph that connect different connected components of the sampled subgraph? We prove that the…

Let $(X_t)_{t = 0 }^{\infty}$ be an irreducible reversible discrete time Markov chain on a finite state space $\Omega $. Denote its transition matrix by $P$. To avoid periodicity issues (and thus ensuring convergence to equilibrium) one…

We consider an $n$-tuple of independent ergodic Markov processes, each of which converges (in the sense of separation distance) at an exponential rate, and obtain a necessary and sufficient condition for the $n$-tuple to exhibit a…

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…

We analyse a random walk on the ring of integers mod $n$, which at each time point can make an additive `step' or a multiplicative `jump'. When the probability of making a jump tends to zero as an appropriate power of $n$ we prove the…

We bound the rate of convergence to stationarity for a signed generalization of the Bernoulli-Laplace diffusion model; this signed generalization is a Markov chain on the homogeneous space (Z_2 \wr S_n) / (S_r \times S_{n-r}). Specifically,…

We provide a rearrangement based algorithm for fast detection of subgraphs of $k$ vertices with long escape times for directed or undirected networks. Complementing other notions of densest subgraphs and graph cuts, our method is based on…

Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…