Expanderizing higher-order random walks
From MaRDI portal
Cites work
- A spectral condition for spectral gap: fast mixing in high-temperature Ising models
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Agreement testing theorems on layered set systems
- An almost constant lower bound of the isoperimetric coefficient in the KLS conjecture
- Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Boolean function analysis on high-dimensional expanders
- Concentration inequalities. A nonasymptotic theory of independence
- Derandomization beyond connectivity: undirected Laplacian systems in nearly logarithmic space
- Deterministic approximation of random walks in small space
- Dobrushin Conditions and Systematic Scan
- Eldan's stochastic localization and tubular neighborhoods of complex-analytic sets
- Entropic independence: optimal mixing of down-up random walks
- Entropies, convexity, and functional inequalities: on \(\Phi\)-entropies and \(\Phi\)-Sobolev inequalities
- Entropy decay in the Swendsen–Wang dynamics on ℤd
- Expander graphs and their applications
- Explicit expanders of every degree and size
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Fractionally log-concave and sector-stable polynomials: counting planar matchings and more
- High dimensional expanders imply agreement expanders
- High dimensional expanders: eigenstripping, pseudorandomness, and unique games
- High dimensional random walks and colorful expansion
- High order random walks: beyond spectral gap
- scientific article; zbMATH DE number 1047461 (Why is no real title available?)
- scientific article; zbMATH DE number 1069282 (Why is no real title available?)
- scientific article; zbMATH DE number 7768377 (Why is no real title available?)
- scientific article; zbMATH DE number 7788432 (Why is no real title available?)
- Hypercontractivity on high dimensional expanders
- Hypercontractivity on high dimensional expanders
- Improved analysis of higher order random walks and applications
- Improved bounds for randomly sampling colorings via linear programming
- Improved bounds for sampling colorings
- Local spectral expansion approach to high dimensional expanders. II: Mixing and geometrical overlapping
- Localization schemes: a framework for proving mixing bounds for Markov chains
- Log concavity and concentration of Lipschitz functions on the Boolean hypercube
- Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests
- Logarithmic Sobolev inequalities for finite Markov chains
- Logarithmic Sobolev inequality for some models of random walks
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Mathematical aspects of mixing times in Markov chains.
- On mixing of Markov chains: coupling, spectral independence, and entropy factorization
- Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion
- p-adic curvature and the cohomology of discrete subgroups of p-adic groups
- Prescribing a System of Random Variables by Conditional Distributions
- Rapid Mixing from Spectral Independence beyond the Boolean Domain
- Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction
- Spectral independence in high-dimensional expanders and applications to the hardcore model
- Strong Data Processing Inequalities and <inline-formula> <tex-math notation="LaTeX">$\Phi $ </tex-math> </inline-formula>-Sobolev Inequalities for Discrete Channels
- Systematic scan for sampling colorings
- Taming correlations through entropy-efficient measure decompositions with applications to mean-field approximation
- The Slicing Problem by Bourgain
- Thin shell implies spectral gap up to polylog via a stochastic localization scheme
- Towards derandomising Markov chain Monte Carlo
- Undirected connectivity in log-space
- Universality of spectral independence with applications to fast mixing in spin glasses
This page was built for publication: Expanderizing higher-order random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6873738)
