scientific article; zbMATH DE number 1342087
From MaRDI portal
Publication:4263659
zbMath0946.60066MaRDI QIDQ4263659
Catherine Greenhill, Martin Dyer
Publication date: 21 November 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40)
Related Items (15)
Counting and sampling \(H\)-colourings ⋮ Zeros and approximations of holant polynomials on the complex plane ⋮ Fast mixing via polymers for random graphs with unbounded degree ⋮ Fast algorithms at low temperatures via Markov chains† ⋮ Adaptive drift analysis ⋮ Unnamed Item ⋮ Path coupling without contraction ⋮ A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant ⋮ Matrix norms and rapid mixing for spin systems ⋮ Rapid mixing for lattice colourings with fewer colours ⋮ Halving the Bounds for the Markov, Chebyshev, and Chernoff Inequalities Using Smoothing ⋮ Sampling Eulerian orientations of triangular lattice graphs ⋮ Random walks on a finite graph with congestion points ⋮ Approximate Counting via Correlation Decay in Spin Systems ⋮ Approximate counting of standard set-valued tableaux
This page was built for publication:
