Related papers: High Order Random Walks: Beyond Spectral Gap
We prove the spectral gap property for random walks on the product of two non-locally isomorphic analytic real or p-adic compact groups with simple Lie algebras, under the necessary condition that the marginals posses a spectral gap.…
It has recently been shown that networks possessing scale-free and fractal properties may exhibit a bifractal nature, in which local structures are described by two different fractal dimensions. In this study, we investigate random walks on…
We investigate the dynamic scaling properties of stochastic particle systems on a non-deterministic scale-free network. It has been known that the dynamic scaling behavior depends on the degree distribution exponent of the underlying…
We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…
Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…
We consider (random) walks in a multidimensional orthant. Using the idea of universality in probability theory, one can associate a unique polyhedral domain to any given walk model. We use this connection to prove two sets of new results.…
We consider the problem of testing small set expansion for general graphs. A graph $G$ is a $(k,\phi)$-expander if every subset of volume at most $k$ has conductance at least $\phi$. Small set expansion has recently received significant…
We study the relationship between the underlying structure of posets and the spectral and combinatorial properties of their higher-order random walks. While fast mixing of random walks on hypergraphs has led to myriad breakthroughs…
The spectral properties of traditional (dyadic) graphs, where an edge connects exactly two vertices, are widely studied in different applications. These spectral properties are closely connected to the structural properties of dyadic…
We present a perturbative approach to disordered systems in one spatial dimension that accesses the full range of phase disorder and clarifies the connection between localization and phase information. We consider a long chain of…
We present a new construction of high dimensional expanders based on covering spaces of simplicial complexes. High dimensional expanders (HDXs) are hypergraph analogues of expander graphs. They have many uses in theoretical computer…
Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…
High dimensional expanders is a vibrant emerging field of study. Nevertheless, the only known construction of bounded degree high dimensional expanders is based on Ramanujan complexes, whereas one dimensional bounded degree expanders are…
Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability, theoretical computer science, network science, and machine…
Consider the long-range percolation model on the integer lattice $\mathbb{Z}^d$ in which all nearest-neighbour edges are present and otherwise $x$ and $y$ are connected with probability $q_{x,y}:=1-\exp(-|x-y|^{-s})$, independently of the…
Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander decompositions generalize this paradigm to better work for problems with lengths, distances…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
The Kac model describes the local evolution of a gas of $N$ particles with three dimensional velocities by a random walk in which the steps correspond to binary collisions that conserve momentum as well as energy. The state space of this…
We extend the pseudorandomness of random walks on expander graphs using the sticky random walk. Building on prior works, it was recently shown that expander random walks can fool all symmetric functions in total variation distance (TVD)…