The Library
Finding planted partitions in random graphs with general degree distributions
Tools
Coja-Oghlan, Amin and Lanka, André (2009) Finding planted partitions in random graphs with general degree distributions. SIAM Journal on Discrete Mathematics, Volume 23 (Number 4). pp. 1682-1714. doi:10.1137/070699354 ISSN 0895-4801.
|
PDF
WRAP_Coja-Oghlan_fppac.pdf - Published Version - Requires a PDF viewer. Download (555Kb) | Preview |
Official URL: http://dx.doi.org/10.1137/070699354
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 Erdős–Rényi model Gn,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.
Item Type: | Journal Article | ||||||||
---|---|---|---|---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||||||
Library of Congress Subject Headings (LCSH): | Random graphs, Partitions (Mathematics) | ||||||||
Journal or Publication Title: | SIAM Journal on Discrete Mathematics | ||||||||
Publisher: | Society for Industrial and Applied Mathematics | ||||||||
ISSN: | 0895-4801 | ||||||||
Official Date: | 18 November 2009 | ||||||||
Dates: |
|
||||||||
Volume: | Volume 23 | ||||||||
Number: | Number 4 | ||||||||
Page Range: | pp. 1682-1714 | ||||||||
DOI: | 10.1137/070699354 | ||||||||
Status: | Peer Reviewed | ||||||||
Publication Status: | Published | ||||||||
Access rights to Published version: | Restricted or Subscription Access | ||||||||
Date of first compliant deposit: | 20 December 2015 | ||||||||
Date of first compliant Open Access: | 20 December 2015 | ||||||||
Funder: | Deutsche Forschungsgemeinschaft (DFG) | ||||||||
Grant number: | CO 646 (DFG) |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year