scientific article; zbMATH DE number 6472599
From MaRDI portal
Publication:5501802
zbMath1321.68378MaRDI QIDQ5501802
Publication date: 14 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Perfect sampling using bounding chains. ⋮ Computational complexity of counting problems on 3-regular planar graphs ⋮ Counting and sampling orientations on chordal graphs ⋮ Convergence to equilibrium of logit dynamics for strategic games ⋮ On the convergence to equilibrium of Kac's random walk on matrices ⋮ Rigorous inequalities between length and time scales in glassy systems ⋮ On the mixing time of Kac's walk and other high-dimensional Gibbs samplers with constraints ⋮ Zeros and approximations of holant polynomials on the complex plane ⋮ Elementary bounds on mixing times for decomposable Markov chains ⋮ Cutoff for the mean-field zero-range process with bounded monotone rates ⋮ The complexity of approximating bounded-degree Boolean \(\#\)CSP ⋮ Path coupling using stopping times and counting independent sets and colorings in hypergraphs ⋮ Cutoff for rewiring dynamics on perfect matchings ⋮ The mean-field zero-range process with unbounded monotone rates: mixing time, cutoff, and Poincaré constant ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Graph curvature via resistance distance ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ On symmetric signatures in holographic algorithms ⋮ Efficiency test of pseudorandom number generators using random walks ⋮ On systematic scan for sampling H-colorings of the path ⋮ Unnamed Item ⋮ Matrix norms and rapid mixing for spin systems ⋮ A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics ⋮ Mixing time of the card-cyclic-to-random shuffle ⋮ Sampling Eulerian orientations of triangular lattice graphs ⋮ Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
