Premium
Uniform random colored complexes
Author(s) -
Carrance Ariane
Publication year - 2019
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.20845
Subject(s) - colored , bipartite graph , combinatorics , mathematics , genus , central limit theorem , limit (mathematics) , enhanced data rates for gsm evolution , random graph , discrete mathematics , computer science , graph , materials science , statistics , mathematical analysis , telecommunications , botany , composite material , biology
We present here random distributions on ( D + 1)‐edge‐colored, bipartite graphs with a fixed number of vertices 2 p . These graphs encode D ‐dimensional orientable colored complexes. We investigate the behavior of those graphs as p → ∞ . The techniques involved in this study also yield a Central Limit Theorem for the genus of a uniform map of order p , as p → ∞ .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom