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)- From shuffling cards to walking around the building: An introduction to modern Markov chain theory
- The local limit of the uniform spanning tree on dense graphs
- Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes
- On sensitivity of uniform mixing times
- Lower bounds for the rate of convergence for continuous-time inhomogeneous Markov chains with a finite state space
- Perfect shuffling by lazy swaps
- The effect of boundary conditions on mixing of 2D Potts models at discontinuous phase transitions
- Sorting by swaps with noisy comparisons
- Reproducing kernel orthogonal polynomials on the multinomial distribution
- Frogs on trees?
- On sensitivity of mixing times and cutoff
- The maximum relaxation time of a random walk
- Best fit bin packing with random order revisited
- Phase transition of the 2-choices dynamics on core-periphery networks
- On limiting characteristics for a non-stationary two-processor heterogeneous system with catastrophes, server failures and repairs
- Metastability of hard-core dynamics on bipartite graphs
- 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
- Cutoff for the Bernoulli-Laplace urn model with o(n) swaps
- Cutoff for random walk on dynamical Erdős-Rényi graph
- Spectral gap of sparse bistochastic matrices with exchangeable rows
- Dynamics of a Fleming-Viot type particle system on the cycle graph
- A finitary structure theorem for vertex-transitive graphs of polynomial growth
- Second-order term of cover time for planar simple random walk
- On covering monotonic paths with simple random walk
- The full spectrum of random walks on complete finite \(d\)-ary trees
- Propagation of chaos for a general balls into bins dynamics
- Parallel simulation of two-dimensional Ising models using probabilistic cellular automata
- Isometries of probability measures with respect to the total variation distance
- Robust learning in social networks via matrix scaling
- (Non)-escape of mass and equidistribution for horospherical actions on trees
- Spectral clustering revisited: information hidden in the Fiedler vector
- Limit profiles for reversible Markov chains
- A multiscale environment for learning by diffusion
- Cutoff for polymer pinning dynamics in the repulsive phase
- Mixture of hidden Markov models for accelerometer data
- Invasion of cooperative parasites in moderately structured host populations
- Convergence rate bounds for iterative random functions using one-shot coupling
- Pagerank asymptotics on directed preferential attachment networks
- Mixing time of fractional random walk on finite fields
- Mean field behavior during the big bang regime for coalescing random walks
- The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set
- Cut-off phenomenon for the ax+b Markov chain over a finite field
- Glauber-exclusion dynamics: rapid mixing regime
- The Ricci curvature of gluing graph of two complete graphs
- A conversation with David J. Aldous
- Metastability for expanding bubbles on a sticky substrate
- Electrical flows over spanning trees
- Finite-sample analysis of nonlinear stochastic approximation with applications in reinforcement learning
- Expansion in supercritical random subgraphs of the hypercube and its consequences
- On mixing of Markov chains: coupling, spectral independence, and entropy factorization
- The backward Euler-Maruyama method for invariant measures of stochastic differential equations with super-linear coefficients
- A random walk on the indecomposable summands of tensor products of modular representations of \(SL_2\left ({\mathbb{F}_p}\right )\)
- A spectral condition for spectral gap: fast mixing in high-temperature Ising models
- The local limit of uniform spanning trees
- A probabilistic approach to convex \((\phi)\)-entropy decay for Markov chains
- Exact convergence analysis of the independent Metropolis-Hastings algorithms
- No cutoff in spherically symmetric trees
- Broadcasting on paths and cycles
- Cutoff profile of ASEP on a segment
- Stochastic strategies for patrolling a terrain with a synchronized multi-robot system
- Spectral gap and cutoff phenomenon for the Gibbs sampler of interfaces with convex potential
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives
- Some inequalities for reversible Markov chains and branching random walks via spectral optimization
- A competitive search game with a moving target
- Learning interaction kernels in stochastic systems of interacting particles from multiple trajectories
- Strong spatial mixing for repulsive point processes
- On convergence and threshold properties of discrete Lotka-Volterra population protocols
- Shuffling cards by spatial motion
- Long-term concentration of measure and cut-off
- First passage percolation on hyperbolic groups
- SPEck: mining statistically-significant sequential patterns efficiently with exact sampling
- Cutoff for the mean-field zero-range process with bounded monotone rates
- Non-equilibrium fluctuations for the SSEP with a slow bond
- On an epidemic model on finite graphs
- Random-cluster dynamics in \(\mathbb{Z}^2\): rapid mixing with general boundary conditions
- Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering
- Cutoff for the Swendsen-Wang dynamics on the lattice
- Cover times for Markov-generated binary sequences of length two
- Tensor product Markov chains
- Mean field dynamics of stochastic cellular automata for random and small-world graphs
- Mixing time for the repeated balls into bins dynamics
- On biased random walks, corrupted intervals, and learning under adversarial design
- Total variation cutoff for the transpose top-2 with random shuffle
- A spectral characterization for concentration of the cover time
- Stationary distribution and cover time of sparse directed configuration models
- Mixing time of the adjacent walk on the simplex
- A comparison principle for random walk on dynamical percolation
- The exclusion process mixes (almost) faster than independent particles
- Geometric and spectral properties of causal maps
- The probability distribution of the ancestral population size conditioned on the reconstructed phylogenetic tree with occurrence data
- TAP free energy, spin glasses and variational inference
- Modified log-Sobolev inequalities for strongly log-concave distributions
- A switch convergence for a small perturbation of a linear recurrence equation
- Non-standard limits for a family of autoregressive stochastic sequences
- The interchange process on high-dimensional products
- Cutoff for the square plaquette model on a critical length scale
- Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms
- Graphon-valued stochastic processes from population genetics
- On concentration inequalities for vector-valued Lipschitz functions
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)
