Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

A professor in my grad program gave me the impression that random graphs are an interesting and as of yet largely unexplored area of mathematics (feel free to correct this impression if I'm wrong). I've found the Erdos and Renyi papers from the late 50s/early 60s and nabbed a copy of Random Graphs by Bollobas. I was wondering if anyone could recommend references/reading materials regarding the current state of research in this area, something perhaps more recent than these.


Update: I appreciate the responses and plan to read the information linked. To close out the question,I'm going to (semi-arbitrarily) pick the response with more references in it. Thanks everybody!

share|cite|improve this question
I don't know if "largely unexplored" is a fair characterization. A lot of research in percolation theory is closely related. – Qiaochu Yuan Feb 4 '11 at 19:53
Fair enough. I've also grabbed a copy of "Percolation" (Bollobas and Riordan), and mean to get through it as well. I got the impression from this professor that there was a lot of room to grow here; it's funny he didn't mention percolation, since another professor in our department has published a bit in that area. – user4689 Feb 4 '11 at 20:34
up vote 1 down vote accepted

I haven't read either of these thoroughly, but they are recent and look interesting.

Random Graph Dynamics by Rick Durrett

Probability on Graphs by Geoffrey Grimmett

share|cite|improve this answer
Thanks for the links, I'll add them to the reading list. – user4689 Feb 4 '11 at 20:30

Something like this?

share|cite|improve this answer
Thanks for the suggestion, I'll check it out! – user4689 Feb 4 '11 at 20:30

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.