The following pages link to Approximating the Permanent (Q3211352):
Displaying 33 items.
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix (Q5251622) (← links)
- Monomer-dimer problem on random planar honeycomb lattice (Q5414765) (← links)
- ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS (Q5493901) (← links)
- (Q5875527) (← links)
- The diameter of the uniform spanning tree of dense graphs (Q5886350) (← links)
- Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs (Q5890038) (← links)
- Approximately Counting Embeddings into Random Graphs (Q5891884) (← links)
- Clifford algebras and approximating the permanent (Q5917579) (← links)
- Counting over non-planar graphs (Q5951424) (← links)
- Gibbs rapidly samples colorings of \(G(n, d/n)\) (Q5961956) (← links)
- Graph classes and the switch Markov chain for matchings (Q5963358) (← links)
- On quantitative convergence to quasi-stationarity (Q5963361) (← links)
- Smoothed counting of 0–1 points in polyhedra (Q6051058) (← links)
- Efficient sampling and counting algorithms for the Potts model on <i>ℤ</i><sup><i>d</i></sup> at all temperatures (Q6051061) (← links)
- Perfect sampling from spatial mixing (Q6052473) (← links)
- Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)
- Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields (Q6053403) (← links)
- Counting independent sets in graphs with bounded bipartite pathwidth (Q6074656) (← links)
- Algebraic and combinatorial expansion in random simplicial complexes (Q6074688) (← links)
- Sequential importance sampling for estimating expectations over the space of perfect matchings (Q6103989) (← links)
- Spatial mixing and the random‐cluster dynamics on lattices (Q6119227) (← links)
- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs (Q6157383) (← links)
- Low-temperature Ising dynamics with random initializations (Q6187481) (← links)
- Approximate sampling of graphs with near-\(P\)-stable degree intervals (Q6192073) (← links)
- Geometric bounds on the fastest mixing Markov chain (Q6193769) (← links)
- Mixing artificial and natural intelligence: from statistical mechanics to AI and back to turbulence (Q6585765) (← links)
- Spectral independence via stability and applications to Holant-type problems (Q6586927) (← links)
- Spectral triadic decompositions of real-world networks (Q6617266) (← links)
- Mixing time of the swap Markov chain and \(P\)-stability (Q6621197) (← links)
- Average mixing in quantum walks of reversible Markov chains (Q6635077) (← links)
- Approximate sampling and counting of graphs with near-regular degree intervals (Q6644114) (← links)
- Fully graphic degree sequences and P-stable degree sequences (Q6655400) (← links)
- Deterministic near-optimal distributed listing of cliques (Q6658820) (← links)
