Expected number of pattern and submap occurrences in random planar maps
From MaRDI portal
Publication:6340677
arXiv2005.06820MaRDI QIDQ6340677FDOQ6340677
Authors: G.-R. Yu 
Publication date: 14 May 2020
Abstract: Drmota and Stufler proved recently that the expected number of pattern occurrences of a given map is asymptotically linear when the number of edges goes to infinity. In this paper we improve their result by means of a different method. Our method allows us to develop a systematic way for computing the explicit constant of the linear (main) term and shows that it is a positive rational number. Moreover, by extending our method, we also solve the corresponding problem of submap occurrences.
Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)
This page was built for publication: Expected number of pattern and submap occurrences in random planar maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6340677)
