Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs
From MaRDI portal
Publication:6085090
DOI10.1007/s00440-022-01172-7zbMath1528.05060arXiv2007.02729OpenAlexW3038793862MaRDI QIDQ6085090
Pierre Youssef, Konstantin Tikhomirov
Publication date: 2 December 2023
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.02729
Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Inequalities involving derivatives and differential and integral operators (26D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adjacency matrices of random digraphs: singularity and anti-concentration
- On the singularity of adjacency matrices for random regular digraphs
- A sequential algorithm for generating random graphs
- A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs
- The rank of random regular digraphs of constant degree
- Modified logarithmic Sobolev inequalities in discrete settings
- Fast uniform generation of regular graphs
- Markov chain comparison
- Approximate counting, uniform generation and rapidly mixing Markov chains
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The asymptotic number of labeled graphs with given degree sequences
- Logarithmic Sobolev inequality for some models of random walks
- Comparison theorems for reversible Markov chains
- Comparison techniques for random walk on finite groups
- The switch Markov chain for sampling irregular graphs and digraphs
- The flip Markov chain for connected regular graphs
- The smallest singular value of a shifted $d$-regular random square matrix
- Circular law for the sum of random permutation matrices
- Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains
- Algebraic algorithms for sampling from conditional distributions
- Walks on generating sets of Abelian groups
- Towards random uniform sampling of bipartite graphs with given degree sequence
- Sampling hypergraphs with given degrees
- The mixing time of switch Markov chains: a unified approach
- The circular law for random regular digraphs
- Modified logarithmic Sobolev inequalities for some models of random walk
- Logarithmic Sobolev inequalities for finite Markov chains
- Circular law for sparse random regular digraphs
- Analyzing Glauber dynamics by comparison of Markov chains
- On the Increase of Dispersion of Sums of Independent Random Variables
- Uniform generation of random regular graphs of moderate degree
- Generating a random permutation with random transpositions
- Some Inequalities for Reversible Markov Chains
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Generating Random Regular Graphs Quickly
- Generalized Monte Carlo significance tests
- Uniform Generation of Random Regular Graphs
- Random graphs with given vertex degrees and switchings
- Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices
- The probability that a random multigraph is simple. II
- The switch Markov chain for sampling irregular graphs (Extended Abstract)
- Structure of eigenvectors of random regular digraphs
- Sampling Regular Graphs and a Peer-to-Peer Network
- Partitions and Their Representative Graphs
- Generating random regular graphs
- Generating random regular graphs
