Home | Current | Past volumes | About | Login | Notify | Contact | Search
 Probability Surveys > Vol. 17 (2020) open journal systems 


Limits of random tree-like discrete structures

Benedikt Stufler, University of Munich


Abstract
Many random recursive discrete structures may be described by a single generic model. Adopting this perspective allows us to elegantly prove limits for these structures as instances of general underlying principles, and describe their phase diagrams using a unified terminology.
We illustrate this by a selection of examples. We consider random outerplanar maps sampled according to arbitrary weights assigned to their inner faces, and classify in complete generality distributional limits for both the asymptotic local behaviour near the root-edge and near a uniformly at random drawn vertex. We consider random connected graphs drawn according to weights assigned to their blocks and establish a local weak limit. We also apply our framework to recover in a probabilistic way a central limit theorem for the size of the largest 2-connected component in random graphs from planar-like classes. We prove local convergence of random k-dimensional trees and establish both scaling limits and local weak limits for random planar maps drawn according to Boltzmann-weights assigned to their 2-connected components.

AMS 2000 subject classifications: Primary 60C05; secondary 05C80.

Keywords: Random graphs, local convergence, tree-like structures, branching processes, scaling limits.

Creative Common LOGO

Full Text: PDF


Stufler, Benedikt, Limits of random tree-like discrete structures, Probability Surveys, 17, (2020), 318-477 (electronic). DOI: 10.1214/19-PS338.

References

[1]    Romain Abraham and Jean-François Delmas. Local limits of conditioned Galton-Watson trees: the condensation case. Electron. J. Probab., 19:no. 56, 29, 2014. MR3227065

[2]    Romain Abraham and Jean-François Delmas. Local limits of conditioned Galton-Watson trees: the infinite spine case. Electron. J. Probab., 19:no. 2, 19, 2014. MR3164755

[3]    L. Addario-Berry and Y. Wen. Joint convergence of random quadrangulations and their cores. ArXiv e-prints, March 2015. MR3729639

[4]    Louigi Addario-Berry. Growing random 3-connected maps. Electron. Commun. Probab., 19:no. 54, 12, 2014. MR3254733

[5]    Louigi Addario-Berry. A probabilistic approach to block sizes in random maps. ArXiv e-prints, March 2015. MR3903022

[6]    Louigi Addario-Berry, Luc Devroye, and Svante Janson. Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees. Ann. Probab., 41(2):1072–1087, 2013. MR3077536

[7]    David Aldous. Asymptotic fringe distributions for general families of random trees. Ann. Appl. Probab., 1(2):228–266, 1991. MR1102319

[8]    David Aldous. The continuum random tree. I. Ann. Probab., 19(1):1–28, 1991. MR1085326

[9]    David Aldous. The continuum random tree. II. An overview. In Stochastic analysis (Durham, 1990), volume 167 of London Math. Soc. Lecture Note Ser., pages 23–70. Cambridge Univ. Press, Cambridge, 1991. MR1166406

[10]    David Aldous. The continuum random tree. III. Ann. Probab., 21(1):248–289, 1993. MR1207226

[11]    David Aldous and Jim Pitman. Tree-valued Markov chains derived from Galton-Watson processes. Ann. Inst. H. Poincaré Probab. Statist., 34(5):637–686, 1998. MR1641670

[12]    J. Ambjørn and T. G. Budd. Trees and spatial topology change in causal dynamical triangulations. J. Phys. A, 46(31):315201, 33, 2013. MR3090757

[13]     Omer Angel and Oded Schramm. Uniform infinite planar triangulations. Comm. Math. Phys., 241(2-3):191–213, 2003. MR2013797

[14]    Stefan Arnborg and Andrzej Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math., 23(1):11–24, 1989. MR0985145

[15]    Richard Arratia, A. D. Barbour, and Simon Tavaré. Logarithmic combinatorial structures: a probabilistic approach. EMS Monographs in Mathematics. European Mathematical Society (EMS), Zürich, 2003. MR2032426

