scientific article; zbMATH DE number 6472599

zbMATH Open1321.68378MaRDI QIDQ5501802FDOQ5501802

Authors Russ Bubley, Martin Dyer 

Publication date 14 August 2015

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(28)

• Counting and sampling orientations on chordal graphs
• On the convergence to equilibrium of Kac's random walk on matrices
• On the mixing time of Kac's walk and other high-dimensional Gibbs samplers with constraints
• On systematic scan for sampling \(H\)-colorings of the path
• Path coupling using stopping times and counting independent sets and colorings in hypergraphs
• Computational complexity of counting problems on 3-regular planar graphs
• Sampling Eulerian orientations of triangular lattice graphs
• scientific article; zbMATH DE number 7561278 (Why is no real title available?)
• Graph curvature via resistance distance
• Efficiency test of pseudorandom number generators using random walks
• Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
• Mixing time of the card-cyclic-to-random shuffle
• Cutoff for rewiring dynamics on perfect matchings
• Matrix norms and rapid mixing for spin systems
• Elementary bounds on mixing times for decomposable Markov chains
• Rigorous inequalities between length and time scales in glassy systems
• Cutoff for the mean-field zero-range process with bounded monotone rates
• Convergence to equilibrium of logit dynamics for strategic games
• A power law of order 1/4 for critical mean field Swendsen-Wang dynamics
• The complexity of Bayesian networks specified by propositional and relational languages
• The mean-field zero-range process with unbounded monotone rates: mixing time, cutoff, and Poincaré constant
• Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings
• The complexity of approximating bounded-degree Boolean \(\#\)CSP
• scientific article; zbMATH DE number 7370527 (Why is no real title available?)
• On symmetric signatures in holographic algorithms
• Perfect sampling using bounding chains.
• Zeros and approximations of holant polynomials on the complex plane
• AntiFactor is FPT parameterized by treewidth and list size (but counting is hard)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501802)