Local height in weighted Dyck models of random walks and the variability of the number of coalescent histories for caterpillar-shaped gene trees and species trees

Filippo Disanto1, Emanuele Munarini2
1Department of Mathematics, University of Pisa, 56126, Pisa, Italy
2Department of Mathematics, Politecnico di Milano, 20133, Milan, Italy

Tóm tắt

Từ khóa


Tài liệu tham khảo

Banderier C, Bousquet-Melou M, Denise A, Flajolet P, Gardy D, Gouyou-Beauchamps D (2002) Generating functions for generating trees. Discrete Math 246:29–55

Barcucci E, Del Lungo A, Pergola E, Pinzani R (1999) ECO: a methodology for the enumeration of combinatorial objects. J Differ Equ Appl 5:435–490

Brak R, Essam J, Osborn J, Owczarek AL, Rechnitzer A (2006) Lattice paths and the constant term. J Phys Conf Ser 42:47–58

Brlek S, Duchi E, Pergola E, Rinaldi S (2005) On the equivalence problem for succession rules. Discrete Math 298:142–154

Chen WYC, Fan NJY, Jia JYT (2011) Labeled ballot paths and the Springer numbers. SIAM J Discrete Math 25:1530–1546

Degnan JH, Rosenberg NA, Stadler T (2012) The probability distribution of ranked gene trees on a species tree. Math Biosci 235:45–55

Degnan JH, Salter LA (2005) Gene tree distributions under the coalescent process. Evolution 59:24–37

Deutsch E (1999) Dyck path enumeration. Discrete Math 204:167–202

Disanto F, Ferrari L, Pinzani R, Rinaldi S (2010) Catalan pairs: a relational-theoretic approach to Catalan numbers. Adv Appl Math 45:505–517

Disanto F, Rosenberg NA (2015) Coalescent histories for lodgepole species trees. J Comput Biol 22:918–929

Disanto F, Rosenberg NA (2016) Asymptotic properties of the number of matching coalescent histories for caterpillar-like families of species trees. IEEE Trans Comput Biol Bioinform 13:913–925

Flajolet P (1980) Combinatorial aspects of continued fractions. Discrete Math 32:125–161

Flajolet P, Sedgewick R (2009) Analytic combinatorics. Cambridge University Press, Cambridge

Foata D (1982) Combinatoire des identités sur les polynômes de Meixner. Sém Lotharingien Comb 6, article number B06c

Goulden IP, Jackson DM (1983) Combinatorial enumeration. Wiley, Hoboken

Hamdi A, Zeng J (2010) Orthogonal polynomials and operator orderings. J Math Phys 51, article number 043506

Janse van Rensburg EJ (2000) The statistical mechanics of interacting walks, polygons, animals and vesicles. Oxford University Press, Oxford

Kaigh WD (1976) An invariance principle for random walk conditioned by a late return to zero. Ann Probab 4:115–121

Micu M (1993) Continuous Hahn polynomials. J Math Phys 34:1197–1205

Petkovsek M, Wilf HS, Zeilberger D (1996) A = B. A K Peters Ltd., Natick

Rainville ED (1960) Special functions. Macmillan Ltd., Basingstoke

Roblet E, Viennot XG (1996) Théorie combinatoire des T-fractions et approximants de Padé en deux points. Discrete Math 153:271–288

Rosenberg NA (2007) Counting coalescent histories. J Comput Biol 14:360–377

Rosenberg NA, Degnan JH (2010) Coalescent histories for discordant gene trees and species trees. Theor Popul Biol 77:145–151

Salberger O, Korepin V (2018) Fredkin spin chain, in Ludwig Faddeev memorial volume. World Scientific Publishing Co, Singapore, pp 439–458

Sloane NJA (2019) The on-line encyclopedia of integer sequences. http://oeis.org

Stanley RP (1999) Enumerative combinatorics, vol 2. Cambridge University Press, Cambridge

Wilf HS (1994) Generatingfunctionology. Academic Press Inc., Cambridge

Wolfram Research, Inc. (2019) The mathematical functions site. http://functions.wolfram.com/07.23.03.0064.01. Accessed 13 May 2019