Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
From MaRDI portal
Recommendations
Cites work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Approximating the Permanent
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- Eigenvalues and expanders
- Fast uniform generation of regular graphs
- Geometric bounds for eigenvalues of Markov chains
- Isoperimetric numbers of graphs
- Markov chain models - rarity and exponentiality
- On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
- Some Inequalities for Reversible Markov Chains
- Sparsest cuts and bottlenecks in graphs
- The maximum concurrent flow problem
Cited in
(only showing first 100 items - show all)- Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions
- What do we know about the Metropolis algorithm?
- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?
- The spectral gap of the REM under Metropolis dynamics
- Slow droplet-driven relaxation of stochastic Ising models in the vicinity of the phase coexistence region
- Approximating the number of monomer-dimer coverings of a lattice.
- A modified conditional Metropolis-Hastings sampler
- Spectral gap of random hyperbolic graphs and related parameters
- Random cluster dynamics for the Ising model is rapidly mixing
- The effect of boundary conditions on mixing of 2D Potts models at discontinuous phase transitions
- The switch Markov chain for sampling irregular graphs and digraphs
- Stochastic modelling of the eukaryotic heat shock response
- The flip Markov chain for connected regular graphs
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
- On approximating weighted sums with exponentially many terms
- On the two-dimensional dynamical Ising model in the phase coexistence region
- Dimension spectrum of Axiom A diffeomorphisms. I: The Bowen-Margulis measure
- Markov chain convergence: From finite to infinite
- Convergence rate of Markov chain methods for genomic motif discovery
- Mixing of Markov chains for independent sets on chordal graphs with bounded separators
- Comparing with octopi
- Half-graphs, other non-stable degree sequences, and the switch Markov chain
- Asymptotic exponential law for the transition time to equilibrium of the metastable kinetic Ising model with vanishing magnetic field
- Random-cluster dynamics in \(\mathbb{Z}^2\): rapid mixing with general boundary conditions
- A new criterion and method for amino acid classification
- Mixing of the square plaquette model on a critical length scale
- Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs
- Function-specific mixing times and concentration away from equilibrium
- The mixing time of switch Markov chains: a unified approach
- Cutoff for the square plaquette model on a critical length scale
- Linking and cutting spanning trees
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- On the cover time and mixing time of random geometric graphs
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Heat-bath random walks with Markov bases
- Conductance and noncommutative dynamical systems
- Minimising MCMC variance via diffusion limits, with an application to simulated tempering
- Structure and eigenvalues of heat-bath Markov chains
- Systematic scan for sampling colorings
- A dynamic programming approach to efficient sampling from Boltzmann distributions
- Logarithmic Sobolev inequalities for finite Markov chains
- A new genetic algorithm
- Poisson approximation for non-backtracking random walks
- Mixing time of the switch Markov chain and stable degree sequences
- Geometric bounds for convergence rates of averaging algorithms
- Improved bounds for sampling colorings
- Self-testing algorithms for self-avoiding walks
- Some problems on approximate counting in graphs and matroids
- The cover time of random geometric graphs
- The mixing time of Glauber dynamics for coloring regular trees
- Uniform sampling of digraphs with a fixed degree sequence
- Strong spatial mixing and rapid mixing with five colours for the Kagome lattice
- Sampling Edge Covers in 3-Regular Graphs
- Logarithmic Sobolev, isoperimetry and transport inequalities on graphs
- The Glauber dynamics for edge-colorings of trees
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Simple permutations mix even better
- The Quantum Complexity of Markov Chain Monte Carlo
- Random walks on the vertices of transportation polytopes with constant number of sources
- The cover times of random walks on random uniform hypergraphs
- Dynamics of (2+1)-dimensional SOS surfaces above a wall: slow mixing induced by entropic repulsion
- A one-dimensional coagulation-fragmentation process with a dynamical phase transition
- On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
- scientific article; zbMATH DE number 1301966 (Why is no real title available?)
- Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains
- Pattern hit-and-run for sampling efficiently on polytopes
- Markov-chain monte carlo: Some practical implications of theoretical results
- Approximating the number of double cut-and-join scenarios
- Cover time of a random graph with given degree sequence
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
- Multiplayer parallel repetition for expanding games
- Configuring random graph models with fixed degree sequences
- New classes of degree sequences with fast mixing swap Markov chain sampling
- A semidefinite bound for mixing rates of Markov chains
- An Almost m-wise Independent Random Permutation of the Cube
- Testing Expansion in Bounded-Degree Graphs
- Communities, Random Walks, and Social Sybil Defense
- scientific article; zbMATH DE number 7370527 (Why is no real title available?)
- Speeding up switch Markov chains for sampling bipartite graphs with given degree sequence
- Randomly coloring graphs of logarithmically bounded pathwidth
- Rapid mixing of the switch Markov chain for 2-class joint degree matrices
- The mixing time of a random walk on a long-range percolation cluster in pre-Sierpinski gasket
- The worm process for the Ising model is rapidly mixing
- A spectral independence view on hard spheres via block dynamics
- Geometric ergodicity of a more efficient conditional Metropolis-Hastings algorithm
- A Schur complement Cheeger inequality
- Approximability of the eight-vertex model
- Thermalization time bounds for Pauli stabilizer Hamiltonians
- Clustering and community detection in directed networks: a survey
- Approximate spectral gaps for Markov chain mixing times in high dimensions
- Convergence of conditional Metropolis-Hastings samplers
- Efficient Simulation of High Dimensional Gaussian Vectors
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
- Blocking Conductance and Mixing in Random Walks
- Tight bounds for the cover time of multiple random walks
- Sensitivity and convergence of uniformly ergodic Markov chains
- Intersection conductance and canonical alternating paths: methods for general finite Markov chains
- Uniform multicommodity flows in the hypercube with random edge‐capacities
- Vacant sets and vacant nets: component structures induced by a random walk
- scientific article; zbMATH DE number 7650134 (Why is no real title available?)
This page was built for publication: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291194)