[16]    Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, and Michèle Soria. Random maps, coalescing saddles, singularity analysis, and Airy phenomena. Random Structures Algorithms, 19(3-4):194–246, 2001. Analysis of algorithms (Krynica Morska, 2000). MR1871555

[17]    A. D. Barbour and Boris L. Granovsky. Random combinatorial structures: the convergent case. J. Combin. Theory Ser. A, 109(2):203–220, 2005. MR2121024

[18]    E. Baur, G. Miermont, and G. Ray. Classification of scaling limits of uniform quadrangulations with a boundary. ArXiv e-prints, August 2016. MR4038036

[19]     L. W. Beineke and R. E. Pippert. The number of labeled k-dimensional trees. J. Combinatorial Theory, 6:200–205, 1969. MR0234868

[20]    Jason P. Bell. When structures are almost surely connected. Electron. J. Combin., 7:Research Paper 36, 7 pp. (electronic), 2000. MR1771616

[21]    Itai Benjamini, Harry Kesten, Yuval Peres, and Oded Schramm. Geometry of the uniform spanning forest: transitions in dimensions 4,8,12,. Ann. of Math. (2), 160(2):465–491, 2004. MR2123930

[22]    Itai Benjamini, Russell Lyons, Yuval Peres, and Oded Schramm. Uniform spanning forests. Ann. Probab., 29(1):1–65, 2001. MR1825141

[23]    Itai Benjamini and Oded Schramm. Recurrence of distributional limits of finite planar graphs. Electron. J. Probab., 6:no. 23, 13 pp. (electronic), 2001. MR1873300

[24]    François Bergeron, Gilbert Labelle, and Pierre Leroux. Combinatorial species and tree-like structures, volume 67 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 1998. Translated from the 1994 French original by Margaret Readdy, With a foreword by Gian-Carlo Rota. MR1629341

[25]    Olivier Bernardi, Marc Noy, and Dominic Welsh. Growth constants of minor-closed classes of graphs. J. Combin. Theory Ser. B, 100(5):468–484, 2010. MR2644234

[26]    Nicla Bernasconi, Konstantinos Panagiotou, and Angelika Steger. On the degree sequences of random outerplanar and series-parallel graphs. In Approximation, randomization and combinatorial optimization, volume 5171 of Lecture Notes in Comput. Sci., pages 303–316. Springer, Berlin, 2008. MR2538796

[27]    Nicla Bernasconi, Konstantinos Panagiotou, and Angelika Steger. The degree sequence of random graphs from subcritical classes. Combin. Probab. Comput., 18(5):647–681, 2009. MR2534261

[28]    Nicla Bernasconi, Konstantinos Panagiotou, and Angelika Steger. On properties of random dissections and triangulations. Combinatorica, 30(6):627–654, 2010. MR2789731

[29]    Patrick Billingsley. Weak convergence of measures: Applications in probability. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1971. Conference Board of the Mathematical Sciences Regional Conference Series in Applied Mathematics, No. 5. MR0310933

[30]    Jakob E. Björnberg and Sigurdur Ö. Stefánsson. Recurrence of bipartite planar maps. Electron. J. Probab., 19:no. 31, 40, 2014. MR3183575

[31]    Jakob E. Björnberg and Sigurdur Örn Stefánsson. Random walk on random infinite looptrees. J. Stat. Phys., 158(6):1234–1261, 2015. MR3317412

[32]    Manuel Bodirsky, Éric Fusy, Mihyun Kang, and Stefan Vigerske. Enumeration and asymptotic properties of unlabeled outerplanar graphs. Electron. J. Combin., 14(1):Research Paper 66, 24, 2007. MR2350456

[33]    Manuel Bodirsky, Éric Fusy, Mihyun Kang, and Stefan Vigerske. Boltzmann samplers, Pólya theory, and cycle pointing. SIAM J. Comput., 40(3):721–769, 2011. MR2810913

[34]    Nicolas Bonichon, Cyril Gavoille, and Nicolas Hanusse. Canonical decomposition of outerplanar maps and application to enumeration, coding and generation. J. Graph Algorithms Appl., 9(2):185–204 (electronic), 2005. MR2185278

