Skip to content

References

Jump to bottom
Chris Watson edited this page May 7, 2015 · 8 revisions

This is a list of references that are useful in the study of graphs/complex networks.

Classic/General

  • Fruchterman TMJ & Reingold EM. Graph drawing by force-directed placement. Software - Practice and Experience, 1991, 21:1129-1164.
  • Watts DJ & Strogatz SH. Collective dynamics of 'small world' networks. Nature, 1998, 393:440-442.
  • Barabasi A & Albert R. Emergence of scaling in random networks. Science, 1999, 286:509-512.
  • Latora V & Marchiori M. Efficient behavior of small-world networks. Physical Review Letters, 2001, 87(19):198701.
  • Girvan M & Newman MEJ. Community structure in social and biological networks. PNAS, 2002, 99(12):7821-7826.
  • Maslov S & Sneppen K. Specificity and stability in topology of protein networks. Science, 2002, 296:910-914.
  • Milo R, Shen-Orr S, Itzkovitz S et al. Network motifs: Simple building blocks of complex networks. Science, 2002, 298:824-828.
  • Newman MEJ & Girvan M. Finding and evaluating community structure in networks. Physical Review E, 2004, 69:026113.
  • Newman MEJ. Modularity and community structure in graphs. PNAS, 2006, 103(23):8577-8582.

Reviews

  • Albert R & Barabasi A. Statistical mechanics of complex networks. Reviews of Modern Physics, 2002, 74.1:47.
  • Newman MEJ. The structure and function of complex networks. SIAM Review, 2003, 45(2):167-256.
  • Boccaletti S et al. Complex networks: Structure and dynamics. Physics Reports, 2006, 424:175-308.
  • Fortunato S. Community detection in graphs. Physics Reports, 2010, 486:75-174.

Communities/Modularity

  • Girvan M & Newman MEJ. Community structure in social and biological networks. PNAS, 2002, 99(12):7821-7826.
  • Newman MEJ & Girvan M. Finding and evaluating community structure in networks. Physical Review E, 2004, 69:026113.
  • Newman MEJ. Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 2006, 74:036104.
  • Newman MEJ. Modularity and community structure in graphs. PNAS, 2006, 103(23):8577-8582.
  • Lancichinetti A & Fortunato S. Community detection algorithms: a comparative analysis. Physical Review E, 2009, 80:056117.
  • Fortunato S. Community detection in graphs. Physics Reports, 2010, 486:75-174.

Graph generation

  • Milo R et al. On the uniform generation of random graphs with prescribed degree sequence. 2004, http://arxiv.org/abs/condmat/0312028.
  • Bansal S. et al. Exploring biological network structure with clustered random networks. BMC Bioinformatics, 2009, 10:405-419.
  • Green DM & Kiss IZ. Large-scale properties of clustered networks: implications for disease dynamics. J Biological Dynamics, 2010, 4(5):431-445.
  • Ray J, Pinar A, Seshadhri C. A stopping criterion for Markov chains when generating independent random graphs. 2012, http://arxiv.org/abs/1210.8184.
  • Ray J, Pinar A, Seshadhri C. Are we there yet? When to stop a Markov chain while generating random graphs. LNCS 7323, 2012, 153-164.
  • Stanton I & Pinar A. Constructing and sampling graphs with a prescribed joint degree distribution. ACM J Experimental Algorithmics, 2012, 17(3):3.5.
  • Trajanovski S, Kuipers FA, Martin-Hernandez J, van Mieghem P. Generating graphs that approach a prescribed modularity. Computer Communications, 2013, 36:363-372.

Vulnerability/robustness/attack

  • Albert R, Jeong H, Barabasi A. Error and attack tolerance of complex networks. Nature, 2000, 406:378-382.
  • Holme P & Kim BJ. Attack vulnerability of complex networks. Physical Review E, 2002, 65:056109.
  • Crucitti P, Latora V, Marchiori M, Rapisarda A. Efficiency of scale-free networks: error and attack tolerance. Physica A, 2003, 320:622-642.
  • Latora V & Marchiori M. Vulnerability and protection of infrastructure networks. Physical Review E, 2005, 71:015103.
  • Achard S, Salvador R, Whitcher B, Suckling J, Bullmore E. A resilient, low-frequency, small-world human brain functional network with highly connected association cortical hubs. J Neurosci, 2006, 26(1):63-72.

Network measures

  • Assortativity: Newman MEJ. Assortative mixing in networks. Physical Review Letters, 2002, 89(20):208701.
  • Assortativity: Newman MEJ. Mixing patterns in networks. Physical Review E, 2003, 67:026126.
  • Global and local efficiency: Latora V & Marchiori M. Efficient behavior of small-world networks. Physical Review Letters, 2001, 87(19):198701.
  • Participation coefficient: Guimera R & Amaral LAN. Functional cartography of complex metabolic networks. Nature, 2005, 433:895-900.
  • Participation coefficient: Guimera R & Amaral LAN. Cartography of complex networks: modules and universal roles. Journal of Statistical Mechanics:Theory and Experiment, 2005, 02, P02001.
  • Rich club: Zhou S & Mondragon RJ. The rich-club phenomenon in the internet topology. IEEE Communications Letters, 2004, 8(3):180-182.
  • Rich club: Colizza V et al. Detecting rich-club ordering in complex networks. Nature Physics, 2006, 2:110-115.
  • Small-worldness: Watts DJ & Strogatz SH. Collective dynamics of 'small world' networks. Nature, 1998, 393:440-442.
  • Small-worldness: Humphries MD & Gurney K. Network 'small-worldness': A quantitative method for determining canonical network equivalence. PLoS One, 2008, 3(4):e0002051-e0002060.
Clone this wiki locally