Article

Free access

Faster random generation of linear extensions

Authors:

Martin DyerAuthors Info & Claims

SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Pages 350 - 354

Published: 01 January 1998 Publication History

First page of PDF

References

[1]

D. Aldous, Random walks on finite groups and rapidly mixing Markov chains, in A. Dold and B. Eckmann, eds., Sdminaire de Probabilitds XVII 1981//1982, vol. 986 of Springer-Verlag Lecture Notes in Mathematics, Springer-Verlag, New York, 1983 pp. 243-297.

[2]

D. Aldous and J. A. Fill, Reversible Markov chains and random walks on graphs, Monograph in preparation; available from http://statwww.berkeley.edu/users/aldous/book.html.

[3]

D. Aldous and J. A. Fill, Reversible Markov chains and random walks on graphs, (Oct. 1994), Chapter 4. Monograph in preparation; available from http://statwww. berkeley, edu / users / aldous / bo ok. ht ml.

[4]

G. Brightwell and P. Winkler, Counting linear extensions, Order, 8 (1991) 3, pp. 225-242.

[5]

R. Bubley and M. Dyer, Path coupling: A technique for proving rapid mixing in Markov chains, in 38th Annual Symposium on Foundations of Computer Science, IEEE, Miami Beach, Florida, 1997 pp. 223-231.

Digital Library

[6]

P. Diaconis and R. L. Graham, Spearman's footrule as a measure of disarray, J. Roy. Statist. Soc. Ser. B, 39 (1977) 2, pp. 262-268.

[7]

P. Diaconis and M. Shahshahani, Generating a random permutation with random transpositions, Z. Wahrsch. Verw. Gebiete, 57 (1981) 2, pp. 159-179.

[8]

L. C. Dinneen and B. C. Blakesley, Definition of Spearman's footrule, J. Roy. Statist. Soc. Set. C, 31 (1982) 1, pp. 66.

[9]

M. Dyer and A. Frieze, Computing the volume of convex bodies: A case where randomness provably helps, in Proceedings of the 44th Symposium in Applied Mathematics, vol. 44 of Symposia in Applied Mathematics, American Mathematical Society, 1991 pp. 123-169.

[10]

M. Dyer, A. Frieze, and R. Kannan, A random polynomial-time algorithm for approximating the volume of convex bodies, J. Assoc. Comput. Mach., 38 (Jan. 1991) 1, pp. 1-17.

Digital Library

[11]

M. Dyer and C. Greenhill, On Markov chains for independent sets, (1997), (Preprint).

[12]

S. Felsner and L. Wernisch, Markov chains for linear extensions, the two-dimensional case, in Proceedings of the Eighth Annual A CM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, 1997 pp. 239-247.

Digital Library

[13]

M. Jerrum and A. Sinclair, The Markov chain Monte Carlo method: an approach to approximate counting and integration, in D. Hochbaum, ed., Approximation Algorithms for NP-Hard Problems, PWS Publishing, Boston, 1996 pp. 482-520.

Digital Library

[14]

A. Karzanov and L. Khachiyan, On the conductance of order Markov chains, Order, 8 (1991) 1, pp. 7-15.

[15]

P. Matthews, Generating a random linear extension of a partial order, Ann. Probab., 19 (1991) 3, pp. 1367- 1392.

[16]

J. G. Propp and D. B. Wilson, Exact sampling with coupled Markov chains and applications to statistical mechanics, Random Structures Algorithms, 9 (1996) 1-2, pp. 223-252.

Digital Library

[17]

G. Pruesse and F. Ruskey, Generating linear extensions fast, SIAM J. Comput, 23 (Apr. 1994) 2, pp. 373-386.

Digital Library

[18]

A. Sinclair and M. Jerrum, Approximate counting, uniform generation and rapidly mixing Markov chains, Inform. and Comp., 82 (1989), pp. 93-133.

Digital Library

[19]

C. Spearman, 'Footrule' for measuring correlations, British J. Psych., 2 (Jul. 1906), pp. 89-108.

[20]

D. B. Wilson, Private Communication, (Aug. 1997).

[21]

D. B. Wilson, Mixing times of lozenge tiling and card shuffling Markov chains, (1997), Manuscript.

Cited By