[35]    N. Bourbaki. Éléments de mathématique. Fasc. XXXV. Livre VI: Intégration. Chapitre IX: Intégration sur les espaces topologiques séparés. Actualités Scientifiques et Industrielles, No. 1343. Hermann, Paris, 1969. MR0276436

[36]    J. Bouttier, P. Di Francesco, and E. Guitter. Planar maps as labeled mobiles. Electron. J. Combin., 11(1):Research Paper 69, 27, 2004. MR2097335

[37]    Dmitri Burago, Yuri Burago, and Sergei Ivanov. A course in metric geometry, volume 33 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2001. MR1835418

[38]    Alessandra Caraceni. The scaling limit of random outerplanar maps. Ann. Inst. H. Poincaré Probab. Statist., 52(4):1667–1686, 11 2016. MR3573291

[39]    Philippe Chassaing and Bergfinnur Durhuus. Local limit of labeled trees and expected volume growth in a random quadrangulation. Ann. Probab., 34(3):879–917, 2006. MR2243873

[40]    J. Chover, P. Ney, and S. Wainger. Functions of probability measures. J. Analyse Math., 26:255–302, 1973. MR0348393

[41]    Robert Cori and Bernard Vauquelin. Planar maps are well labeled trees. Canad. J. Math., 33(5):1023–1042, 1981. MR0638363

[42]    N. Curien, L. Ménard, and G. Miermont. A view from infinity of the uniform infinite planar quadrangulation. ALEA Lat. Am. J. Probab. Math. Stat., 10(1):45–88, 2013. MR3083919

[43]    Nicolas Curien. Notes provisoires du cours de m2 graphes aléatoires. 2016.

[44]    Nicolas Curien, Bénédicte Haas, and Igor Kortchemski. The CRT is the scaling limit of random dissections. Random Structures Algorithms, 47(2):304–327, 2015. MR3382675

[45]    Nicolas Curien and Igor Kortchemski. Random non-crossing plane configurations: a conditioned Galton-Watson tree approach. Random Structures Algorithms, 45(2):236–260, 2014. MR3245291

[46]    Nicolas Curien and Igor Kortchemski. Random non-crossing plane configurations: a conditioned Galton-Watson tree approach. Random Struct. Algorithms, 45(2):236–260, 2014. MR3245291

[47]    Alexis Darrasse and Michèle Soria. Limiting distribution for distances in k-trees. In Combinatorial algorithms, volume 5874 of Lecture Notes in Comput. Sci., pages 170–182. Springer, Berlin, 2009. MR2577935

[48]    D. Denisov, A. B. Dieker, and V. Shneer. Large deviations for random walks under subexponentiality: the big-jump domain. Ann. Probab., 36(5):1946–1991, 2008. MR2440928

[49]    Reinhard Diestel. Graph theory, volume 173 of Graduate Texts in Mathematics. Springer, Heidelberg, fourth edition, 2010. MR2744811

[50]    M. Drmota, E. Y. Jin, and B. Stufler. Graph limits of random graphs from a subset of connected k-trees. ArXiv e-prints, May 2016. MR3974195

[51]    Michael Drmota, Éric Fusy, Mihyun Kang, Veronika Kraus, and Juanjo Rué. Asymptotic study of subcritical graph classes. SIAM J. Discrete Math., 25(4):1615–1651, 2011. MR2873207

[52]    Michael Drmota, Omer Giménez, and Marc Noy. Degree distribution in random planar graphs. J. Combin. Theory Ser. A, 118(7):2102–2130, 2011. MR2802191

[53]    Michael Drmota, Emma Yu Jin, and Benedikt Stufler. Graph limits of random graphs from a subset of connected k-trees. Random Structures & Algorithms, 55(1):125–152. MR3974195

[54]    Michael Drmota and Marc Noy. Extremal parameters in sub-critical graph classes. In ANALCO13—Meeting on Analytic Algorithmics and Combinatorics, pages 1–7. SIAM, Philadelphia, PA, 2013. MR3184197

