论文信息 - Pattern occurrences in random planar maps

Pattern occurrences in random planar maps

We consider planar maps adjusted with a (regular critical) Boltzmann distribution and show that the expected number of pattern occurrences of a given map is asymptotically linear when the number n of edges goes to infinity. The main ingredient for the proof is an extension of a formula by Liskovets (1999).

Michael Drmota | Benedikt Stufler | M. Drmota | Benedikt Stufler

[1] Nicolas Bourbaki,et al. Eléments de Mathématique , 1964 .

[2] Michael Drmota,et al. A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps , 2013, Algorithmica.

[3] Lukas Daniel Klausner,et al. Limit laws of planar maps with prescribed vertex degrees , 2019, Comb. Probab. Comput..

[4] Lukas Daniel Klausner,et al. Vertex Degrees in Planar Maps , 2016, 1605.04206.

[5] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .

[6] Valery A. Liskovets,et al. A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps , 1999, J. Comb. Theory, Ser. B.

[7] Nicholas C. Wormald,et al. Asymptotic normality determined by high moments, and submap counts of random maps , 2004 .

[8] Maxim Krikun,et al. Local structure of random quadrangulations , 2005, math/0512304.

[9] Omer Angel,et al. Uniform Infinite Planar Triangulations , 2002 .

[10] Robin Stephenson,et al. Local Convergence of Large Critical Multi-type Galton–Watson Trees and Applications to Random Maps , 2014, 1412.6911.

[11] Nicolas Curien,et al. A view from infinity of the uniform infinite planar quadrangulation , 2012, 1201.1052.

[12] Jakob E. Bjornberg,et al. Recurrence of bipartite planar maps , 2013, 1311.0178.

[13] Laurent M'enard,et al. Percolation on uniform infinite planar maps , 2013, 1302.2851.

[14] M. Drmota. Random Trees: An Interplay between Combinatorics and Probability , 2009 .