Erdős–Rényi model

Known as: Erdos-Renyi model, ER, Erdoes-Renyi model 
In graph theory, the Erdős–Rényi model is either of two closely related models for generating random graphs. They are named after Paul Erdős and Alfr… (More)
Wikipedia

Related topics

Related topics

33 relations
Aanderaa–Karp–Rosenberg conjectureAverage path lengthBarabási–Albert modelBounded expansion
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model
A classical difficult isomorphism testing problem is to test isomorphism of p-groups of class 2 and exponent p in time polynomial… (More)
  • figure 1
  • figure 2
Is this relevant?
2016
2016
Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching
We consider the problem of perfectly recovering the vertex correspondence between two correlated Erdos-Renyi (ER) graphs. For a… (More)
  • figure 1
Is this relevant?
2014
2014
Seeded graph matching for correlated Erdös-Rényi graphs
Graph matching is an important problem in machine learning and pattern recognition. Herein, we present theoretical and practical… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Community structure and scale-free collections of Erdös-Rényi graphs
Community structure plays a significant role in the analysis of social networks and similar graphs, yet this structure is little… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
The large deviation principle for the Erdős-Rényi random graph
space of graphs contd. I Suppose that t(H,Gn) tends to a limit t(H) for every H. I Then Lovász & Szegedy proved that there is a… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Spectral Statistics of Erdős-Rényi Graphs I : Local Semicircle Law
We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, i.e. graphs on N vertices where every edge is chosen… (More)
Is this relevant?
2011
2011
First Passage Percolation on the Erdős-Rényi Random Graph
1Department of Statistics and Operations Research, 304 Hanes Hall, University of North Carolina, Chapel Hill, NC 27599, USA (e… (More)
Is this relevant?
2008
2008
Erdős-Rényi random graphs + forest fires = self organized criticality
We modify the usual Erd˝ os-Rényi random graph evolution by letting connected clusters 'burn down' (i.e. fall apart to… (More)
Is this relevant?
2006
2006
LIFSHITZ TAILS FOR SPECTRA OF ERDŐS – RÉNYI RANDOM GRAPHS
We consider the discrete Laplace operator ∆ on Erdős–Rényi random graphs with N vertices and edge probability p/N . We are… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
R-MAT: A Recursive Model for Graph Mining
How does a ‘normal’ computer (or social) network look like? How can we spot ‘abnormal’ sub-networks in the Internet, or web graph… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?