[55]    Michael Drmota, Lander Ramos, and Juanjo Rué. Subgraph statistics in subcritical graph classes. Random Structures & Algorithms, 51(4):631–673, 2017. MR3718593

[56]    Philippe Duchon, Philippe Flajolet, Guy Louchard, and Gilles Schaeffer. Boltzmann samplers for the random generation of combinatorial structures. Combin. Probab. Comput., 13(4-5):577–625, 2004. MR2095975

[57]    Thomas Duquesne. A limit theorem for the contour process of conditioned Galton-Watson trees. Ann. Probab., 31(2):996–1027, 2003. MR1964956

[58]    Thomas Duquesne and Jean-François Le Gall. Probabilistic and fractal aspects of Lévy trees. Probab. Theory Related Fields, 131(4):553–603, 2005. MR2147221

[59]    Rick Durrett. Probability: theory and examples. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge, fourth edition, 2010. MR2722836

[60]    Richard Ehrenborg and Miguel Méndez. Schröder parenthesizations and chordates. J. Combin. Theory Ser. A, 67(2):127–139, 1994. MR1284403

[61]    Julia Ehrenm. Spanning trees in random series-parallel graphs. Advances in Applied Mathematics, 75:18–55, 2016. MR3464094

[62]    P. Embrechts and E. Omey. Functions of power series. Yokohama Math. J., 32(1-2):77–88, 1984. MR0772907

[63]    Michael M. Erlihson and Boris L. Granovsky. Limit shapes of Gibbs distributions on the set of integer partitions: the expansive case. Ann. Inst. Henri Poincaré Probab. Stat., 44(5):915–945, 2008. MR2453776

[64]    William Feller. An introduction to probability theory and its applications. Vol. II. Second edition. John Wiley & Sons, Inc., New York-London-Sydney, 1971. MR0270403

[65]    Philippe Flajolet and Robert Sedgewick. Analytic combinatorics. Cambridge University Press, Cambridge, 2009. MR2483235

[66]    Dominique Foata. Enumerating k-trees. Discrete Math., 1(2):181–186, 1971/72. MR0299535

[67]    Tom Fowler, Ira Gessel, Gilbert Labelle, and Pierre Leroux. The specification of 2-trees. Adv. in Appl. Math., 28(2):145–168, 2002. MR1888841

[68]    Andrew Gainer-Dewar. Γ-species and the enumeration of k-trees. Electron. J. Combin., 19(4):Paper 45, 33, 2012. MR3007180

[69]    A. Georgakopoulos and S. Wagner. Limits of subcritical random graphs and random graphs with excluded minors. ArXiv e-prints, December 2015.

[70]    Omer Giménez and Marc Noy. Asymptotic enumeration and limit laws of planar graphs. J. Amer. Math. Soc., 22(2):309–329, 2009. MR2476775

[71]    Omer Giménez, Marc Noy, and Juanjo Rué. Graph classes with given 3-connected components: asymptotic enumeration and random graphs. Random Structures Algorithms, 42(4):438–479, 2013. MR3068033

[72]    Martin Grötschel and Gyula Katona. Preface. In Building bridges, volume 19 of Bolyai Soc. Math. Stud., pages 7–8. Springer, Berlin, 2008. MR2484635

[73]    Ori Gurel-Gurevich and Asaf Nachmias. Recurrence of planar graph limits. Ann. of Math. (2), 177(2):761–781, 2013. MR3010812

[74]    Bénédicte Haas and Grégory Miermont. Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees. Ann. Probab., 40(6):2589–2666, 2012. MR3050512

[75]    Bénédicte Haas and Robin Stephenson. Scaling limits of k-ary growing trees. Ann. Inst. Henri Poincaré Probab. Stat., 51(4):1314–1341, 2015. MR3414449

[76]    Frank Harary and Edgar M. Palmer. Graphical enumeration. Academic Press, New York-London, 1973. MR0357214

[77]    Tom Hutchcroft and Asaf Nachmias. Uniform spanning forests of planar graphs. Forum Math. Sigma, 7:e29, 55, 2019. MR4010561

[78]    Svante Janson. Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation. Probab. Surv., 9:103–252, 2012. MR2908619

