NDLI: Finding Planted Partitions in Random Graphs with General Degree Distributions

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Coja-Oghlan, Amin Lanka, Andr
Copyright Year	2009
Abstract	We consider the problem of recovering a planted partition such as a coloring, a small bisection, or a large cut in an (apart from that) random graph. In the last 30 years many algorithms for this problem have been developed that work provably well on various random graph models resembling the ErdsRnyi model $G_{n,m}$. In these random graph models edges are distributed uniformly, and thus the degree distribution is very regular. By contrast, the recent theory of large networks shows that real-world networks frequently have a significantly different distribution of the edges and hence also a different degree distribution. Therefore, a variety of new types of random graphs have been introduced to capture these specific properties. One of the most popular models is characterized by a prescribed expected degree sequence. We study a natural variant of this model that features a planted partition. Our main result is that there is a polynomial time algorithm for recovering (a large part of) the planted partition in this model even in the sparse case, where the average degree is constant. In contrast to prior work, the input of the algorithm consists only of the graph, i.e., no further parameters of the model (such as the expected degree sequence) are revealed to the algorithm.
Starting Page	1682
Ending Page	1714
Page Count	33
File Format	PDF
ISSN	08954801
DOI	10.1137/070699354
e-ISSN	10957146
Journal	SIAM Journal on Discrete Mathematics (SJDMEC)
Issue Number	4
Volume Number	23
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2009-11-18
Access Restriction	Subscribed
Subject Keyword	algorithms spectral methods Random graphs partitioning random graphs
Content Type	Text
Resource Type	Article
Subject	Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the Complexity of Random Satisfiability Problems with Planted Solutions

Spectra of Random Graphs with Planted Partitions

Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions

Spectral clustering of graphs with general degrees in the extended planted partition model

Spectral clustering of graphs with general degrees in the extended planted partition model.

Reconstructing many partitions using spectral techniques (2005)

Degree Distributions in General Random Intersection Graphs

Directed random graphs with given degree distributions

Finding planted partitions in nearly linear time using arrested spectral clustering.

Finding Planted Partitions in Random Graphs with General Degree Distributions

Similar Documents

On the Complexity of Random Satisfiability Problems with Planted Solutions

Spectra of Random Graphs with Planted Partitions

Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions

Spectral clustering of graphs with general degrees in the extended planted partition model

Spectral clustering of graphs with general degrees in the extended planted partition model.

Reconstructing many partitions using spectral techniques (2005)

Degree Distributions in General Random Intersection Graphs

Directed random graphs with given degree distributions

Finding planted partitions in nearly linear time using arrested spectral clustering.

Finding Planted Partitions in Random Graphs with General Degree Distributions