Related papers: Explicit cutoff profiles for colored top-$m$-to-ra…
In this paper, we give a very accurate description of the way the simple exclusion process relaxes to equilibrium. Let $P_t$ denote the semi-group associated the exclusion on the circle with $2N$ sites and $N$ particles. For any initial…
We present here random distributions on $(D+1)$-edge-colored, bipartite graphs with a fixed number of vertices $2p$. These graphs are dual to $D$-dimensional orientable colored complexes. We investigate the behavior of quantities related to…
In this paper, we study the biased random transposition shuffle, a natural generalization of the classical random transposition shuffle studied by Diaconis and Shahshahani. We diagonalize the transition matrix of the shuffle and use these…
A sequence of chains exhibits (total-variation) cutoff (resp., pre-cutoff) if for all $0<\epsilon< 1/2$, the ratio $t_{\mathrm{mix}}^{(n)}(\epsilon)/t_{\mathrm{mix}}^{(n)}(1-\epsilon)$ tends to 1 as $n \to \infty $ (resp., the $\limsup$ of…
The cutoff phenomenon describes a case where a Markov chain exhibits a sharp transition in its convergence to stationarity. In 1996, Diaconis surveyed this phenomenon, and asked how one could recognize its occurrence in families of finite…
We present a new and surprisingly simple analysis of random-shift decompositions -- originally proposed by Miller, Peng, and Xu [SPAA'13]: We show that decompositions for exponentially growing scales $D = 2^0, 2^1, \ldots,…
We consider a random self-affine carpet $F$ based on an $n\times m$ subdivision of rectangles and a probability $0<p<1$. Starting by dividing $[0,1]^2$ into an $n\times m$ grid of rectangles and selecting these independently with…
In this paper, we investigate the properties of a random walk on the alternating group $A_n$ generated by $3$-cycles of the form $(i,n-1,n)$ and $(i,n,n-1)$. We call this the transpose top-$2$ with random shuffle. We find the spectrum of…
The problem of non-iterative one-shot and non-destructive correction of unavoidable mistakes arises in all Artificial Intelligence applications in the real world. Its solution requires robust separation of samples with errors from samples…
In this paper, we investigate the mixing time of the adjacent transposition shuffle for a deck of $N$ cards. We prove that around time $N^2\log N/(2\pi^2)$, the total variation distance to equilibrium of the deck distribution drops abruptly…
In this thesis we introduce a new type of card shuffle called the one-sided transposition shuffle. At each step a card is chosen uniformly from the pack and then transposed with another card chosen uniformly from below it. This defines a…
Recently Wilson [Ann. Appl. Probab. 14 (2004) 274--325] introduced an important new technique for lower bounding the mixing time of a Markov chain. In this paper we extend Wilson's technique to find lower bounds of the correct order for…
We introduce a new type of card shuffle called one-sided transpositions. At each step a card is chosen uniformly from the pack and then transposed with another card chosen uniformly from below it. This defines a random walk on the symmetric…
We develop a geometric framework for anonymous shuffle experiments based on an anchored affine likelihood-ratio law: a mean-zero measure on the regular simplex polytope. Every finite-output d-ary channel corresponds, up to refinements, to a…
We investigate the mixing properties of a model of reversible Markov chains in random environment, which notably contains the simple random walk on the superposition of a deterministic graph and a second graph whose vertex set has been…
Consider a graph $G$ with a coloring of its edge set $E(G)$ from a set $Q = \set{c_1,c_2, \ldots, c_q}$. Let $Q_i$ be the set of all edges colored with $c_i$. Recently, Frieze defined a notion of the perfect matching color profile denoted…
We prove a cutoff for the random walk on random $n$-lifts of finite weighted graphs, even when the random walk on the base graph $\mathcal{G}$ of the lift is not reversible. The mixing time is w.h.p. $t_{mix}=h^{-1}\log n$, where $h$ is a…
We give deterministic distributed $(1+\epsilon)$-approximation algorithms for Minimum Vertex Coloring and Maximum Independent Set on chordal graphs in the LOCAL model. Our coloring algorithm runs in $O(\frac{1}{\epsilon} \log n)$ rounds,…
Random subsampling of edges is a commonly employed technique in graph algorithms, underlying a vast array of modern algorithmic breakthroughs. Unfortunately, using this technique often leads to randomized algorithms with no clear path to…
Diameter, radius and eccentricities are fundamental graph parameters, which are extensively studied in various computational settings. Typically, computing approximate answers can be much more efficient compared with computing exact…