[79]    Svante Janson. Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees. Random Structures Algorithms, 48(1):57–101, 2016. MR3432572

[80]    Svante Janson, Thordur Jonsson, and Sigurdur Örn Stefánsson. Random trees with superexponential branching weights. J. Phys. A, 44(48):485002, 16, 2011. MR2860856

[81]    Svante Janson and Sigurdur Örn Stefánsson. Scaling limits of random planar maps with a unique large face. Ann. Probab., 43(3):1045–1081, 2015. MR3342658

[82]    Thordur Jonsson and Sigurdur Örn Stefánsson. Condensation in nongeneric trees. J. Stat. Phys., 142(2):277–313, 2011. MR2764126

[83]    André Joyal. Une théorie combinatoire des séries formelles. Adv. in Math., 42(1):1–82, 1981. MR0633783

[84]    Olav Kallenberg. Foundations of modern probability. Probability and its Applications (New York). Springer-Verlag, New York, second edition, 2002. MR1876169

[85]    Douglas P. Kennedy. The Galton-Watson process conditioned on the total progeny. J. Appl. Probability, 12(4):800–806, 1975. MR0386042

[86]    Götz Kersting. On the height profile of a conditioned galton-watson tree, 2011.

[87]    Igor Kortchemski. Invariance principles for Galton-Watson trees conditioned on the number of leaves. Stochastic Process. Appl., 122(9):3126–3172, 2012. MR2946438

[88]    Igor Kortchemski. A simple proof of Duquesne’s theorem on contour processes of conditioned Galton-Watson trees. In Séminaire de Probabilités XLV, volume 2078 of Lecture Notes in Math., pages 537–558. Springer, Cham, 2013. MR3185928

[89]    Igor Kortchemski. Random stable laminations of the disk. Ann. Probab., 42(2):725–759, 2014. MR3178472

[90]    Igor Kortchemski. Limit theorems for conditioned ot non-generic Galton-Watson trees. Ann. Inst. Henri Poincaré Probab. Stat., 51(2):489–511, 2015. MR3335012

[91]    Igor Kortchemski. Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees. Probab. Theory Related Fields, 168(1-2):1–40, 2017. MR3651047

[92]    V. Kurauskas. On local weak limit and subgraph counts for sparse random graphs. ArXiv e-prints, April 2015.

[93]    Gilbert Labelle. Une nouvelle démonstration combinatoire des formules d’inversion de Lagrange. Adv. in Math., 42(3):217–247, 1981. MR0642392

[94]    Jacques Labelle. Applications diverses de la théorie combinatoire des espèces de structures. Ann. Sci. Math. Québec, 7(1):59–94, 1983. MR0699986

[95]    Jean-François Le Gall. The topological structure of scaling limits of large planar maps. Invent. Math., 169(3):621–670, 2007. MR2336042

[96]    Jean-François Le Gall. Uniqueness and universality of the Brownian map. Ann. Probab., 41(4):2880–2960, 2013. MR3112934

[97]    Jean-François Le Gall and Grégory Miermont. Scaling limits of random planar maps with large faces. Ann. Probab., 39(1):1–69, 2011. MR2778796

[98]    Jean-François Le Gall and Grégory Miermont. Scaling limits of random trees and planar maps. In Probability and statistical physics in two and more dimensions, volume 15 of Clay Math. Proc., pages 155–211. Amer. Math. Soc., Providence, RI, 2012. MR3025391

[99]    Malwina Luczak and Peter Winkler. Building uniformly random subtrees. Random Structures Algorithms, 24(4):420–443, 2004. MR2060629

[100]    Russell Lyons. A bird’s-eye view of uniform spanning trees and forests. In Microsurveys in discrete probability (Princeton, NJ, 1997), volume 41 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 135–162. Amer. Math. Soc., Providence, RI, 1998. MR1630412

[101]    Russell Lyons. Asymptotic enumeration of spanning trees. Combin. Probab. Comput., 14(4):491–522, 2005. MR2160416

