Uniform random colored complexes

Ariane Carrance

doi:10.1002/rsa.20845

Uniform random colored complexes

Ariane Carrance

Institut Camille Jordan

Research output: Contribution to journal › Article › peer-review

Abstract

We present here random distributions on (D + 1)-edge-colored, bipartite graphs with a fixed number of vertices 2p. 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→∞.

Original language	English
Pages (from-to)	615-648
Number of pages	34
Journal	Random Structures and Algorithms
Volume	55
Issue number	3
DOIs	https://doi.org/10.1002/rsa.20845
Publication status	Published - 1 Jan 2019
Externally published	Yes

Keywords

crumpled phase
edge-colored graphs
limit distributions
random complexes
random graphs
random permutations

Access to Document

10.1002/rsa.20845

Cite this

@article{cb7a88db3e314a1c9ae03612015780fe,

title = "Uniform random colored complexes",

abstract = "We present here random distributions on (D + 1)-edge-colored, bipartite graphs with a fixed number of vertices 2p. 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→∞.",

keywords = "crumpled phase, edge-colored graphs, limit distributions, random complexes, random graphs, random permutations",

author = "Ariane Carrance",

note = "Publisher Copyright: {\textcopyright} 2019 Wiley Periodicals, Inc.",

year = "2019",

month = jan,

day = "1",

doi = "10.1002/rsa.20845",

language = "English",

volume = "55",

pages = "615--648",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

number = "3",

}

TY - JOUR

T1 - Uniform random colored complexes

AU - Carrance, Ariane

PY - 2019/1/1

Y1 - 2019/1/1

N2 - We present here random distributions on (D + 1)-edge-colored, bipartite graphs with a fixed number of vertices 2p. 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→∞.

AB - We present here random distributions on (D + 1)-edge-colored, bipartite graphs with a fixed number of vertices 2p. 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→∞.

KW - crumpled phase

KW - edge-colored graphs

KW - limit distributions

KW - random complexes

KW - random graphs

KW - random permutations

U2 - 10.1002/rsa.20845

DO - 10.1002/rsa.20845

M3 - Article

AN - SCOPUS:85062783763

SN - 1042-9832

VL - 55

SP - 615

EP - 648

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 3

ER -

Uniform random colored complexes

Abstract

Keywords

Access to Document

Fingerprint

Cite this