Clustering in complex directed networks.

  title={Clustering in complex directed networks.},
  author={Giorgio Fagiolo},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={76 2 Pt 2},
  • Giorgio Fagiolo
  • Published 2007 in
    Physical review. E, Statistical, nonlinear, and…
Many empirical networks display an inherent tendency to cluster, i.e., to form circles of connected nodes. This feature is typically measured by the clustering coefficient (CC). The CC, originally introduced for binary, undirected graphs, has been recently generalized to weighted, undirected networks. Here we extend the CC to the case of (binary and weighted) directed networks and we compute its expected value for random graphs. We distinguish between CCs that count all directed triangles in… CONTINUE READING
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 317 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 177 extracted citations

318 Citations

Citations per Year
Semantic Scholar estimates that this publication has 318 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-4 of 4 references

Small Worlds (Princeton

  • D. Watts
  • 1999
Highly Influential
3 Excerpts

Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford

  • S. Dorogovtsev, J. Mendes
  • 2003
2 Excerpts

Social Network Analysis: A Handbook (London, Sage

  • J. Scott
  • 2000
1 Excerpt

Random Graphs (New York

  • B. Bollobás
  • 1985
2 Excerpts

Similar Papers

Loading similar papers…