Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
From MaRDI portal
Publication:4595047
Recommendations
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Convergence Rates for Markov Chains
- scientific article; zbMATH DE number 1426485
- scientific article; zbMATH DE number 18982
- Markov chains. Gibbs fields, Monte Carlo simulation and queues
Cited in
(only showing first 100 items - show all)- Resolving the mixing time of the Langevin algorithm to its stationary distribution for log-concave sampling
- Mixing time of the adjacent walk on the simplex
- Expected hitting time estimates on finite graphs
- Metastability cascades and prewetting in the SOS model
- Metastability of Blume-Capel model with zero chemical potential and zero external field
- A threshold for cutoff in two-community random graphs
- Cutoff on trees is rare
- The mixing time of the Lozenge tiling Glauber dynamics
- An approximate policy iteration viewpoint of actor-critic algorithms
- A random walk perspective on hide-and-seek games
- Total variation cutoff for the transpose top-2 with random shuffle
- On limiting characteristics for a non-stationary two-processor heterogeneous system with catastrophes, server failures and repairs
- A spectral condition for spectral gap: fast mixing in high-temperature Ising models
- Diffusion and consensus on weakly connected directed graphs
- Counting Hamilton cycles in Dirac hypergraphs
- Mixing time for the asymmetric simple exclusion process in a random environment
- Metastable mixing of Markov chains: efficiently sampling low temperature exponential random graphs
- Energy landscape and metastability of stochastic Ising and Potts models on three-dimensional lattices without external fields
- Localization schemes: a framework for proving mixing bounds for Markov chains
- Optimal enhanced dissipation and mixing for a time-periodic, Lipschitz velocity field on \(\mathbb{T}^2\)
- Probabilistic parking functions
- Electrical flows over spanning trees
- Finite-sample analysis of nonlinear stochastic approximation with applications in reinforcement learning
- On the cover time of dense graphs
- A Harris theorem for enhanced dissipation, and an example of Pierrehumbert
- The robustness of democratic consensus
- A probabilistic approach to convex \((\phi)\)-entropy decay for Markov chains
- Multiscale sparse microcanonical models
- Pagerank asymptotics on directed preferential attachment networks
- Sorting by swaps with noisy comparisons
- Aging and sub-aging for one-dimensional random walks amongst random conductances
- Entropy and curvature: beyond the Peres-Tetali conjecture
- The mathematics of mixing things up
- Markov Chains Through Semigroup Graph Expansions (A Survey)
- Expansion in supercritical random subgraphs of the hypercube and its consequences
- The backward Euler-Maruyama method for invariant measures of stochastic differential equations with super-linear coefficients
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
- Mixing times and cutoff for the TASEP in the high and low density phase
- A Markovian and Roe-algebraic approach to asymptotic expansion in measure
- Learning interaction kernels in stochastic systems of interacting particles from multiple trajectories
- Forbidden intersections for codes
- A spectral independence view on hard spheres via block dynamics
- Coalescing property of an interface SDE with correlated noises
- Toward derandomizing Markov chain Monte Carlo
- Discordant edges for the voter model on regular random graphs
- A necessary and sufficient condition for double coset lumping of Markov chains on groups with an application to the random to top shuffle
- Fast mixing of a randomized shift-register Markov chain
- Analysis of a non-reversible Markov chain speedup by a single edge
- Structural results for the tree builder random walk
- On the uniform ergodicity rate of a fractional Ehrenfest urn model
- Sub-critical exponential random graphs: concentration of measure and some applications
- Quasi-stationary distributions of non-absorbing Markov chains
- Game dynamics and equilibrium computation in the population protocol model
- Graphon-valued stochastic processes from population genetics
- Metastability in Glauber dynamics for heavy-tailed spin glasses
- Stochastic theory of nonlinear electrical circuits in thermal equilibrium
- Exact coupling of random walks on Polish groups
- Linking and cutting spanning trees
- Hitting, mixing and tunneling asymptotics of Metropolis-Hastings reversiblizations in the low-temperature regime
- Invariant measure of a stochastic food-limited population model with regime switching
- Analytic-geometric methods for finite Markov chains with applications to quasi-stationarity
- Scale-free percolation mixing time
- Stationary distributions and convergence for \(M/M/1\) queues in interactive random environment
- Rankings in directed configuration models with heavy tailed in-degrees
- Maximizing convergence time in network averaging dynamics subject to edge removal
- Cutoff at the entropic time for random walks on covered expander graphs
- Reproducing kernel orthogonal polynomials on the multinomial distribution
- Out-of-equilibrium random walks
- Reconfiguration of connected graph partitions via recombination
- MIP outer belief approximations of lower conditional joint CDFs in statistical matching problems
- Invasion of cooperative parasites in moderately structured host populations
- Best fit bin packing with random order revisited
- The diameter of the uniform spanning tree of dense graphs
- On an epidemic model on finite graphs
- Best fit bin packing with random order revisited
- Stochastic-constrained stochastic optimization with Markovian data
- Geometry of random Cayley graphs of abelian groups
- Exact distributed sampling
- Target Network and Truncation Overcome the Deadly Triad in \(\boldsymbol{Q}\)-Learning
- Learning Stationary Nash Equilibrium Policies in n-Player Stochastic Games with Independent Chains
- Rowmotion Markov chains
- Universality of cutoff for exclusion with reservoirs
- Dynamics of a Fleming-Viot type particle system on the cycle graph
- Mixing cutoff for simple random walks on the Chung-Lu digraph
- Almost-linear planted cliques elude the Metropolis process
- On the tractability of sampling from the Potts model at low temperatures via random-cluster dynamics
- Faster algorithm and sharper analysis for constrained Markov decision process
- scientific article; zbMATH DE number 7650104 (Why is no real title available?)
- Markov chains. Gibbs fields, Monte Carlo simulation and queues
- A low-rank spectral method for learning Markov models
- Approximating the stationary distribution of the ASEP with open boundaries
- The varentropy criterion is sharp on expanders
- The large deviation principle for W-random spectral measures
- Cutoff for the averaging process on the hypercube and complete bipartite graphs
- A switch convergence for a small perturbation of a linear recurrence equation
- Regularized modified log-Sobolev inequalities and comparison of Markov chains
- Critical speeding-up in dynamical percolation
- The spectrum of the abelian sandpile model
- Contact topology and non-equilibrium thermodynamics
- Random Attraction in the TASEP Model
This page was built for publication: Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595047)
