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