scientific article; zbMATH DE number 6813269

Elizabeth L. Wilmer, Yuval Peres, David A. Levin

Publication date: 28 November 2017

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Markov chains Ising model mixing time hitting time

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (only showing first 100 items - show all)

Avoidance couplings on non‐complete graphs ⋮ Mixing time of PageRank surfers on sparse random digraphs ⋮ An adjacency matrix perspective of talented monoids and Leavitt path algebras ⋮ A Markovian and Roe-algebraic approach to asymptotic expansion in measure ⋮ Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs ⋮ Universal cutoff for Dyson Ornstein Uhlenbeck process ⋮ Correction to: ``Exact value of the resistance exponent for four dimensional random walk trace ⋮ Quantum walk mixing is faster than classical on periodic lattices ⋮ Convergence of the integral fluctuation theorem estimator for nonequilibrium Markov systems ⋮ ELECTORAL MALDISTRICTING ⋮ Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem ⋮ The near-critical two-point function and the torus plateau for weakly self-avoiding walk in high dimensions ⋮ Contact topology and non-equilibrium thermodynamics ⋮ Hahn polynomials and the Burnside process ⋮ Analysis of a non-reversible Markov chain speedup by a single edge ⋮ Cosh gradient systems and tilting ⋮ Dimension-free local convergence and perturbations for reflected Brownian motions ⋮ Cutoff for rewiring dynamics on perfect matchings ⋮ Mixing of the averaging process and its discrete dual on finite-dimensional geometries ⋮ Mixing times for the simple exclusion process with open boundaries ⋮ Modified log-Sobolev inequalities for strong-Rayleigh measures ⋮ Sampling planar tanglegrams and pairs of disjoint triangulations ⋮ Extremal bipartite independence number and balanced coloring ⋮ Mixing times for the TASEP in the maximal current phase ⋮ Abelian sandpiles on Sierpiński gasket graphs ⋮ Mixing time and cutoff for one-dimensional particle systems ⋮ On a variant of the product replacement algorithm ⋮ Interlacement limit of a stopped random walk trace on a torus ⋮ Trace distance ergodicity for quantum Markov semigroups ⋮ 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 ⋮ Probabilistic parking functions ⋮ Cutoff for the averaging process on the hypercube and complete bipartite graphs ⋮ Forbidden intersections for codes ⋮ Scale-free percolation mixing time ⋮ Geometry of random Cayley graphs of abelian groups ⋮ Exact distributed sampling ⋮ Target Network and Truncation Overcome the Deadly Triad in \(\boldsymbol{Q}\)-Learning ⋮ Low-temperature Ising dynamics with random initializations ⋮ Learning Stationary Nash Equilibrium Policies in \(n\)-Player Stochastic Games with Independent Chains ⋮ Rowmotion Markov chains ⋮ Universality of cutoff for exclusion with reservoirs ⋮ Singular relaxation of a random walk in a box with a Metropolis Monte Carlo dynamics ⋮ On the \(\alpha\)-lazy version of Markov chains in estimation and testing problems ⋮ Approximation Algorithms for the Random Field Ising Model ⋮ Convergence rate of multiple-try Metropolis independent sampler ⋮ How long is the chaos game? ⋮ Upgrading MLSI to LSI for reversible Markov chains ⋮ Cutoff for the non reversible SSEP with reservoirs ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ Phase transition in noisy high-dimensional random geometric graphs ⋮ Online Bootstrap Inference For Policy Evaluation In Reinforcement Learning ⋮ Cutoff in the Bernoulli-Laplace urn model with swaps of order \(n\) ⋮ On the multiplicative Chung-Diaconis-Graham process ⋮ On the Turán number of the hypercube ⋮ Geometric bounds on the fastest mixing Markov chain ⋮ The GHP scaling limit of uniform spanning trees in high dimensions ⋮ A random walk on the Rado graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Metastability of Blume-Capel model with zero chemical potential and zero external field ⋮ 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 ⋮ The local limit of the uniform spanning tree on dense graphs ⋮ Broadcasting on paths and cycles ⋮ Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes ⋮ Cutoff profile of ASEP on a segment ⋮ Stochastic strategies for patrolling a terrain with a synchronized multi-robot system ⋮ On sensitivity of uniform mixing times ⋮ Lower bounds for the rate of convergence for continuous-time inhomogeneous Markov chains with a finite state space ⋮ Spectral gap and cutoff phenomenon for the Gibbs sampler of \(\nabla \varphi\) 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 ⋮ Perfect shuffling by lazy swaps ⋮ The effect of boundary conditions on mixing of 2D Potts models at discontinuous phase transitions ⋮ 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

This page was built for publication: