Watermelon uniform random generation with applications

Theoretical Computer Science

Volumn 307, Issue 2, 2003, Pages 241-256

  Bonichon, Nicolas ^a   Mosbah, Mohamed ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Baxter permutation; Random; Realizer; Uniform; Vicious walkers; Watermelon

Indexed keywords

ALGORITHMS; POLYNOMIALS; TREES (MATHEMATICS);

PERMUTATIONS;

RANDOM NUMBER GENERATION;

EID: 0141859750     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00218-4     Document Type: Conference Paper

References (37)

1. Aho A.V., Hopcroft J.E., Ullman J.D. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley, Reading, MA.
2. Laurent Alonso, René Schott, Random Generation of Trees. Kluwer Academic Publishers, Dordrecht, 1995.
3. Arnold D.B., Sleep M.R. Uniform random generation of balanced parenthesis strings. ACM Trans. Programming Languages Systems. 2(1):1980;122-128.
4. Baik J. Random vicious walks and random matrices. Comm. Pure Appl. Math. 53(11):2000;1385-1410.
5. N. Bonichon, A bijection between realizers of maximal plane graphs and pairs of non-crossing dyck paths, in: Proc. FPSAC'02, Melbourne, Australia, 2002, pp. 123-132.
6. N. Bonichon, B. Le Saëc, M. Mosbah, Optimal area algorithm for planar polyline drawings, in: Graph-Theoretic Concepts in Computer Science (WG 2002), Lecture Notes in Computer Science, Vol. 2573, 2002, pp. 35-46.
7. N. Bonichon, B. Le Saëc, M. Mosbah, Wagner's theorem on realizers, in: Internat. Coll. Automata, Languages and Programming 2002 (ICALP'02), Lecture Notes in Computer Science, Vol. 2380, 2002, pp. 1043-1053.
8. Brak R., Essam J.W. Return polynomials for non-intersecting paths above a surface on a directed square lattice. J. Phys. A - Math. Gen. 34:2001;10763-10782.
9. E. Brehm, 3-Orientations and Schnyder 3-tree-decompositions, Ph.D. Thesis, FB Mathematik und Informatik, Freie Universität Berlin, 2000.
10. De Bruijn N.G., Knuth D.E., Rice S.O. The average height of planted plane trees. Read R.C. Graph Theory and Computing. 1972;15-22 Academic Press, New York.
11. Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I LU, Orderly spanning trees with applications to graph encoding and graph drawing, in: Proc. 12th Symp. Discrete Algorithms, ACM and SIAM, 2001, pp. 506-515.
12. Delest M.P., Viennot G. Algebraic languages and polyominoes enumeration. Theoret. Comput. Sci. 34:1984;169-206.
13. A. Denise, Génération aléatoire et uniforme de mots, in: Proc. FPSAC'93, Florence, Italy, 1993, pp. 153-164.
14. A. Denise, Enumération et génération aléatoire de chemins, in: Proc. FPSAC'94, 1994, pp. 91-97.
15. Denise A. Génération aléatoire et uniforme de mots. Discrete Math. 153:1996;69-84.
16. Denise A. Génération aléatoire uniforme de mots de langages rationnels. Theoret. Comput. Sci. 159:1996;43-63.
17. Desainte-Catherine M. A honeycomb graph perfect matchings enumeration. J. Math. Chem. 13:1993;133-143.
18. M. Desainte-Catherine, G. Viennot, Enumeration of certain Young tableaux with bounded height, in: G. Labelle, P. Leroux (Eds.), Combinatoire Énumérative, Montreal, Springer, 1986, pp. 58-67.
19. Devroye L. Non-uniform Random Variate Generation. 1986;Springer, Berlin.
20. Dulucq S., Guibert O. Stack words, standard tableaux and Baxter permutations. Discrete Math. 157:1996;91-106.
21. Dulucq S., Guibert O. Baxter permutations. Discrete Math. 180:1998;139-150.
22. Essam J.W., Guttmann A.J. Vicious walkers and directed polymer networks in general dimensions. Phys. Rev. E. 52:1995;5849-5862.
23. Fisher M.E. Walks, walls, wetting, and melting. J. Statist. Phys. 34:1984;667-729.
24. de Fraysseix H., de Mendez P.O. On topological aspects of orientations. Discrete Math. 229(1-3):2001;57-72.
25. Gilbert E.N. Gray codes and paths on the n-cube. Bell Systems Tech. J. 37:1958;815-826.
26. D. Gouyou-Beauchamps, Chemins sous-diagonaux et tableaux de Young, in: Colloque de Combinatoire Enumérative, Montréal, UQAM 1985, Lecture Notes in Mathematics, Vol. 1234, 1986, pp. 112-125.
27. Gouyou-Beauchamps D. Standard Young tableaux of height 4 and 5. European J. Combin. 10:1989;69-82.
28. T. Granlund, The GNU Multiple Precision arithmetic library, http://www.gnu.org/manual/gmp/ps/gmp.ps.gz, 1996.
29. Krattenthaler C. Another involution principle-free bijective proof of stanley's hook-content formula. J. Combin. Theory Ser. A. 88:1999;66-92.
30. Krattenthaler C., Guttmann A.J., Viennot X.G. Vicious walkers, friendly walkers and Young tableaux ii. with a walls J. Phys. A: Math. Gen. 33:2000;8123-8135.
31. Chien-Chi Lioa, Ching-Chi Lin, Hsu-Chun Yen, Floor-planning via orderly spanning trees, in: Proc. 9th Internat. Symp. on Graph Drawing (GD 2001), September 23-26 2001, Vienna, Austria, Lecture Notes in Computer Science, Vol. 2265, Springer, Berlin, 2002, pp. 367-377.
32. P.O. Mendez, Orientations bipolaires, Ph.D. Thesis, Ecole des Hautes Etudes en Sciences Sociales, 1994.
33. J.G. Penaud, O. Roques, Tirage à pile ou face de mots de Fibonacci, Publications du LaCIM, 27, 2000.
34. Schnyder W. Planar graphs and poset dimension. Order. 5:1989;323-343.
35. G. Viennot, A bijective proof for the number of Baxter permutations, in: Séminaire Lotharingien de Combinatoire, Le Klebach (1981), 1981.
36. Wilf H.S. A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects. Adv. in Math. 24:1977;281-291.
37. D. Wilson, Determinant algorithms for random planar structures, in: Proc. 18th Symp., Discrete Algorithms, ACM and SIAM, 1997, pp. 258-267.