The following pages link to Approximating the Permanent (Q3211352):
Displaying 50 items.
- The effect of boundary conditions on mixing of 2D Potts models at discontinuous phase transitions (Q1663879) (← links)
- T-tetrominoes Tiling's Markov chain mixes fast (Q1694722) (← links)
- Sampling contingency tables (Q1713620) (← links)
- The flip Markov chain for connected regular graphs (Q1720312) (← links)
- The Ising partition function: zeros and deterministic approximation (Q1730971) (← links)
- Rejection sampling of bipartite graphs with given degree sequence (Q1737401) (← links)
- Counting hypergraph matchings up to uniqueness threshold (Q1740650) (← links)
- Glauber dynamics on trees and hyperbolic graphs (Q1780979) (← links)
- Expanding and forwarding (Q1805464) (← links)
- An analysis of Monte Carlo algorithm for estimating the permanent (Q1842570) (← links)
- Markov chain decomposition for convergence rate analysis (Q1872401) (← links)
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\). (Q1877387) (← links)
- On the two-dimensional dynamical Ising model in the phase coexistence region (Q1906384) (← links)
- Dimension spectrum of Axiom A diffeomorphisms. I: The Bowen-Margulis measure (Q1906389) (← links)
- Markov chain convergence: From finite to infinite (Q1915845) (← links)
- A mildly exponential approximation algorithm for the permanent (Q1923855) (← links)
- Exact thresholds for Ising-Gibbs samplers on general graphs (Q1942118) (← links)
- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix (Q1959434) (← links)
- Mixing times for uniformly ergodic Markov chains (Q1965874) (← links)
- A faster FPTAS for counting two-rowed contingency tables (Q1983128) (← links)
- A two-level method for mimetic finite difference discretizations of elliptic problems (Q2006548) (← links)
- Uniform generation of \(d\)-factors in dense host graphs (Q2014710) (← links)
- Mixing of Markov chains for independent sets on chordal graphs with bounded separators (Q2019517) (← links)
- Cutoff for random walk on dynamical Erdős-Rényi graph (Q2028956) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- A multiscale environment for learning by diffusion (Q2075000) (← links)
- Zero-freeness and approximation of real Boolean Holant problems (Q2143138) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
- Random-cluster dynamics in \(\mathbb{Z}^2\): rapid mixing with general boundary conditions (Q2180389) (← links)
- The mixing time of switch Markov chains: a unified approach (Q2237855) (← links)
- Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin (Q2301362) (← links)
- Convergence time to equilibrium of the Metropolis dynamics for the GREM (Q2302656) (← links)
- Mixing of permutations by biased transpositions (Q2321931) (← links)
- Sampling \(k\)-partite graphs with a given degree sequence (Q2326166) (← links)
- A version of Aldous' spectral-gap conjecture for the zero range process (Q2330459) (← links)
- Linking and cutting spanning trees (Q2331458) (← links)
- Uniform generation of spanning regular subgraphs of a dense graph (Q2335698) (← links)
- Spatial mixing and the connective constant: optimal bounds (Q2359740) (← links)
- A hybrid algorithm for computing permanents of sparse matrices (Q2369215) (← links)
- Approximating a sequence of observations by a simple process (Q2388342) (← links)
- On the computational complexity of MCMC-based estimators in large samples (Q2388988) (← links)
- A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces (Q2444407) (← links)
- Simple Monte Carlo and the Metropolis algorithm (Q2465298) (← links)
- Random bichromatic matchings (Q2482731) (← links)
- Evolving sets, mixing and heat kernel bounds (Q2571014) (← links)
- Spectral independence, coupling, and the spectral gap of the Glauber dynamics (Q2671814) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Self-testing algorithms for self-avoiding walks (Q2737885) (← links)
- Random sampling for the monomer-dimer model on a lattice. (Q2737886) (← links)
