The following pages link to (Q4798347):
Displaying 50 items.
- Random partition models and complementary clustering of Anglo-Saxon place-names (Q262348) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
- On some Tutte polynomial sequences in the square lattice (Q412170) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- On eigenvalues of random complexes (Q503252) (← links)
- The worm process for the Ising model is rapidly mixing (Q504198) (← links)
- Entropy-driven cutoff phenomena (Q690635) (← links)
- On the approximation of one Markov chain by another (Q818819) (← links)
- Inapproximability of the Tutte polynomial (Q937302) (← links)
- Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers (Q940932) (← links)
- Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (Q967292) (← links)
- Matrix norms and rapid mixing for spin systems (Q1009479) (← links)
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (Q1034528) (← links)
- Mixing 3-colourings in bipartite graphs (Q1039431) (← links)
- The switch Markov chain for sampling irregular graphs and digraphs (Q1704570) (← links)
- The flip Markov chain for connected regular graphs (Q1720312) (← links)
- Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains (Q1769410) (← links)
- Counting and sampling \(H\)-colourings (Q1887143) (← links)
- Inapproximability of the Tutte polynomial of a planar graph (Q1926110) (← links)
- Markov chains, Hamiltonian cycles and volumes of convex bodies (Q1945510) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Mixing of Markov chains for independent sets on chordal graphs with bounded separators (Q2019517) (← links)
- Polymer dynamics via cliques: new conditions for approximations (Q2110377) (← links)
- Modified log-Sobolev inequalities for strongly log-concave distributions (Q2227722) (← links)
- Incremental delay enumeration: space and time (Q2274091) (← links)
- Microscopic path structure of optimally aligned random sequences (Q2278651) (← links)
- Solving and sampling with many solutions (Q2309479) (← links)
- Mixing time of Markov chains for the 1-2 model (Q2328714) (← links)
- Efficient importance sampling for binary contingency tables (Q2389598) (← links)
- The complexity of counting Eulerian tours in 4-regular graphs (Q2429360) (← links)
- Structure and eigenvalues of heat-bath Markov chains (Q2451698) (← links)
- Perfect simulation for a class of positive recurrent Markov chains (Q2456044) (← links)
- Path coupling without contraction (Q2457299) (← links)
- Connectedness of the graph of vertex-colourings (Q2470462) (← links)
- Random bichromatic matchings (Q2482731) (← links)
- Systematic scan for sampling colorings (Q2494577) (← links)
- Simple permutations mix well (Q2581269) (← links)
- Counting Candy Crush configurations (Q2661216) (← links)
- Spectral independence, coupling, and the spectral gap of the Glauber dynamics (Q2671814) (← links)
- Young tableaux with periodic walls: counting with the density method (Q2680926) (← links)
- A Markov chain on the solution space of edge colorings of bipartite graphs (Q2696608) (← links)
- Integrating and Sampling Cuts in Bounded Treewidth Graphs (Q2833051) (← links)
- Sampling colourings of the triangular lattice (Q2904597) (← links)
- Some Problems on Approximate Counting in Graphs and Matroids (Q2971623) (← links)
- Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (Q3012830) (← links)
- Randomly coloring random graphs (Q3055885) (← links)
- The Computational Complexity of Estimating MCMC Convergence Time (Q3088115) (← links)
- Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)
- A Dichotomy Theorem for Polynomial Evaluation (Q3182924) (← links)
