RandomGraphs

From brainsik
Jump to navigation Jump to search

I am interested in different kinds of random graphs and their relationship to natural (particularly social) networks. By applying various statistical measurements to computer generated examples, some of the various ways that randomly generated graphs differ from one another were seen. (See the home grown software and writeup if interested.) I would like to apply these statistical measurements to real world graphs such as ====WikiWikis or the Advogato web of trust. This page serves as a notebook of resources aiding me in this journey.

==

====Basic Ideas

==

Three robust measures of network topology:

  1. average path length
  2. clustering coefficient
  3. degree distribution

Corresponding three flavors of random graphs:

  1. Erdos-Renyi (classical, 1950s), small path length
  2. small world (1998), high clustering coefficient
  3. scale-free (1999), scale free degree distribution

====Key Papers

==

====Some People

==

====Next Papers to View

==


Last Edit: Mon, 14 Apr 2003 02:30:28 -0700
Revisions: 8