Partitioning Random Graphs with General Degree Distributions

No abstract is available for this paper.

• Publication year

  2008

• Venue

  IFIP TCS

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-0-387-09680-3_9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Blockchain-based Mobility Verification of Connected Cars

  2020cited by this paper
• Random graphs

  2006cited by this paper
• Spectral Partitioning of Random Graphs with Given Expected Degrees

  2006cited by this paper
• The Spectral Gap of Random Graphs with Given Expected Degrees

  2006cited by this paper
• Spectral analysis of random graphs with skewed degree distributions

  2004influential reference
• A spectral technique for random satisfiable 3CNF formulas

  2003cited by this paper
• Graph partitioning for high-performance scientific simulations

  2003cited by this paper
• Analysis of gene expression profiles: class discovery and leaf ordering

  2002cited by this paper
• On the Eigenvalue Power Law

  2002cited by this paper
• Spectral analysis of data

  2001cited by this paper
• Spectral partitioning of random graphs

  2001influential reference
• A random graph model for massive graphs

  2000influential reference
• Random graphs

  2000cited by this paper
• Spectral Techniques in Graph Algorithms

  1998cited by this paper
• A Spectral Technique for Coloring Random 3-Colorable Graphs

  1994influential reference
• PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*

  1990cited by this paper
• Eigenvalues and graph bisection: An average-case analysis

  1987cited by this paper
• The eigenvalues of random symmetric matrices

  1981cited by this paper
• A random graph

  1981cited by this paper

• An impossibility result for reconstruction in the degree-corrected stochastic block model

  2018cites this paper
• Sur deux problèmes d'apprentissage automatique : la détection de communautés et l'appariement adaptatif. (On two problems in machine learning : community detection and adaptive matching)

  2017cites this paper
• An Impossibility Result for Reconstruction in a Degree-Corrected Planted-Partition Model

  2015cites this paper
• Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels

  2015cites this paper
• Asymptotic Normality of Maximum Likelihood and its Variational Approximation for Stochastic Blockmodels

  2012cites this paper
• Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges

  2009cites this paper
• Algorithmen und Komplexität

  2009cites this paper