Testing for high-dimensional geometry in random graphs

We study the problem of detecting the presence of an underlying high‐dimensional geometric structure in a random graph. Under the null hypothesis, the observed graph is a realization of an Erdős‐Rényi random graph G(n, p). Under the alternative, the graph is generated from the G(n,p,d) model, where...

Celý popis

Podrobná bibliografia

Vydané v:	Random structures & algorithms Ročník 49; číslo 3; s. 503 - 532
Hlavní autori:	Bubeck, Sébastien, Ding, Jian, Eldan, Ronen, Rácz, Miklós Z.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Blackwell Publishing Ltd 01.10.2016 Wiley Subscription Services, Inc
Predmet:	Boundaries Computational efficiency Constants Graphs high-dimensional geometric structure hypothesis testing Mathematical analysis Null hypothesis Optimization random geometric graphs random graphs signed triangles Vectors (mathematics)
ISSN:	1042-9832, 1098-2418
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!