LTCC_graphs_2018/reading_material/week_3

Reading material for Week 3 (05/03/2018)

The lecture in Week 3 will be focused on subraphs and communities.

Please make sure to read (or at least have had a look at) the references indicated below:

1. Small subgraphs and motifs

* R. Milo et al., "Network Motifs: Simple Building Blocks of Complex
  Networks", Science 298 (2002) 824-827
  [paper here](./Alon2002_networkMotifs.pdf)

* R. Milo et al., "Superfamilies of Evolved and Designed Networks",
  Science 303 (2002) 1538-1542
  [paper here](./Alon2004_Superfamilies_of_Evolved_and_Designed_Networks.pdf)

2. Cycles

* N. Alon, R. Yuster, U. Zwick, "Finding and counting given length
  cycles", Algorithmica 17 (1997) 209-223
  [paper here](./Alon1997_ayz4.pdf)

3. Communities

* M. Girvan, M. E. J. Newman, "Community structure in social and
  biological networks", Proc. Natl. Acad. Sci. USA 99(12)  (2002),
  7821-7826
  [paper here](./Girvan2002_PNAS-2002-Girvan-7821-6.pdf)

* U. N. Raghavan, R. Albert, S. Kumara "Near linear time algorithm
  to detect community structure in large-scale networks", Phys. Rev.
  E 76 (2007), 036106
  [paper here](./Raghavan2007_PhysRevE.76.036106.pdf)

* V. D. Blondel et al., "Fast unfolding of communities in large
  networks", J. Stat. Mech.-Theory E. 2008 (2008), P10008
    
* S. Fortunato, "Community detection in graphs", Phys. Rep. 486
  (2009), 75-174
  [paper here](./Fortunato2009_community.pdf)