The minimum bisection in the planted bisection model

A. Coja-Oghlan; O. Cooley; M. Kang; K. Skubch

doi:10.4230/LIPIcs.APPROX-RANDOM.2015.710

The minimum bisection in the planted bisection model

A. Coja-Oghlan, O. Cooley, M. Kang, K. Skubch

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Abstract

In the planted bisection model a random graph G(n,p_+,p_-) with n vertices is created by partitioning the vertices randomly into two classes of equal size (up to plus or minus 1). Any two vertices that belong to the same class are linked by an edge with probability p_+ and any two that belong to different classes with probability (p_-) c * sqrt((d_+)ln(d_+)) for a certain constant c>0.

Original language	English
Title of host publication	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Place of Publication	Schloss Dagstuhl
Publisher	Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Pages	710-725
ISBN (Print)	978-3-939897-89-7
DOIs	https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.710
Publication status	Published - 2015

Publication series

Name	Leibniz International Proceedings in Informatics
Volume	40

Fields of Expertise

Information, Communication & Computing

Treatment code (Nähere Zuordnung)

Basic - Fundamental (Grundlagenforschung)

Access to Document

10.4230/LIPIcs.APPROX-RANDOM.2015.710Licence: CC BY 4.0

Cite this

Coja-Oghlan, A., Cooley, O., Kang, M., & Skubch, K. (2015). The minimum bisection in the planted bisection model. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015) (pp. 710-725). (Leibniz International Proceedings in Informatics ; Vol. 40). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.710

The minimum bisection in the planted bisection model. / Coja-Oghlan, A.; Cooley, O.; Kang, M. et al.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Schloss Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. p. 710-725 (Leibniz International Proceedings in Informatics ; Vol. 40).

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Coja-Oghlan, A, Cooley, O , Kang, M & Skubch, K 2015, The minimum bisection in the planted bisection model. in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics , vol. 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Schloss Dagstuhl, pp. 710-725. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.710

Coja-Oghlan A, Cooley O , Kang M, Skubch K. The minimum bisection in the planted bisection model. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Schloss Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2015. p. 710-725. (Leibniz International Proceedings in Informatics ). doi: 10.4230/LIPIcs.APPROX-RANDOM.2015.710

@inproceedings{245202963d6e45ff89532f66b1563352,

title = "The minimum bisection in the planted bisection model",

abstract = "In the planted bisection model a random graph G(n,p_+,p_-) with n vertices is created by partitioning the vertices randomly into two classes of equal size (up to plus or minus 1). Any two vertices that belong to the same class are linked by an edge with probability p_+ and any two that belong to different classes with probability (p_-) c * sqrt((d_+)ln(d_+)) for a certain constant c>0. ",

author = "A. Coja-Oghlan and O. Cooley and M. Kang and K. Skubch",

year = "2015",

doi = "10.4230/LIPIcs.APPROX-RANDOM.2015.710",

language = "English",

isbn = "978-3-939897-89-7",

series = "Leibniz International Proceedings in Informatics ",

publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",

pages = "710--725",

booktitle = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)",

address = "Germany",

}

TY - GEN

T1 - The minimum bisection in the planted bisection model

AU - Coja-Oghlan, A.

AU - Cooley, O.

AU - Kang, M.

AU - Skubch, K.

PY - 2015

Y1 - 2015

N2 - In the planted bisection model a random graph G(n,p_+,p_-) with n vertices is created by partitioning the vertices randomly into two classes of equal size (up to plus or minus 1). Any two vertices that belong to the same class are linked by an edge with probability p_+ and any two that belong to different classes with probability (p_-) c * sqrt((d_+)ln(d_+)) for a certain constant c>0.

AB - In the planted bisection model a random graph G(n,p_+,p_-) with n vertices is created by partitioning the vertices randomly into two classes of equal size (up to plus or minus 1). Any two vertices that belong to the same class are linked by an edge with probability p_+ and any two that belong to different classes with probability (p_-) c * sqrt((d_+)ln(d_+)) for a certain constant c>0.

UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84958530734&partnerID=MN8TOARS

U2 - 10.4230/LIPIcs.APPROX-RANDOM.2015.710

DO - 10.4230/LIPIcs.APPROX-RANDOM.2015.710

M3 - Conference paper

SN - 978-3-939897-89-7

T3 - Leibniz International Proceedings in Informatics

SP - 710

EP - 725

BT - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)

PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik

CY - Schloss Dagstuhl

ER -

The minimum bisection in the planted bisection model

Abstract

Publication series

Fields of Expertise

Treatment code (Nähere Zuordnung)

Access to Document

Other files and links

Fingerprint

Cite this