English
Related papers

Related papers: Eigenvalue Bounds for Symmetric Markov Chains on M…

200 papers

We study products of random isometries acting on Euclidean space. Building on previous work of the second author, we prove a local limit theorem for balls of shrinking radius with exponential speed under the assumption that a Markov…

Probability · Mathematics 2016-06-08 Elon Lindenstrauss , Péter P. Varjú

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…

Combinatorics · Mathematics 2007-05-23 Bernhard Krön , Elmar Teufl

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

Computational Complexity · Computer Science 2016-06-07 Tali Kaufman , David Mass

We consider the problem of approximating and learning disjunctions (or equivalently, conjunctions) on symmetric distributions over $\{0,1\}^n$. Symmetric distributions are distributions whose PDF is invariant under any permutation of the…

Machine Learning · Computer Science 2015-05-27 Vitaly Feldman , Pravesh Kothari

We provide a classification of translation invariant one-dimensional quantum walks with respect to continuous deformations preserving unitarity, locality, translation invariance, a gap condition, and some symmetry of the tenfold way. The…

Quantum Physics · Physics 2018-09-25 C. Cedzich , T. Geib , C. Stahl , L. Velázquez , A. H. Werner , R. F. Werner

A mated-CRT map is a random planar map obtained as a discretized mating of correlated continuum random trees. Mated-CRT maps provide a coarse-grained approximation of many other natural random planar map models (e.g., uniform triangulations…

Probability · Mathematics 2019-05-28 Ewain Gwynne , Jason Miller , Scott Sheffield

We consider walks on the edges of the square lattice $\mathbb Z^2$ which obey \emph{two-step rules,} which allow (or forbid) steps in a given direction to be followed by steps in another direction. We classify these rules according to a…

Combinatorics · Mathematics 2021-12-15 Nicholas R. Beaton

We present a Markov chain (Dikin walk) for sampling from a convex body equipped with a self-concordant barrier, whose mixing time from a "central point" is strongly polynomial in the description of the convex set. The mixing time of this…

Data Structures and Algorithms · Computer Science 2015-11-17 Hariharan Narayanan

We introduce the geodesic walk for sampling Riemannian manifolds and apply it to the problem of generating uniform random points from polytopes in R^n specified by m inequalities. The walk is a discrete-time simulation of a stochastic…

Data Structures and Algorithms · Computer Science 2017-06-02 Yin Tat Lee , Santosh S. Vempala

This PhD thesis is dedicated to the study of the interplay between symmetries of quantum states and their self-similar properties. It consists of three connected threads of research: polynomial invariants for multiphoton states,…

Quantum Physics · Physics 2014-12-23 Piotr Migdał

We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is $\mathrm{SO}(2,1)$ or $\mathrm{SO}(3,1)$ and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense…

Dynamical Systems · Mathematics 2026-05-27 Timothée Bénard , Weikun He

The continuous-time quantum walk is a particle evolving by Schr\"odinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems,…

Quantum Physics · Physics 2021-10-26 Thomas G. Wong , Joshua Lockhart

We establish spectral theorems for random walks on mapping class groups of connected, closed, oriented, hyperbolic surfaces, and on $\text{Out}(F_N)$. In both cases, we relate the asymptotics of the stretching factor of the…

Group Theory · Mathematics 2020-07-20 François Dahmani , Camille Horbez

In this paper, we analyse a sub-class of two-dimensional homogeneous nearest neighbour (simple) random walk restricted on the lattice using the matrix geometric approach. In particular, we first present an alternative approach for the…

Probability · Mathematics 2017-07-21 Stella Kapodistria , Zbigniew Palmowski

Motivated by the Dikin walk, we develop aspects of an interior-point theory for sampling in high dimension. Specifically, we introduce a symmetric parameter and the notion of strong self-concordance. These properties imply that the…

Data Structures and Algorithms · Computer Science 2020-07-13 Aditi Laddha , Yin Tat Lee , Santosh Vempala

We study paths of time-length $t$ of a continuous-time random walk on $\mathbb Z^2$ subject to self-interaction that depends on the geometry of the walk range and a collection of random, uniformly positive and finite edge weights. The…

Probability · Mathematics 2020-01-06 Marek Biskup , Eviatar B. Procaccia

The scaling properties of self-avoiding walks on a d-dimensional diluted lattice at the percolation threshold are analyzed by a field-theoretical renormalization group approach. To this end we reconsider the model of Y. Meir and A. B.…

Soft Condensed Matter · Physics 2009-11-10 C. von Ferber , V. Blavats'ka , R. Folk , Yu. Holovatch

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

Probability · Mathematics 2021-03-18 Arup Bose , Koushik Saha , Arusharka Sen , Priyanka Sen

How many shuffles are needed to mix up a deck of cards? This question may be answered in the language of a random walk on the symmetric group, $S_{52}$. This generalises neatly to the study of random walks on finite groups, themselves a…

Probability · Mathematics 2015-04-22 J. P. McCarthy

We prove that any $\ell$ positive definite $d \times d$ matrices, $M_1,\ldots,M_\ell$, of full rank, can be simultaneously spectrally balanced in the following sense: for any $k < d$ such that $\ell \leq \lfloor \frac{d-1}{k-1} \rfloor$,…

Functional Analysis · Mathematics 2016-06-07 Ronen Eldan , Fedor Nazarov , Yuval Peres