Chen SDelcourt MMoitra APerarnau GPostle LChan T(2019)Improved bounds for randomly sampling colorings via linear programmingProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310569(2216-2234)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310569
Opara KHryniewicz O(2016)Computation of general correlation coefficients for interval dataInternational Journal of Approximate Reasoning10.1016/j.ijar.2016.02.00773:C(56-75)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1016/j.ijar.2016.02.007
Czumaj AServedio RRubinfeld R(2015)Random Permutations using Switching NetworksProceedings of the forty-seventh annual ACM symposium on Theory of Computing10.1145/2746539.2746629(703-712)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2746539.2746629
Show More Cited By

Index Terms

Faster random generation of linear extensions

Recommendations

Constant time generation of linear extensions
FCT'05: Proceedings of the 15th international conference on Fundamentals of Computation Theory

Given a poset $\mathcal{P}$, several algorithms have been proposed for generating all linear extensions of $\mathcal{P}$. The fastest known algorithm generates each linear extension in constant time “on average”. In this paper we give a simple algorithm ...
Efficient matrix-exponential random variate generation using a numeric linear combination approach
DEVS '14: Proceedings of the Symposium on Theory of Modeling & Simulation - DEVS Integrative

Matrix Exponential (ME) probability distributions form a versatile family of distributions and enable an accurate description and simulation of a wide variety of situations where a positive distribution is required. In queueing theory they are used for ...
Random variate generation and connected computational issues for the Poisson---Tweedie distribution

After providing a systematic outline of the stochastic genesis of the Poisson---Tweedie distribution, some computational issues are considered. More specifically, we introduce a closed form for the probability function, as well as its corresponding ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

January 1998

704 pages

ISBN:0898714109

Chairman:
Howard Karloff

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM: Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 1998

Check for updates

Qualifiers

Article

Conference

SODA98

Sponsor:

SIGACT
SIAM

SODA98: 1998 Conference on Discrete Algorithms

January 25 - 27, 1998

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
413
Total Downloads

Downloads (Last 12 months)42
Downloads (Last 6 weeks)14

Reflects downloads up to 21 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chen SDelcourt MMoitra APerarnau GPostle LChan T(2019)Improved bounds for randomly sampling colorings via linear programmingProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310569(2216-2234)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310569
Opara KHryniewicz O(2016)Computation of general correlation coefficients for interval dataInternational Journal of Approximate Reasoning10.1016/j.ijar.2016.02.00773:C(56-75)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1016/j.ijar.2016.02.007
Czumaj AServedio RRubinfeld R(2015)Random Permutations using Switching NetworksProceedings of the forty-seventh annual ACM symposium on Theory of Computing10.1145/2746539.2746629(703-712)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2746539.2746629
Bhakta PMiracle SRandall DStreib AKhanna S(2013)Mixing times of Markov chains for self-organizing lists and biased permutationsProceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms10.5555/2627817.2627818(1-15)Online publication date: 6-Jan-2013
https://dl.acm.org/doi/10.5555/2627817.2627818
Bei XChen NZhang SBoneh DRoughgarden TFeigenbaum J(2013)On the complexity of trial and errorProceedings of the forty-fifth annual ACM symposium on Theory of Computing10.1145/2488608.2488613(31-40)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1145/2488608.2488613
Bordewich MDyer MKarpinski M(2006)Stopping times, metrics and approximate countingProceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I10.1007/11786986_11(108-119)Online publication date: 10-Jul-2006
https://dl.acm.org/doi/10.1007/11786986_11
Aharonov DTa-Shma ALarmore LGoemans M(2003)Adiabatic quantum state generation and statistical zero knowledgeProceedings of the thirty-fifth annual ACM symposium on Theory of computing10.1145/780542.780546(20-29)Online publication date: 9-Jun-2003
https://dl.acm.org/doi/10.1145/780542.780546
Ha VHaddawy P(2003)Similarity of personal preferencesArtificial Intelligence10.1016/S0004-3702(03)00013-4146:2(149-173)Online publication date: 1-Jun-2003
https://dl.acm.org/doi/10.1016/S0004-3702%2803%2900013-4
Ha VHaddawy PMiyamoto J(2001)Similarity measures on preference structures, part iiProceedings of the Seventeenth conference on Uncertainty in artificial intelligence10.5555/2074022.2074046(186-193)Online publication date: 2-Aug-2001
https://dl.acm.org/doi/10.5555/2074022.2074046
Kumar VRamesh H(1999)Markovian Coupling vs. Conductance for the Jerrum-Sinclair ChainProceedings of the 40th Annual Symposium on Foundations of Computer Science10.5555/795665.796521Online publication date: 17-Oct-1999
https://dl.acm.org/doi/10.5555/795665.796521
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents