Journal
PHYSICAL REVIEW LETTERS
Volume 103, Issue 5, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.103.058701
Keywords
-
Categories
Funding
- National Science Foundation [DMS-0804778]
- Direct For Mathematical & Physical Scien [0804778] Funding Source: National Science Foundation
- Division Of Mathematical Sciences [0804778] Funding Source: National Science Foundation
Ask authors/readers for more resources
We offer a solution to a long-standing problem in the theory of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity-the propensity for two neighbors of a network node also to be neighbors of one another. We show how standard random-graph models can be generalized to incorporate clustering and give exact solutions for various properties of the resulting networks, including sizes of network components, size of the giant component if there is one, position of the phase transition at which the giant component forms, and position of the phase transition for percolation on the network.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available