Treffer: Algorithmica manuscript No. (will be inserted by the editor) A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps

Title:
Algorithmica manuscript No. (will be inserted by the editor) A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps
Authors:
Michael Drmota Konstantinos
Contributors:
The Pennsylvania State University CiteSeerX Archives
Source:
http://www.dmg.tuwien.ac.at/drmota/algorithmica.pdf.
Collection:
CiteSeerX
Document Type:
Fachzeitschrift text
File Description:
application/pdf
Language:
English
Relation:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.5967; http://www.dmg.tuwien.ac.at/drmota/algorithmica.pdf
Availability:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.5967
http://www.dmg.tuwien.ac.at/drmota/algorithmica.pdf
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number:
edsbas.7976F002
Database:
BASE

Weitere Informationen

We prove that the number of vertices of given degree in (general or 2-connected) random planar maps satisfies a central limit theorem with mean and variance that are asymptotically linear in the number of edges. The proof relies on an analytic version of the quadratic method and singularity analysis of multivariate generating functions.