Skip to main content Accessibility help
×
Home

Graph limits of random unlabelled k-trees

  • Emma Yu Jin (a1) and Benedikt Stufler (a2)

Abstract

We study random unlabelled k-trees by combining the colouring approach by Gainer-Dewar and Gessel (2014) with the cycle-pointing method by Bodirsky, Fusy, Kang and Vigerske (2011). Our main applications are Gromov–Hausdorff–Prokhorov and Benjamini–Schramm limits that describe their asymptotic geometric shape on a global and local scale as the number of (k + 1) -cliques tends to infinity.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Graph limits of random unlabelled k-trees
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Graph limits of random unlabelled k-trees
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Graph limits of random unlabelled k-trees
      Available formats
      ×

Copyright

This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.

Corresponding author

*Corresponding author. Email: yu.jin@univie.ac.at

Footnotes

Hide All

The first author was supported by FWF-MOST (Austrian–Taiwanese) project I 2309-N35 and FWF Project P 32305.

The second author gratefully acknowledges support by the German Research Foundation DFG, STU 679/1-1 and the Swiss National Science Foundation grant number 200020_172515.

Footnotes

References

Hide All
[1]Aldous, D. (1991) The continuum random tree, II: An overview. In Stochastic Analysis (Durham, 1990), Vol. 167 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 2370.
[2]Beineke, L. W. and Pippert, R. E. (1969) The number of labeled k-dimensional trees. J. Combin. Theory 6 200205.
[3]Bell, J. P., Burris, S. N. and Yeats, K. A. (2006) Counting rooted trees: The universal law t(n) ∼ nn −3/2. Electron. J. Combin. 13 R63.
[4]Bergeron, F., Labelle, G. and Leroux, P. (1998) Combinatorial Species and Tree-Like Structures, Vol. 67 of Encyclopedia of Mathematics and its Applications, Cambridge University Press.
[5]Bodirsky, M., Fusy, É., Kang, M. and Vigerske, S. (2011) Boltzmann samplers, Pólya theory, and cycle pointing. SIAM J. Comput. 40 721769.
[6]Darrasse, A. and Soria, M. (2009) Limiting distribution for distances in k-trees. In Combinatorial Algorithms (IWOCA 2009) (Fiala, J.et al., eds), Vol. 5874 of Lecture Notes in Computer Science, Springer, pp. 170182.
[7]Drmota, M. and Jin, E. Y. (2014) An asymptotic analysis of labeled and unlabeled k-trees. Algorithmica 75 579605.
[8]Drmota, M., Jin, E. Y. and Stufler, B. (2019) Graph limits of random graphs from a subset of connected k-trees. Random Struct. Alg. 55 125558.
[9]Durrett, R. T. and Iglehart, D. L. (1977) Functionals of Brownian meander and Brownian excursion. Ann. Probab. 5 130135.
[10]Flajolet, P. and Sedgewick, R. (2010) Analytic Combinatorics, Cambridge University Press.
[11]Foata, D. (1971) Enumerating k -trees. Discrete Math. 1 181186.
[12]Fowler, T., Gessel, I., Labelle, G. and Leroux, P. (2002) The specification of 2-trees. Adv. Appl. Math. 28 145168.
[13]Gainer-Dewar, A. (2012) Γ-species and the enumeration of k -trees. Electron. J. Combin. 19 P45.
[14]Gainer-Dewar, A. and Gessel, I. M. (2014) Counting unlabeled k -trees. J. Combin. Theory Ser. A 126 177193.
[15]Harary, F. and Palmer, E. M. (1968) On acyclic simplicial complexes. Mathematika 15 115122.
[16]Harary, F. and Palmer, E. M. (1973) Graphical Enumeration, Academic Press.
[17]Iriza, A. D. (2015) Enumeration and random generation of unlabeled classes of graphs: A practical study of cycle-pointing and the dissymmetry theorem. Master’s thesis, Princeton University.
[18]Joyal, A. (1981) Une théorie combinatoire des séries formelles. Adv. Math. 42 182.
[19]Miermont, G. (2009) Tessellations of random maps of arbitrary genus. Ann. Sci. Éc. Norm. Supér. 42 725781.
[20]Moon, J. W. (1969) The number of labeled k -trees. J. Combin. Theory Ser. A 6 196199.
[21]Otter, R. (1948) The number of trees. Ann. of Math. (2) 49 583599.
[22]Pólya, G. (1937) Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math. 68 145254.
[23]Stufler, B. (2016) Limits of random tree-like discrete structures. arXiv:1612.02580
[24]Stufler, B. (2017) Asymptotic properties of random unlabelled block-weighted graphs. arXiv:1712.01301
[25]Stufler, B. (2017) Scaling limits of random outerplanar maps with independent link-weights. Ann. Inst. H. Poincaré Probab. Statist. 53 900915.
[26]Stufler, B. (2018) Gibbs partitions: The convergent case. Random Struct. Alg. 53 537558.
[27]Stufler, B. (2018) Random enriched trees with applications to random graphs. Electron. J. Combin. 25 P3.11.
[28]Stufler, B. (2019) The continuum random tree is the scaling limit of unlabelled unrooted trees. Random Struct. Alg. 55 496528.
[29]Stufler, B. (2020) Unlabelled Gibbs partitions. Combin. Probab. Comput. 29 293309.

MSC classification

Graph limits of random unlabelled k-trees

  • Emma Yu Jin (a1) and Benedikt Stufler (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.