Random graphs as models of networks

Details Random graphs as models of networks Random graphs as models of networks

2002-02-12

arxiv.org/abs/cond-mat/0202208v1

Physics

Condensed Matter

Statistical Mechanics

35 pages, 6 figures

Scientific paper

The random graph of Erdos and Renyi is one of the oldest and best studied models of a network, and possesses the considerable advantage of being exactly solvable for many of its average properties. However, as a model of real-world networks such as the Internet, social networks or biological networks it leaves a lot to be desired. In particular, it differs from real networks in two crucial ways: it lacks network clustering or transitivity, and it has an unrealistic Poissonian degree distribution. In this paper we review some recent work on generalizations of the random graph aimed at correcting these shortcomings. We describe generalized random graph models of both directed and undirected networks that incorporate arbitrary non-Poisson degree distributions, and extensions of these models that incorporate clustering too. We also describe two recent applications of random graph models to the problems of network robustness and of epidemics spreading on contact networks.

Affiliated with

Also associated with

No associations

Rating

Random graphs as models of networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random graphs as models of networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random graphs as models of networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-308088