# Erdős–Rényi model

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- IEEE 58th Annual Symposium on Foundations of…
- 2017

A classical difficult isomorphism testing problem is to test isomorphism of p-groups of class 2 and exponent p in time polynomial… (More)

Is this relevant?

2016

2016

- SIGMETRICS
- 2016

We consider the problem of perfectly recovering the vertex correspondence between two correlated Erdos-Renyi (ER) graphs. For a… (More)

Is this relevant?

2014

2014

- Journal of Machine Learning Research
- 2014

Graph matching is an important problem in machine learning and pattern recognition. Herein, we present theoretical and practical… (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- Physical review. E, Statistical, nonlinear, and…
- 2012

Community structure plays a significant role in the analysis of social networks and similar graphs, yet this structure is little… (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Eur. J. Comb.
- 2011

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

- 2011

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

- Combinatorics, Probability & Computing
- 2011

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

- 2008

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

- 2006

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

- SDM
- 2004

How does a ‘normal’ computer (or social) network look like? How can we spot ‘abnormal’ sub-networks in the Internet, or web graph… (More)

Is this relevant?