Local Limit Theorems for the Giant Component of Random Hypergraphs

Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandForschungBegutachtung

Originalspracheenglisch
TitelApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ErscheinungsortBerlin; Heidelberg
Herausgeber (Verlag)Springer
Seiten341-352
Band4627
ISBN (Print)978-3-540-74207-4
DOIs
PublikationsstatusVeröffentlicht - 2007
VeranstaltungInternational Workshop on Randomization and Computation - Princeton, NJ, USA / Vereinigte Staaten
Dauer: 20 Aug 200722 Aug 2007

Publikationsreihe

NameLecture notes in computer science
Herausgeber (Verlag)Springer

Konferenz

KonferenzInternational Workshop on Randomization and Computation
LandUSA / Vereinigte Staaten
OrtPrinceton, NJ
Zeitraum20/08/0722/08/07

Fields of Expertise

  • Sonstiges

Dies zitieren

Behrisch, M., Coja-Oghlan, A., & Kang, M. (2007). Local Limit Theorems for the Giant Component of Random Hypergraphs. in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Band 4627, S. 341-352). (Lecture notes in computer science). Berlin; Heidelberg: Springer. https://doi.org/10.1007/978-3-540-74208-1_25

Local Limit Theorems for the Giant Component of Random Hypergraphs. / Behrisch, Michael; Coja-Oghlan, Amin; Kang, Mihyun.

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Band 4627 Berlin; Heidelberg : Springer, 2007. S. 341-352 (Lecture notes in computer science).

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandForschungBegutachtung

Behrisch, M, Coja-Oghlan, A & Kang, M 2007, Local Limit Theorems for the Giant Component of Random Hypergraphs. in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Bd. 4627, Lecture notes in computer science, Springer, Berlin; Heidelberg, S. 341-352, Princeton, NJ, USA / Vereinigte Staaten, 20/08/07. https://doi.org/10.1007/978-3-540-74208-1_25
Behrisch M, Coja-Oghlan A, Kang M. Local Limit Theorems for the Giant Component of Random Hypergraphs. in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Band 4627. Berlin; Heidelberg: Springer. 2007. S. 341-352. (Lecture notes in computer science). https://doi.org/10.1007/978-3-540-74208-1_25
Behrisch, Michael ; Coja-Oghlan, Amin ; Kang, Mihyun. / Local Limit Theorems for the Giant Component of Random Hypergraphs. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Band 4627 Berlin; Heidelberg : Springer, 2007. S. 341-352 (Lecture notes in computer science).
@inproceedings{4caa661b9f0e4ede921e0314f5826785,
title = "Local Limit Theorems for the Giant Component of Random Hypergraphs",
author = "Michael Behrisch and Amin Coja-Oghlan and Mihyun Kang",
year = "2007",
doi = "10.1007/978-3-540-74208-1_25",
language = "English",
isbn = "978-3-540-74207-4",
volume = "4627",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "341--352",
booktitle = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques",

}

TY - GEN

T1 - Local Limit Theorems for the Giant Component of Random Hypergraphs

AU - Behrisch, Michael

AU - Coja-Oghlan, Amin

AU - Kang, Mihyun

PY - 2007

Y1 - 2007

U2 - 10.1007/978-3-540-74208-1_25

DO - 10.1007/978-3-540-74208-1_25

M3 - Conference contribution

SN - 978-3-540-74207-4

VL - 4627

T3 - Lecture notes in computer science

SP - 341

EP - 352

BT - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

PB - Springer

CY - Berlin; Heidelberg

ER -