The following pages link to (Q3135094):
Displaying 50 items.
- The complexity of estimating min-entropy (Q260395) (← links)
- Algorithms to approximately count and sample conforming colorings of graphs (Q299070) (← links)
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
- Pattern hit-and-run for sampling efficiently on polytopes (Q433826) (← links)
- Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm (Q456181) (← links)
- Graph clustering (Q458448) (← links)
- Expansion of random graphs: new proofs, new results (Q496208) (← links)
- Tight bounds for the cover time of multiple random walks (Q541669) (← links)
- Tilings of rectangles with T-tetrominoes (Q596042) (← links)
- Limits and rates of convergence for the distribution of search cost under the move-to-front rule (Q671429) (← links)
- Nash inequalities for finite Markov chains (Q678089) (← links)
- The swapping algorithm for the Hopfield model with two patterns (Q734648) (← links)
- Similarity of personal preferences: Theoretical foundations and empirical analysis (Q814460) (← links)
- Relation-algebraic computation of fixed points with applications (Q817578) (← links)
- Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability (Q843708) (← links)
- A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search (Q958076) (← links)
- The hitting and cover times of Metropolis walks (Q964410) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- Optimal search-relocation trade-off in Markovian-target searching (Q1001004) (← links)
- Stochastic protein folding simulation in the three-dimensional HP-model (Q1004918) (← links)
- On the hardness of sampling independent sets beyond the tree threshold (Q1017883) (← links)
- Expander properties and the cover time of random intersection graphs (Q1034533) (← links)
- On the random generation and counting of matchings in dense graphs (Q1129018) (← links)
- Uniform positivity improving property, Sobolev inequalities, and spectral gaps (Q1270009) (← links)
- What do we know about the Metropolis algorithm? (Q1273859) (← links)
- Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents (Q1285571) (← links)
- An interruptible algorithm for perfect sampling via Markov chains (Q1296621) (← links)
- A quasi-polynomial-time algorithm for sampling words from a context-free language (Q1363787) (← links)
- Eigenvalues, inequalities and ergodic theory (Q1428920) (← links)
- Importance sampling for families of distributions (Q1578598) (← links)
- Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains (Q1583716) (← links)
- Approximating the number of monomer-dimer coverings of a lattice. (Q1593404) (← links)
- Simple polytopes without small separators. II: Thurston's bound (Q1618117) (← links)
- Sampling weighted perfect matchings on the square-octagon lattice (Q1675927) (← links)
- Utilizing network structure to accelerate Markov chain Monte Carlo algorithms (Q1736821) (← links)
- Sensitivity analysis of a railway station track layout with respect to a given timetable (Q1806663) (← links)
- Algebraic algorithms for sampling from conditional distributions (Q1807063) (← links)
- Weighted expanders and the anisotropic Alon-Boppana theorem (Q1827344) (← links)
- Distributed cooperative Bayesian learning strategies. (Q1854263) (← links)
- Uniform generation of NP-witnesses using an NP-oracle (Q1854397) (← links)
- The algorithmics of folding proteins on lattices. (Q1868718) (← links)
- Markov chain decomposition for convergence rate analysis (Q1872401) (← links)
- Analysis of a nonreversible Markov chain sampler. (Q1872496) (← links)
- Perfect sampling using bounding chains. (Q1879888) (← links)
- Gröbner bases and triangulations of the second hypersimplex (Q1900188) (← links)
- Walks on generating sets of Abelian groups (Q1916691) (← links)
- A mildly exponential approximation algorithm for the permanent (Q1923855) (← links)
- Mixing time for the Ising model: a uniform lower bound for all graphs (Q1944667) (← links)
- Connecting polygonizations via stretches and twangs (Q1959392) (← links)
- Mixing times for uniformly ergodic Markov chains (Q1965874) (← links)