Abstract
We study the statistics of edges and vertices in the vicinity of a reference vertex (origin) within random planar quadrangulations and Eulerian triangulations. Exact generating functions are obtained for theses graphs with fixed numbers of edges and vertices at given geodesic distances from the origin. Our analysis relies on bijections with labeled trees, in which the labels encode the information on the geodesic distance from the origin. In the case of infinitely large graphs, we give in particular explicit formulas for the probabilities that the origin have given numbers of neighboring edges and/or vertices, as well as explicit values for the corresponding moments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
