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