|
Department
of |
|
Susan L. EpsteinThe CUNY Graduate School, Department
of Computer Science and Hunter College, Department
of Computer Science
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
|
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Home Publications Collaborators Courses Contact
|
|
SMALL-WORLD PROBLEMS (CSP)The characteristic path length of a graph is the length of the shortest path between two vertices, averaged over all pairs of vertices. The clustering coefficient of a graph is the average fraction of edges allowed among the neighbors of each vertex. In a small world problem, the ratio of clustering coefficient to characteristic path length is much higher than average. Small world graphs were constructed by ring lattice rewiring (Watts, D. and S. Strogatz, 1998, Collective dynamics of small-world networks. Nature 393: 440.)
|
