Pages that link to "Item:Q1117955"

The following pages link to Approximate counting, uniform generation and rapidly mixing Markov chains (Q1117955):

Displayed 50 items.

• Improving the characterization of P-stability for applications in network privacy (Q277631) ‎ (← links)
• Simulated tempering and swapping on mean-field models (Q330616) ‎ (← links)
• Random walks on quasirandom graphs (Q396948) ‎ (← links)
• Mixing time of near-critical random graphs (Q428137) ‎ (← links)
• Complexity and approximability of the cover polynomial (Q445242) ‎ (← links)
• Multi-way dual Cheeger constants and spectral bounds of graphs (Q471683) ‎ (← links)
• Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions (Q473164) ‎ (← links)
• Thermalization time bounds for Pauli stabilizer Hamiltonians (Q514307) ‎ (← links)
• The small world effect on the coalescing time of random walks (Q544499) ‎ (← links)
• Spectra of lifted Ramanujan graphs (Q555601) ‎ (← links)
• Slow mixing of Markov chains using fault lines and fat contours (Q603913) ‎ (← links)
• A sequential algorithm for generating random graphs (Q603928) ‎ (← links)
• On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries (Q652625) ‎ (← links)
• Metric uniformization and spectral bounds for graphs (Q659931) ‎ (← links)
• Nash inequalities for finite Markov chains (Q678089) ‎ (← links)
• Laplace eigenvalues of graphs---a survey (Q686298) ‎ (← links)
• Glauber dynamics for the mean-field Potts model (Q694616) ‎ (← links)
• The spectra of multiplicative attribute graphs (Q741499) ‎ (← links)
• Asymptotic optimality of isoperimetric constants (Q742109) ‎ (← links)
• A new characterization of \(\mathcal{V} \)-posets (Q781541) ‎ (← links)
• Efficient simulated annealing on fractal energy landscapes (Q805499) ‎ (← links)
• Agent-based randomized broadcasting in large networks (Q867856) ‎ (← links)
• Spectral partitioning works: planar graphs and finite element meshes (Q869898) ‎ (← links)
• Fast uniform generation of regular graphs (Q909471) ‎ (← links)
• Characterization of equilibrium measures for critical reversible nearest particle systems (Q931606) ‎ (← links)
• Soft memberships for spectral clustering, with application to permeable language distinction (Q955819) ‎ (← links)
• Sampling Eulerian orientations of triangular lattice graphs (Q1026226) ‎ (← links)
• Expander properties and the cover time of random intersection graphs (Q1034533) ‎ (← links)
• Selection of relevant features and examples in machine learning (Q1127357) ‎ (← links)
• On the conductance of order Markov chains (Q1182035) ‎ (← links)
• Counting linear extensions (Q1183942) ‎ (← links)
• Approximating the permanent of graphs with large factors (Q1199692) ‎ (← links)
• Simple bounds on the convergence rate of an ergodic Markov chain (Q1209327) ‎ (← links)
• What do we know about the Metropolis algorithm? (Q1273859) ‎ (← links)
• Log-Sobolev inequalities and sampling from log-concave distributions (Q1296584) ‎ (← links)
• The spectral gap of the REM under Metropolis dynamics (Q1296612) ‎ (← links)
• Faster random generation of linear extensions (Q1301730) ‎ (← links)
• Finite approximations to the critical reversible nearest particle system (Q1307463) ‎ (← links)
• Slow droplet-driven relaxation of stochastic Ising models in the vicinity of the phase coexistence region (Q1325572) ‎ (← links)
• Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (Q1330890) ‎ (← links)
• Semidefinite programming in combinatorial optimization (Q1365053) ‎ (← links)
• Coupling, spectral gap and related topics. II (Q1375818) ‎ (← links)
• Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing (Q1404632) ‎ (← links)
• Optimal scaling for various Metropolis-Hastings algorithms. (Q1431214) ‎ (← links)
• Spectral concentration and greedy \(k\)-clustering (Q1624584) ‎ (← links)
• The local limit of the uniform spanning tree on dense graphs (Q1633961) ‎ (← links)
• Vertical perimeter versus horizontal perimeter (Q1643390) ‎ (← links)
• Random cluster dynamics for the Ising model is rapidly mixing (Q1650104) ‎ (← links)
• Sampling weighted perfect matchings on the square-octagon lattice (Q1675927) ‎ (← links)
• On sensitivity of mixing times and cutoff (Q1748929) ‎ (← links)