Skip header Section
Skip Bibliometrics Section
Algorithms for random generation and counting: a Markov chain approachJanuary 1993
- Author:
- Alistair Sinclair
Abstract
No abstract available.
Cited By
- Gilbert S, Robinson P and Sourav S (2023). Leader Election in Well-Connected Graphs, Algorithmica, 85:4, (1029-1066), Online publication date: 1-Apr-2023.
- Babukhin D and Pogosov W (2021). The effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processors, Quantum Information Processing, 21:1, Online publication date: 1-Jan-2022.
Alev V and Lau L Improved analysis of higher order random walks and applications Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, (1198-1211)- Aloqalaa D, Hodgson J, Kowalski D and Wong P Estimating Invasion Time in Real Landscapes Proceedings of the 2018 2nd International Conference on Computational Biology and Bioinformatics, (55-62)
- Gilbert S, Robinson P and Sourav S Leader Election in Well-Connected Graphs Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, (227-236)
- Bhakta P, Cousins B, Fahrbach M and Randall D Approximately sampling elements with fixed rank in graded posets Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, (1828-1838)
- Miracle S and Randall D (2016). Algorithms to approximately count and sample conforming colorings of graphs, Discrete Applied Mathematics, 210:C, (133-149), Online publication date: 10-Sep-2016.
- Cannon S and Randall D Sampling on lattices with free boundary conditions using randomized extensions Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, (1952-1971)
- Kijima S, Koga K and Makino K (2015). Deterministic random walks on finite graphs, Random Structures & Algorithms, 46:4, (739-761), Online publication date: 1-Jul-2015.
- Jarret M and Jordan S (2015). Adiabatic optimization without local minima, Quantum Information & Computation, 15:3-4, (181-199), Online publication date: 1-Mar-2015.
- Basu R, Hermon J and Peres Y Characterization of cutoff for reversible Markov chains Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, (1774-1791)
- Cannon S, Miracle S and Randall D Phase transitions in random dyadic tilings and rectangular dissections Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, (1573-1589)
- Shenoy K B A, Biswas S and Kurur P Performance of metropolis algorithm for the minimum weight code word problem Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, (485-492)
- See A, Bachrach Y and Kohli P The cost of principles Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, (37-44)
- Dasgupta A, Kumar R and Sarlos T On estimating the average degree Proceedings of the 23rd international conference on World wide web, (795-806)
- Bhakta P, Miracle S and Randall D Clustering and mixing times for segregation models on Z2 Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, (327-340)
- Lu X, Phan T and Bressan S Incremental Algorithms for Sampling Dynamic Graphs Proceedings of the 24th International Conference on Database and Expert Systems Applications - Volume 8055, (327-341)
- Bhakta P, Miracle S, Randall D and Streib A Mixing times of Markov chains for self-organizing lists and biased permutations Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, (1-15)
- Kiyomi M, Okamoto Y and Saitoh T Efficient enumeration of the directed binary perfect phylogenies from incomplete data Proceedings of the 11th international conference on Experimental Algorithms, (248-259)
- Censor-Hillel K, Haeupler B, Kelner J and Maymounkov P Global computation in a poorly connected world Proceedings of the forty-fourth annual ACM symposium on Theory of computing, (961-970)
- Kijima S, Koga K and Makino K Deterministic random walks on finite graphs Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, (16-25)
- Bhatnagar N, Bogdanov A and Mossel E The computational complexity of estimating MCMC convergence time Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques, (424-435)
- Tabourier L, Roth C and Cointet J (2011). Generating constrained random graphs using multiple edge switches, ACM Journal of Experimental Algorithmics, 16, (1.1-1.15), Online publication date: 1-May-2011.
- Elsässer R and Sauerwald T (2011). Tight bounds for the cover time of multiple random walks, Theoretical Computer Science, 412:24, (2623-2641), Online publication date: 1-May-2011.
- Lu X and Bressan S Generating random graphic sequences Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I, (570-579)
- Censor-Hillel K and Shachnai H Fast information spreading in graphs with large weak conductance Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms, (440-448)
- Miracle S, Randall D and Streib A Cluster algorithms for discrete models of colloids with bars Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, (135-149)
- Nonaka Y, Ono H, Kijima S and Yamashita M How slow, or fast, are standard random walks? Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119, (63-68)
- Nonaka Y, Ono H, Kijima S and Yamashita M How slow, or fast, are standard random walks? Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119, (63-68)
- Ayaso O, Shah D and Dahleh M (2010). Information theoretic bounds for distributed computation over networks of point-to-point channels, IEEE Transactions on Information Theory, 56:12, (6020-6039), Online publication date: 1-Dec-2010.
- Censor Hillel K and Shachnai H Partial information spreading with application to distributed maximum coverage Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (161-170)
- Sanyal S, S R and Biswas S Necessary and sufficient conditions for success of the metropolis algorithm for optimization Proceedings of the 12th annual conference on Genetic and evolutionary computation, (1417-1424)
- Berger A and Müller-Hannemann M Uniform sampling of digraphs with a fixed degree sequence Proceedings of the 36th international conference on Graph-theoretic concepts in computer science, (220-231)
- Kijima S, Kiyomi M, Okamoto Y and Uno T (2010). On listing, sampling, and counting the chordal graphs with edge constraints, Theoretical Computer Science, 411:26-28, (2591-2601), Online publication date: 1-Jun-2010.
- Nonaka Y, Ono H, Sadakane K and Yamashita M (2010). The hitting and cover times of Metropolis walks, Theoretical Computer Science, 411:16-18, (1889-1894), Online publication date: 1-Mar-2010.
- Motwani R and Raghavan P Randomized algorithms Algorithms and theory of computation handbook, (12-12)
- Gondree M and Mohassel P Longest common subsequence as private search Proceedings of the 8th ACM workshop on Privacy in the electronic society, (81-90)
- Nonaka Y, Ono H, Sadakane K and Yamashita M How to design a linear cover time random walk on a finite graph Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications, (104-116)
- Emms D, Severini S, Wilson R and Hancock E (2009). Coined quantum walks lift the cospectrality of graphs and trees, Pattern Recognition, 42:9, (1988-2002), Online publication date: 1-Sep-2009.
- Al Hasan M and Zaki M (2009). Output space sampling for graph patterns, Proceedings of the VLDB Endowment, 2:1, (730-741), Online publication date: 1-Aug-2009.
- Emms D, Wilson R and Hancock E (2009). Graph matching using the interference of discrete-time quantum walks, Image and Vision Computing, 27:7, (934-949), Online publication date: 1-Jun-2009.
- Hong S, Cho S, Park M and Lee M (2009). Optimal search-relocation trade-off in Markovian-target searching, Computers and Operations Research, 36:6, (2097-2104), Online publication date: 1-Jun-2009.
- Baumert S, Ghate A, Kiatsupaibul S, Shen Y, Smith R and Zabinsky Z (2009). Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles, Operations Research, 57:3, (727-739), Online publication date: 1-May-2009.
- Bayati M, Montanari A and Saberi A Generating random graphs with large girth Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, (566-575)
- Bar-Yossef Z and Mashiach L Local approximation of pagerank and reverse pagerank Proceedings of the 17th ACM conference on Information and knowledge management, (279-288)
- Bar-Yossef Z and Gurevich M (2008). Random sampling from a search engine's index, Journal of the ACM, 55:5, (1-74), Online publication date: 1-Oct-2008.
- Bogdanov A, Mossel E and Vadhan S The Complexity of Distinguishing Markov Random Fields Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, (331-342)
- Antonellis I, Molina H and Chang C (2008). Simrank++, Proceedings of the VLDB Endowment, 1:1, (408-421), Online publication date: 1-Aug-2008.
- Cebrián M, Dotú I, Van Hentenryck P and Clote P Protein structure prediction on the face centered cubic lattice by local search Proceedings of the 23rd national conference on Artificial intelligence - Volume 1, (241-246)
- Kale S and Seshadhri C An Expansion Tester for Bounded Degree Graphs Proceedings of the 35th international colloquium on Automata, Languages and Programming - Volume Part I, (527-538)
- Kijima S, Kiyomi M, Okamoto Y and Uno T On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints Proceedings of the 14th annual international conference on Computing and Combinatorics, (458-467)
- Bhatnagar N, Randall D, Vazirani V and Vigoda E (2008). Random Bichromatic Matchings, Algorithmica, 50:4, (418-445), Online publication date: 1-Apr-2008.
- Bhatnagar N, Greenberg S and Randall D Sampling stable marriages Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, (1223-1232)
- Schaeffer S (2007). Survey, Computer Science Review, 1:1, (27-64), Online publication date: 1-Aug-2007.
- Nagaraja S Anonymity in the wild Proceedings of the 7th international conference on Privacy enhancing technologies, (254-271)
- Bayati M, Gamarnik D, Katz D, Nair C and Tetali P Simple deterministic approximation algorithms for counting matchings Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (122-127)
- Nikoletseas S, Raptopoulos C and Spirakis P The second eigenvalue of random walks on symmetric random intersection graphs Proceedings of the 2nd international conference on Algebraic informatics, (236-246)
- Gkantsidis C, Goel G, Mihail M and Saberi A Towards Topology Aware Networks Proceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, (2591-2595)
- Nagaraja S Privacy amplification with social networks Proceedings of the 15th international conference on Security protocols, (58-73)
- Galvin D and Randall D Torpid mixing of local Markov chains on 3-colorings of the discrete torus Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (376-384)
- Blanchet J, Liu J and Glynn P State-dependent Importance Sampling and large Deviations Proceedings of the 1st international conference on Performance evaluation methodolgies and tools, (20-es)
- Mosk-Aoyama D and Shah D Computing separable functions via gossip Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, (113-122)
- Faragó A On the convergence rate of quasi lumpable markov chains Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation, (138-147)
- Mitavskiy B and Rowe J (2006). An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms., Evolutionary Computation, 14:1, (87-118), Online publication date: 1-Mar-2006.
- Randall D (2006). Rapidly Mixing Markov Chains with Applications in Computer Science and Physics, Computing in Science and Engineering, 8:2, (30-41), Online publication date: 1-Mar-2006.
- Gkantsidis C, Mihail M and Saberi A (2006). Random walks in peer-to-peer networks, Performance Evaluation, 63:3, (241-263), Online publication date: 1-Mar-2006.
- Mihail M, Papadimitriou C and Saberi A (2006). On certain connectivity properties of the internet topology, Journal of Computer and System Sciences, 72:2, (239-251), Online publication date: 1-Mar-2006.
- Emms D, Severini S, Wilson R and Hancock E Coined quantum walks lift the cospectrality of graphs and trees Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, (332-345)
- Randall D and Winkler P Mixing points on a circle Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques, (426-435)
- Magniez F and Nayak A Quantum complexity of testing group commutativity Proceedings of the 32nd international conference on Automata, Languages and Programming, (1312-1324)
- Gambin A and Wójtowicz D Almost FPRAS for lattice models of protein folding Proceedings of the 4th international conference on Experimental and Efficient Algorithms, (534-544)
- Berenbrink P, Friedetzky T, Hu Z and Martin R On weighted balls-into-bins games Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science, (231-243)
- Hayes T and Vigoda E Coupling with the stationary distribution and improved sampling for colorings and independent sets Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, (971-979)
- Ceccherini-Silberstein T, Scarabotti F and Tolli F (2004). Weighted expanders and the anisotropic Alon-Boppana theorem, European Journal of Combinatorics, 25:5, (735-744), Online publication date: 1-Jul-2004.
- Bhatnagar N and Randall D Torpid mixing of simulated tempering on the Potts model Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (478-487)
- Gkantsidis C, Mihail M and Saberi A Conductance and congestion in power law graphs Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (148-159)
- Gkantsidis C, Mihail M and Saberi A (2003). Conductance and congestion in power law graphs, ACM SIGMETRICS Performance Evaluation Review, 31:1, (148-159), Online publication date: 10-Jun-2003.
- Morris B and Peres Y Evolving sets and mixing Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (279-286)
- Ha V and Haddawy P (2003). Similarity of personal preferences, Artificial Intelligence, 146:2, (149-173), Online publication date: 1-Jun-2003.
- Chandru V, DattaSharma A and Kumar V (2003). The algorithmics of folding proteins on lattices, Discrete Applied Mathematics, 127:1, (145-161), Online publication date: 1-Apr-2003.
- Liu X and Papaefthymiou M A Markov chain sequence generator for power macromodeling Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design, (404-411)
- Kearns M and Singh S (2002). Near-Optimal Reinforcement Learning in Polynomial Time, Machine Language, 49:2-3, (209-232), Online publication date: 1-Nov-2002.
- Dellnitz M and Preis R Congestion and almost invariant sets in dynamical systems Proceedings of the 2nd international conference on Symbolic and numerical scientific computation, (183-209)
- Aharonov D, Ambainis A, Kempe J and Vazirani U Quantum walks on graphs Proceedings of the thirty-third annual ACM symposium on Theory of computing, (50-59)
- Albrecht A, Cheung S, Leung K and Wong C (2001). On the Convergence of Inhomogeneous Markov Chains Approximating Equilibrium Placements of Flexible Objects, Computational Optimization and Applications, 19:2, (179-208), Online publication date: 1-Jul-2001.
- Elsässer R, Monien B and Preis R Diffusive load balancing schemes on heterogeneous networks Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, (30-38)
- Schulman L and Vazirani V Majorizing estimators and the approximation of #P-complete problems Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (288-294)
- Czumaj A, Kanarek P, Kutyłowski M and Loryś K Delayed path coupling and generating random permutations via distributed stochastic processes Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (271-280)
- Ólafsson S and Shi L Stopping criterion for a simulation-based optimization method Proceedings of the 30th conference on Winter simulation, (743-750)
- Ha V and Haddawy P Toward case-based preference elicitation Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence, (193-201)
- Czumaj A Recovery time of dynamic allocation processes Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, (202-211)
- Peinado M and Lengauer T Random generation of embedded graphs and an extension to Dobrushin uniqueness (extended abstract) Proceedings of the thirtieth annual ACM symposium on Theory of computing, (176-185)
- Yamanishi K Distributed cooperative Bayesian learning strategies Proceedings of the tenth annual conference on Computational learning theory, (250-262)
- Fill J An interruptible algorithm for perfect sampling via Markov chains Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, (688-695)
- Luby M and Vigoda E Approximately counting up to four (extended abstract) Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, (682-687)
- Bomze I (1997). Evolution towards the Maximum Clique, Journal of Global Optimization, 10:2, (143-164), Online publication date: 1-Mar-1997.
- Shi L and Hwang P A Method for Real-Time Scheduling Problems Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
- Bubley R and Dyer M Graph orientations with no sink and an approximation for a hard case of #SAT Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (248-257)
- Wilson D Generating random spanning trees more quickly than the cover time Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, (296-303)
- Wilson D and Propp J How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, (448-457)
- Zito M, Pu I, Amos M and Gibbons A RCN algorithms for the uniform generation of combinatorial structures Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, (429-437)
- Diaconis P and Saloff-Coste L What do we know about the Metropolis algorithm? Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (112-129)
- de Rougemont M The reliability of queries (extended abstract) Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (286-291)
- Randall D and Sinclair A Testable algorithms for self-avoiding walks Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, (593-602)
- Kenyon C, Randall D and Sinclair A Matchings in lattice graphs Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, (738-746)
Index Terms
- Algorithms for random generation and counting: a Markov chain approach
Recommendations
On the Value of derivative evaluations and random walk suppression in Markov Chain Monte Carlo algorithms
Two strategies that can potentially improve Markov Chain Monte Carlo algorithms are to use derivative evaluations of the target density, and to suppress random walk behaviour in the chain. The use of one or both of these strategies has been investigated ...