[102]    Russell Lyons, Benjamin J. Morris, and Oded Schramm. Ends in uniform spanning forests. Electron. J. Probab., 13:no. 58, 1702–1725, 2008. MR2448128

[103]    Colin McDiarmid. Random graphs from a minor-closed class. Combin. Probab. Comput., 18(4):583–599, 2009. MR2507738

[104]    Colin McDiarmid and Alex Scott. Random graphs from a block-stable class. European J. Combin., 58:96–106, 2016. MR3530623

[105]    Laurent Ménard and Pierre Nolin. Percolation on uniform infinite planar maps. Electron. J. Probab., 19:no. 79, 27, 2014. MR3256879

[106]    Grégory Miermont. The Brownian map is the scaling limit of uniform random plane quadrangulations. Acta Math., 210(2):319–401, 2013. MR3070569

[107]    Bojan Mohar and Carsten Thomassen. Graphs on surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD, 2001. MR1844449

[108]    J. W. Moon. The number of labeled k-trees. J. Combinatorial Theory, 6:196–199, 1969. MR0237382

[109]    Marc Noy. Random planar graphs and beyond. Proc. ICM, 2014. MR3727618

[110]    Konstantinos Panagiotou and Angelika Steger. Maximal biconnected subgraphs of random planar graphs. ACM Trans. Algorithms, 6(2):Art. 31, 21, 2010. MR2675698

[111]    Konstantinos Panagiotou and Angelika Steger. On the degree distribution of random planar graphs. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1198–1210. SIAM, Philadelphia, PA, 2011. MR2858393

[112]    Konstantinos Panagiotou, Benedikt Stufler, and Kerstin Weller. Scaling limits of random graphs from subcritical classes. Ann. Probab., 44(5):3291–3334, 2016. MR3551197

[113]    Robin Pemantle. Choosing a spanning tree for the integer lattice uniformly. Ann. Probab., 19(4):1559–1574, 1991. MR1127715

[114]    Yuval Peres and David Revelle. Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs, 2004.

[115]    Jim Pitman. Combinatorial stochastic processes, volume 1875 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 2006. Lectures from the 32nd Summer School on Probability Theory held in Saint-Flour, July 7–24, 2002, With a foreword by Jean Picard. MR2245368

[116]    Douglas Rizzolo. Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set. Ann. Inst. Henri Poincaré Probab. Stat., 51(2):512–532, 2015. MR3335013

[117]    Robert W. Robinson. Enumeration of non-separable graphs. J. Combinatorial Theory, 9:327–356, 1970. MR0284380

[118]    Gilles Schaeffer. Conjugaison d’arbres et cartes combinatoires aléatoires. PhD thesis Université de Boredaux 1, 1998.

[119]    Robin Stephenson. Local convergence of large critical multi-type galton–watson trees and applications to random maps. Journal of Theoretical Probability, pages 1–47, 2016. MR3769811

[120]    Benedikt Stufler. Scaling limits of random outerplanar maps with independent link-weights. Ann. Inst. Henri Poincaré Probab. Stat., 53(2):900–915, 2017. MR3634279

[121]    Benedikt Stufler. Gibbs partitions: The convergent case. Random Structures & Algorithms, 53(3):537–558, 2018. MR3854044

[122]    Benedikt Stufler. Random enriched trees with applications to random graphs. Electronic Journal of Combinatorics, 25(3), 2018. MR3853863

[123]    Benedikt Stufler. Local convergence of random planar graphs. arXiv e-prints, arXiv:1908.04850, Aug 2019.

[124]    Benedikt Stufler. Local limits of large Galton-Watson trees rerooted at a random vertex. Ann. Inst. Henri Poincaré, Probab. Stat., 55(1):155–183, 2019. MR3901644

[125]    Lajos Takács. A generalization of the ballot problem and its application in the theory of queues. J. Amer. Statist. Assoc., 57:327–337, 1962. MR0138139

[126]    E. M. Wright. A relationship between two sequences. III. J. London Math. Soc., 43:720–724, 1968. MR0229546




Home | Current | Past volumes | About | Login | Notify | Contact | Search

Probability Surveys. ISSN: 1549-5787