<?xml version="1.0"?>
<!-- name="generator" content="blosxom/2.0" -->
<!DOCTYPE rss PUBLIC "-//Netscape Communications//DTD RSS 0.91//EN" "http://my.netscape.com/publish/formats/rss-0.91.dtd">

<rss version="0.91">
  <channel>
    <title>Notebooks   </title>
    <link>http://bactra.org/notebooks</link>
    <description>Cosma's Notebooks</description>
    <language>en</language>

  <item>
    <title>Community Discovery Methods for Complex Networks</title>
    <link>http://bactra.org/notebooks/2012/04/04#community-discovery</link>
    <description>
&lt;P&gt;&lt;em&gt;Given&lt;/em&gt;: a network, especially a large one, directed or not, weighted
or not.  &lt;em&gt;Desired&lt;/em&gt;: a sensible decomposition of the graph into
sub-graphs, where in some reasonable sense the nodes in each sub-graph have
more to do with each other than with outsiders, i.e., form communities.
This is also called &quot;module detection&quot;.

&lt;P&gt;This seems like a really useful idea to apply to problems I'm interested in,
in &lt;a href=&quot;neuro-synch.html&quot;&gt;neural synchronization&lt;/a&gt;; also a place where
there could stand to be more interchange
between &lt;a href=&quot;statistics.html&quot;&gt;statistics&lt;/a&gt;
and &lt;a href=&quot;complex-networks.html&quot;&gt;complex-network-wallahs&lt;/a&gt;.

&lt;P&gt;Some of the methods in this area remind me of stuff
&lt;a href=&quot;christopher-alexander.html&quot;&gt;Christopher Alexander&lt;/a&gt; did in his 1964
book &lt;cite&gt;Notes on the Synthesis of Form&lt;/cite&gt;, but it's been a long time
since I read that, so my memory may be faulty.

&lt;P&gt;See also:
	&lt;a href=&quot;ecology.html&quot;&gt;Ecology&lt;/a&gt;;
	&lt;a href=&quot;neuroscience.html&quot;&gt;Neuroscience&lt;/a&gt;;
	&lt;a href=&quot;signal-transduction.html&quot;&gt;Signal Transduction, Gene Regulation
and Control of Metabolism&lt;/a&gt;;
	&lt;a href=&quot;social-networks.html&quot;&gt;Social Networks&lt;/a&gt;;
	&lt;a href=&quot;sociology-of-science.html&quot;&gt;Sociology of Science&lt;/a&gt;;
	&lt;a href=&quot;stat-mech.html&quot;&gt;Statistical Mechanics&lt;/a&gt;;
	&lt;a href=&quot;synchronization.html&quot;&gt;Synchronization&lt;/a&gt;


&lt;ul&gt;Recommended, big picture:
	&lt;li&gt;Peter J. Bickel and Aiyou Chen, &quot;A nonparametric view of network
models and Newman-Girvan and other modularities&quot;, &lt;a href=&quot;http://dx.doi.org/10.1073/pnas.0907096106&quot;&gt;&lt;cite&gt;Proceedings of
the National Academy of Sciences&lt;/cite&gt; (USA) &lt;strong&gt;106&lt;/strong&gt; (2009):
21068--21073&lt;/a&gt; [See under &lt;a href=&quot;graph-limits.html&quot;&gt;Graph Limits and Infinite Exchangeable Arrays&lt;/a&gt;]
	&lt;li&gt;Michelle Girvan and M. E. J. Newman, &quot;Community structure in
social and biological networks,&quot;
&lt;a href=&quot;http://arxiv.org/abs/cond-mat/0112110&quot;&gt;cond-mat/0112110&lt;/a&gt;
= &lt;cite&gt;Proceedings of the National Academy of Sciences&lt;/cite&gt;
(USA) &lt;strong&gt;99&lt;/strong&gt; (2002): 7821--7826
	&lt;li&gt;Jake M. Hofman, Chris H. Wiggins, &quot;A Bayesian Approach to Network
Modularity&quot;, &lt;a href=&quot;http://arxiv.org/abs/0709.3512&quot;&gt;arxiv:0709.3512&lt;/a&gt;
[For &quot;Bayesian&quot;, read &quot;smoothed maximum likelihood&quot;.  But nonetheless: cool.]
	&lt;li&gt;M. E. J. Newman
		&lt;ul&gt;
		&lt;li&gt;&quot;Modularity and community structure in
networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/physics/0602124&quot;&gt;physics/0602124&lt;/a&gt;
= &lt;cite&gt;Proceedings of the National Academy of Sciences&lt;/cite&gt;
(USA) &lt;strong&gt;103&lt;/strong&gt; (2006): 87577--8582
		&lt;li&gt;&quot;Finding community structure in networks using the
eigenvectors of matrices&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1103/PhysRevE.74.036104&quot;&gt;&lt;cite&gt;Physical Review
E&lt;/cite&gt; &lt;strong&gt;74&lt;/strong&gt; (2006): 036104&lt;/a&gt;
= &lt;a href=&quot;http://arxiv.org/abs/physics/0605087&quot;&gt;physics/0605087&lt;/a&gt;
		&lt;/ul&gt;
	&lt;li&gt;M. E. J. Newman and Michelle Girvan
		&lt;ul&gt;
		&lt;li&gt;&quot;Mixing patterns and community
structure in networks&quot;, &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0210146&quot;&gt;cond-mat/0210146&lt;/a&gt;
		&lt;li&gt;&quot;Finding and evaluating community structure in
networks&quot;, &lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;69&lt;/strong&gt; (2003): 026113
= &lt;a href=&quot;http://arxiv.org/abs/cond-mat/0308217&quot;&gt;cond-mat/0308217&lt;/a&gt;
		&lt;/ul&gt;
	&lt;/ul&gt;

&lt;ul&gt;Recommended, close-ups:
	&lt;li&gt;Edoardo M. Airoldi, David M. Blei, Stephen E. Fienberg and
Eric P. Xing, &quot;Mixed membership stochastic blockmodels&quot;, &lt;a href=&quot;http://arxiv.org/abs/0705.4485&quot;&gt;arxiv:0705.4485&lt;/a&gt;
	&lt;li&gt;Aaron Clauset, &quot;Finding local community structure in
networks&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.72.026132&quot;&gt;&lt;cite&gt;Physical
Review E&lt;/cite&gt; &lt;strong&gt;72&lt;/strong&gt; (2005):
026132&lt;/a&gt;, &lt;a href=&quot;http://arxiv.org/abs/physics/0503036&quot;&gt;physics/0503036&lt;/a&gt;
[Clever; but then, Aaron is clever.]
	&lt;li&gt;Aaron Clauset, M. E. J. Newman and Cristopher Moore, &quot;Finding
Community Structure in Very Large Networks&quot;, &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0408187&quot;&gt;cond-mat/0408187&lt;/a&gt;
= &lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;70&lt;/strong&gt; (2004): 066111
	&lt;LI&gt;J.-J. Daudin, F. Picard and S. Robin, &quot;A Mixture Model for Random
Graphs&quot;, &lt;a href=&quot;http://dx.doi.org/10.1007/s11222-007-9046-7&quot;&gt;&lt;cite&gt;Statistics
and Computing&lt;/cite&gt; &lt;strong&gt;18&lt;/strong&gt; (2008): 173--183&lt;/a&gt;
	&lt;li&gt;Aurelien Decelle, Florent Krzakala, Cristopher Moore and Lenka
Zdeborova
		&lt;ul&gt;
		&lt;li&gt;&quot;Phase transition in the detection of modules in sparse networks&quot;,
&lt;cite&gt;Physical Review Letters&lt;/cite&gt; &lt;strong&gt;107&lt;/strong&gt; (2011): 065701,
&lt;a href=&quot;http://arxiv.org/abs/1102.1182&quot;&gt;arxiv:1102.1182&lt;/a&gt;
		&lt;li&gt;&quot;Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications&quot;, &lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;84&lt;/strong&gt; (2011): 066106, &lt;a href=&quot;http://arxiv.org/abs/1109.3041&quot;&gt;arxiv:1109.3041&lt;/a&gt;
		&lt;/ul&gt;
	&lt;li&gt;Roger Guimera, Marta Sales-Pardo and Luis A. N. Amaral, &quot;Modularity
from Fluctuations in Random Graphs&quot;, &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0403660&quot;&gt;cond-mat/0403660&lt;/a&gt;
= &lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;70&lt;/strong&gt; (2004): 025101
	&lt;li&gt;J. A. Henderson and P. A. Robinson, &quot;Geometric Effects on Complex Network Structure in the Cortex&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevLett.107.018102&quot;&gt;&lt;cite&gt;Physical
Review Letters&lt;/cite&gt; &lt;strong&gt;107&lt;/strong&gt; (2011): 018102&lt;/a&gt;
	&lt;li&gt;Brian Karrer, M. E. J. Newman, &quot;Stochastic blockmodels and community structure in networks&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.83.016107&quot;&gt;&lt;cite&gt;Physical Review&lt;/cite&gt;
&lt;strong&gt;83&lt;/strong&gt; (2011): 016107&lt;/a&gt;, &lt;a href=&quot;http://arxiv.org/abs/1008.3926&quot;&gt;arxiv:1008.3926&lt;/a&gt;
	&lt;li&gt;Andrea Lancichinetti, Santo Fortunato, Janos Kertesz, &quot;Detecting
the overlapping and hierarchical community structure of complex networks&quot;,
&lt;a href=&quot;http://arxiv.org/abs/0802.1218&quot;&gt;arxiv:0802.1218&lt;/a&gt; [An interesting
approach, but not quite as novel as they claim --- cf. Reichardt and
Bornholdt --- and I'd really like to see more evidence of superior accuracy
and/or robustness]
	&lt;li&gt;E. A. Leicht, M. E. J. Newman, &quot;Community structure in directed
networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/0709.4500&quot;&gt;arxiv:0709.4500&lt;/a&gt;
	&lt;li&gt;Mahendra Mariadassou, St&amp;eacute;phane Robin, and Corinne Vacher, &quot;Uncovering latent structure in valued graphs: A variational approach&quot;, &lt;a href=&quot;http://projecteuclid.org/euclid.aoas/1280842137&quot;&gt;Annals of Applied Statistics&lt;/cite&gt; &lt;strong&gt;4&lt;/strong&gt; (2010): 715-774&lt;/a&gt;
	&lt;li&gt;Peter J. Mucha, Thomas Richardson, Kevin Macon, Mason A. Porter,
Jukka-Pekka Onnela, &quot;Community Structure in Time-Dependent, Multiscale, and
Multiplex
Networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/0911.1824&quot;&gt;arxiv:0911.1824&lt;/a&gt;
	&lt;li&gt;J&amp;ouml;rg Reichardt and Stefan Bornholdt [Code is available
by e-mail from Reichardt, who was very helpful to me when I needed to
implement their algorithm.]
		&lt;ul&gt;
		&lt;li&gt;&quot;Detecting Fuzzy
Community Structures in Complex Networks with a Potts Model&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1103/PhysRevLett.93.218701&quot;&gt;&lt;cite&gt;Physical Review
Letters&lt;/cite&gt; &lt;strong&gt;93&lt;/strong&gt; (2004): 218701 = &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0402349&quot;&gt;cond-mat/0402349&lt;/a&gt;
		&lt;li&gt;&quot;Statistical Mechanics of Community
Detection&quot;, &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0603718&quot;&gt;cond-mat/0603718&lt;/a&gt;
= &lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;74&lt;/strong&gt; (2006): 016110
		&lt;li&gt;&quot;Clustering of sparse data via network communities &amp;mdash;
a prototype study of a large online market&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1088/1742-5468/2007/06/P06016&quot;&gt;&lt;cite&gt;Journal of
Statistical Mechanics: Theory and Experiment&lt;/cite&gt; (2007): P06016&lt;/a&gt;
		&lt;/ul&gt;
	&lt;li&gt;J&amp;ouml;rg Reichardt and Douglas R. White, &quot;Role models for complex
networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/0708.0958&quot;&gt;arxiv:0708.0958&lt;/a&gt;
[&lt;a href=&quot;http://bactra.org/weblog/512.html&quot;&gt;Discussion&lt;/a&gt;]
	&lt;li&gt;Martin Rosvall and Carl T. Bergstrom
		&lt;ul&gt;
		&lt;li&gt;&quot;An information-theoretic framework for resolving community structure in complex networks&quot;,
&lt;a href=&quot;http://arxiv.org/abs/physics/0612035&quot;&gt;physics/0612035&lt;/a&gt;
[Or, &lt;a href=&quot;mdl.html&quot;&gt;MDL&lt;/a&gt; to the rescue!]
		&lt;li&gt;&quot;Maps of random walks on complex networks reveal community structure&quot;, &lt;a href=&quot;http://dx.doi.org/10.1073/pnas.0706851105&quot;&gt;&lt;cite&gt;Proceedings of the
National Academy of Sciences&lt;/cite&gt; (USA) &lt;strong&gt;105&lt;/strong&gt; (2008):
1118--1123&lt;/a&gt;
		&lt;/ul&gt;
	&lt;li&gt;M. Sales-Pardo, R. Guimera, A. Moreira, L. Amaral, &quot;Extracting the
hierarchical organization of complex
systems&quot;, &lt;a href=&quot;http://arxiv.org/abs/0705.1679&quot;&gt;arxiv:0705.1679&lt;/a&gt;
	&lt;li&gt;Yunpeng Zhao, Elizaveta Levina and Ji Zhu, &quot;Community extraction
for social networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/1005.3265&quot;&gt;arxiv:1005.3265&lt;/a&gt;
	&lt;/ul&gt;

&lt;ul&gt;Modesty forbids me to recommend:
	&lt;li&gt;CRS, &lt;a href=&quot;http://physics.usfca.edu/marcelo/&quot;&gt;Marcelo
F. Camperi&lt;/a&gt; and &lt;a href=&quot;http://www.stat.cmu.edu/~klinkner/&quot;&gt;Kristina Lisa
Klinkner&lt;/a&gt;, &quot;Discovering Functional Communities in Dynamical
Networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/q-bio.NC/0609008&quot;&gt;q-bio.NC/0609008&lt;/a&gt;
	&lt;/ul&gt;

&lt;ul&gt;To read:
	&lt;li&gt;Yong-Yeol Ahn, James P. Bagrow and Sune Lehmann, &quot;Link communities reveal multiscale complexity in networks&quot;, &lt;a href=&quot;http://dx.doi.org/10.1038/nature09182&quot;&gt;&lt;cite&gt;Nature&lt;/cite&gt; &lt;strong&gt;455&lt;/strong&gt; (2010): 761--764&lt;/a&gt;, &lt;a href=&quot;http://arxiv.org/abs/0903.3178&quot;&gt;arxiv:0903.3178&lt;/a&gt; [Lehmann's &lt;a href=&quot;http://www.iq.harvard.edu/blog/netgov/2010/06/pervasive_overlap.html&quot;&gt;blog-post&lt;/a&gt; on this]
	&lt;li&gt;Nelson Augusto Alves, &quot;Unveiling community structures in weighted
networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/physics/0703087&quot;&gt;physics/0703087&lt;/a&gt;
	&lt;li&gt;Leonardo Angelini, Stefano Boccaletti, Daniele Marinazzo, Mario
Pellicoro, and Sebastiano Stramaglia, &quot;Fast identification of network modules
by optimization of ratio association&quot;, &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0610182&quot;&gt;cond-mat/0610182&lt;/a&gt;
	&lt;li&gt;L. Angelini, D. Marinazzo, M. Pellicoro and S. Stramaglia, &quot;Natural
clustering: the modularity
approach&quot;, &lt;a href=&quot;http://arxiv.org/abs/cond-mat/0607643&quot;&gt;cond-mat/0607643&lt;/a&gt;
	&lt;li&gt;Alex Arenas, Javier Borge-Holthoefer, Sergio Gomez, Gorka Zamora-Lopez, &quot;Optimal map of the modular structure of complex networks&quot;, &lt;cite&gt;New Journal of Physics&lt;/cite&gt; &lt;strong&gt;12&lt;/strong&gt; (2010): 053009, &lt;a href=&quot;http://arxiv.org/abs/0911.2651&quot;&gt;arxiv:0911.2651&lt;/a&gt;
	&lt;li&gt;A. Arenas, J. Duch, A. Fernandez, S. Gomez,
&quot;Size reduction of complex networks preserving modularity&quot;,
&lt;a href=&quot;http://arxiv.org/abs/physics/0702015&quot;&gt;physics/0702015&lt;/a&gt;
[Do you really need all those links?  Wouldn't your life be simpler if
you could just ignore some of them?]
	&lt;li&gt;Alex Arenas, Alberto Fernandez, Sergio Gomez, &quot;Multiple resolution
of the modular structure of complex
networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/physics/0703218&quot;&gt;physics/0703218&lt;/a&gt;
	&lt;li&gt;Alex Arenas, Alberto Fernandez, Santo Fortunato, Sergio Gomez,
&quot;Motif-based communities in complex
networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/0710.0059&quot;&gt;arxiv:0710.0059&lt;/a&gt;
	&lt;li&gt;Sanjeev Arora, Rong Ge, Sushant Sachdeva, Grant Schoenebeck,
&quot;Finding Overlapping Communities in Social Networks: Toward a Rigorous
Approach&quot;, &lt;a href=&quot;http://arxiv.org/abs/1112.1831&quot;&gt;arxiv:1112.1831&lt;/a&gt; [By
&quot;rigorous&quot;, they mean &quot;rigorous analysis of the algorithm&quot;, not, e.g., a
statistically or scientifically rigorous approach.]
	&lt;li&gt;Jim Bagrow and Erik Bollt, &quot;A Local Method for Detecting
Communities&quot;, &lt;cite&gt;PHysical Review E&lt;/cite&gt; &lt;strong&gt;72&lt;/strong&gt; (2005): 046108, &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0412482&quot;&gt;cond-mat/0412482&lt;/a&gt;
	&lt;li&gt;James Bagrow, Erik Bollt, Luciano da F. Costa, &quot;Network Structure
Revealed by Short
Cycles&quot;, &lt;a href=&quot;http://arxiv.org/abs/cond-mat/0612502&quot;&gt;cond-mat/0612502&lt;/a&gt;
	&lt;li&gt;Brian Ball, Brian Karrer, M. E. J. Newman, &quot;An efficient and principled method for detecting communities in networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/1104.3590&quot;&gt;arxiv:1104.3590&lt;/a&gt;
	&lt;li&gt;Michael J. Barber, John W. Clark, &quot;Detecting network communities by propagating labels under constraints&quot;, &lt;cite&gt;Physical Review E&lt;/cite&gt;
&lt;strong&gt;80&lt;/strong&gt; (2009): 026129, &lt;a href=&quot;http://arxiv.org/abs/0903.3138&quot;&gt;arxiv:0903.3138&lt;/a&gt;
	&lt;li&gt;Jonathan W. Berry, Bruce Hendrickson, Randall A. LaViolette,
Cynthia A. Phillips, &quot;Tolerating the Community Detection Resolution Limit with
Edge Weighting&quot;, &lt;a href=&quot;http://arxiv.org/abs/0903.1072&quot;&gt;arxiv:0903.1072&lt;/a&gt;
[I have to say that their abstract sounds like a recipe for over-fitting, but I
haven't read the paper so that could be totally unfair.]
	&lt;li&gt;S. Boccaletti, M. Ivanchenko, V. Latora, A. Pluchino and
A. Rapisarda, &quot;Dynamical clustering methods to find community
structures&quot;, &lt;a href=&quot;http://arxiv.org/abs/physics/0607179&quot;&gt;physics/0607179&lt;/a&gt;
	&lt;li&gt;Marianna Bolla, &quot;Penalized versions of the Newman-Girvan modularity and their relation to normalized cuts and k-means clustering&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.84.016108&quot;&gt;&lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;84&lt;/strong&gt; (2011): 016108&lt;/a&gt;
	&lt;li&gt;Michael James Bommarito II, Daniel Martin Katz, Jon Zelner, &quot;On the
Stability of Community Detection Algorithms on Longitudinal Citation
Data&quot;, &lt;a href=&quot;http://arxiv.org/abs/0908.0449&quot;&gt;arxiv:0908.0449&lt;/a&gt;
	&lt;li&gt;U. Brandes, D. Delling, M. Gaertler, R. Goerke, M. Hoefer,
Z. Nikoloski, and D. Wagner, &quot;Maximizing Modularity is
hard&quot;, &lt;a href=&quot;http://arxiv.org/abs/physics/0608255&quot;&gt;physics/0608255&lt;/a&gt;
[i.e., maximizing Newman's Q is NP hard.  I haven't read beyond the
abstract yet, so I don't know if they address the question of what makes it
hard in the hard cases, and whether those are properties we should expect to
see in real-world networks.  Conceivably, actual social networks are, on
average, easy to modularize...]
	&lt;li&gt;Andrea Capocci, Vito D. P. Servedio, Guido Caldarelli, Francesca
Colaiori, &quot;Detecting communities in large networks&quot;, &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0402499&quot;&gt;cond-mat/0402499&lt;/a&gt;
	&lt;li&gt;Horacio Castellini and Lilia Romanelli, &quot;Social network from
communities of electronic
mail&quot;, &lt;a href=&quot;http://arxiv.org/abs/nlin.CD/0509021&quot;&gt;nlin.CD/0509021&lt;/a&gt;
	&lt;li&gt;Federica Cerina, Vincenzo De Leo, Marc Barthelemy, Alessandro Chessa, &quot;Spatial correlations in attribute communities&quot;, &lt;a href=&quot;http://arxiv.org/abs/1112.3308&quot;&gt;arxiv:1112.3308&lt;/a&gt;
	&lt;li&gt;Antoine Channarond, Jean-Jacques Daudin, St&amp;eacute;phane Robin, &quot;Classification and estimation in the Stochastic Block Model based on the empirical degrees&quot;, &lt;a href=&quot;http://arxiv.org/abs/1110.6517&quot;&gt;arxiv:1110.6517&lt;/a&gt;
	&lt;li&gt;Sanjeev Chauhan, Michelle Girvan and Edward Ott, &quot;&quot;,
&lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.80.056114&quot;&gt;&lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;80&lt;/strong&gt;
(2009): 056114&lt;/a&gt;
	&lt;li&gt;David S. Choi, Patrick J. Wolfe, Edoardo M. Airoldi, &quot;Stochastic blockmodels with growing number of classes&quot;, &lt;a href=&quot;http://arxiv.org/abs/1011.4644&quot;&gt;arxiv:1011.4644&lt;/a&gt;
	&lt;li&gt;Gennaro Cordasco, Luisa Gargano, &quot;Community Detection via Semi-Synchronous Label Propagation Algorithms&quot;, &lt;a href=&quot;http://arxiv.org/abs/1103.4550&quot;&gt;arxiv:1103.4550&lt;/a&gt;
	&lt;li&gt;Leon Danon, Albert D&amp;iacute;az-Guilera, and Alex Arenas, &quot;The
effect of size heterogeneity on community identification in complex
networks&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1088/1742-5468/2006/11/P11010&quot;&gt;&lt;cite&gt;Journal of
Statistical Mechanics: Theory and Experiment&lt;/cite&gt; (2006): P11010&lt;/a&gt;
= &lt;a href=&quot;http://arxiv.org/abs/physics/0601144&quot;&gt;physics/0601144&lt;/a&gt;
	&lt;li&gt;Leon Danon, Albert D&amp;iacute;az-Guilera, Jordi Duch and Alex Arenas,
&quot;Comparing community structure
identification&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1088/1742-5468/2005/09/P09008&quot;&gt;&lt;cite&gt;Journal of
Statistical Mechanics: Theory and Experiment&lt;/cite&gt; (2005): P09008&lt;/a&gt;
= &lt;a href=&quot;http://arxiv.org/abs/cond-mat/0505245&quot;&gt;cond-mat/0505245&lt;/a&gt;
	&lt;li&gt;Bhaskar DasGupta, Devendra Desai, &quot;On the Complexity of Newman's Community Finding Approach for Biological and Social Networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/1102.0969&quot;&gt;arxiv:1102.0969&lt;/a&gt;
	&lt;li&gt;Jordi Duch and Alex Arenas, &quot;Community detection in complex
networks using extremal
optimization&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1103/PhysRevE.72.027104&quot;&gt;&lt;cite&gt;Physical Review
E&lt;/cite&gt; &lt;strong&gt;72&lt;/strong&gt; (2005): 027104&lt;/a&gt;
	&lt;li&gt;Lilia Efimova and Stephanie Hendrick, &quot;In search for a virtual settlement: An exploration of weblog community boundaries&quot; [&lt;a href=&quot;https://doc.novay.nl/dsweb/Get/Document-46041/weblog-community-boundaries.pdf&quot;&gt;PDF reprint&lt;/a&gt;]
	&lt;li&gt;Illes J. Farkas, Daniel Abel, Gergely Palla, Tamas Vicsek,
&quot;Weighted network
modules&quot;, &lt;a href=&quot;http://arxiv.org/abs/cond-mat/0703706&quot;&gt;cond-mat/0703706&lt;/a&gt;
	&lt;li&gt;S. Feldt, J. Waddell, V. L. Hetrick, J. D. Berke, and M. Zochowski,
&quot;Functional clustering algorithm for the analysis of dynamic network
data&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.79.056104&quot;&gt;&lt;cite&gt;Physical
Review E&lt;/cite&gt;
&lt;strong&gt;79&lt;/strong&gt; (2009): 056104&lt;/a&gt;
	&lt;li&gt;Daniel J. Fenn, Mason A. Porter, Mark McDonald, Stacy Williams, Neil F. Johnson, Nick S. Jones, &quot;Dynamic communities in multichannel data: An application to the foreign exchange market during the 2007--2008 credit crisis&quot;, &lt;a href=&quot;http://arxiv.org/abs/0811.3988&quot;&gt;arxiv:0811.3988&lt;/a&gt;
	&lt;li&gt;Daniel J. Fenn, Mason A. Porter, Peter J. Mucha, Mark McDonald, Stacy Williams, Neil F. Johnson, Nick S. Jones, &quot;Dynamical Clustering of Exchange Rates&quot;, &lt;a href=&quot;http://arxiv.org/abs/0905.4912&quot;&gt;arxiv:0905.4912&lt;/a&gt;
	&lt;li&gt;Sam Field, Kenneth A. Frank, Kathryn Schiller, Catherine
Riegle-Crumb and Chandra Muller, &quot;Identifying positions from affiliation
networks: Preserving the duality of people and
events&quot;, &lt;a href=&quot;http://dx.doi.org/10.1016/j.socnet.2005.04.005&quot;&gt;&lt;cite&gt;Social
Networks&lt;/cite&gt;
&lt;strong&gt;28&lt;/strong&gt; (2006): 97--123&lt;/a&gt;
	&lt;li&gt;G. W. Flake, S. R. Lawrence, C. L. Giles and F. M. Coetzee,
&quot;Self-organization and identification of Web communities&quot;, &lt;cite&gt;IEEE
Computer&lt;/cite&gt; &lt;strong&gt;36&lt;/strong&gt; (2002): 66--71
	&lt;li&gt;Santo Fortunato, &quot;Community detection in
graphs&quot;, &lt;a href=&quot;http://arxiv.org/abs/0906.0612&quot;&gt;arxiv:0906.0612&lt;/a&gt;
	&lt;li&gt;Santo Fortunato and Marc Bath&amp;eacute;lemy, &quot;Resolution limit in
community
detection&quot;, &lt;a href=&quot;http://arxiv.org/abs/physics/0607100&quot;&gt;physics/0607100&lt;/a&gt;
= &lt;a href=&quot;http://dx.doi.org/10.1073/pnas.0605965104&quot;&gt;cite&gt;Proceedings of the
National Academy of Sciences&lt;/cite&gt; (USA) &lt;strong&gt;104&lt;/strong&gt; (2007):
36--41&lt;/a&gt;
	&lt;li&gt;Santo Fortunato and Claudio Castellano, &quot;Community Structure in Graphs&quot;, &lt;a href=&quot;http://arxiv.org/abs/0712.2716&quot;&gt;arxiv:0712.2716&lt;/a&gt; [Review
paper; thanks to &lt;a href=&quot;http://vielmetti.typepad.com/vacuum&quot;&gt;Ed Vielmetti&lt;/a&gt; for the pointer]
	&lt;li&gt;Santo Fortunato, Vito Latora and Massimo Marchiori, &quot;A Method to
Find Community Structures Based on Information Centrality&quot;, &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0402522&quot;&gt;cond-mat/0402522&lt;/a&gt;
	&lt;li&gt;Kenneth A. Frank, &quot;Identifying Cohesive Subgroups&quot;,
&lt;cite&gt;Social Networks&lt;/cite&gt; &lt;strong&gt;17&lt;/strong&gt; (1995): 27--56
	&lt;li&gt;Adrien Friggeri, Guillaume Chelius, Eric Fleury,
&quot;Triangles to Capture Social Cohesion&quot;, &lt;a href=&quot;http://arxiv.org/abs/1107.3231&quot;&gt;arxiv:1107.3231&lt;/a&gt;
	&lt;li&gt;David Gfeller, Jean-C&amp;eacute;dric Chappelier, and Paolo De Los Rios,
&quot;Finding instabilities in the community structure of complex networks&quot;,
&lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.72.056135&quot;&gt;&lt;cite&gt;Physical Review
E&lt;/cite&gt; &lt;strong&gt;72&lt;/strong&gt; (2005): 056135&lt;/a&gt;
	&lt;li&gt;Rumi Ghosh, Kristina Lerman, &quot;Structure of Heterogeneous Networks&quot;,
&lt;a href=&quot;http://arxiv.org/abs/0906.2212&quot;&gt;arxiv:0906.2212&lt;/a&gt;
	&lt;li&gt;V. Gol'dshtein and G. A. Koganov, &quot;An indicator for community
structure&quot;, &lt;a href=&quot;http://arxiv.org/abs/physics/0607159&quot;&gt;physics/0607159&lt;/a&gt;
	&lt;li&gt;Sergio Gomez, Pablo Jensen, Alex Arenas, &quot;Analysis of community
structure in networks of correlated
data&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.80.016114&quot;&gt;&lt;cite&gt;Physical
Review E&lt;/cite&gt; &lt;strong&gt;80&lt;/strong&gt; (2009):
016114&lt;/a&gt;, &lt;a href=&quot;http://arxiv.org/abs/0812.2030&quot;&gt;arxiv:0812.2030&lt;/a&gt;
	&lt;li&gt;Benjamin H. Good, Yves-Alexandre de Montjoye, Aaron Clauset, &quot;The performance of modularity maximization in practical contexts&quot;, &lt;a href=&quot;http://arxiv.org/abs/0910.0165&quot;&gt;arxiv:0910.0165&lt;/a&gt;
	&lt;li&gt;Clara Granell, Sergio Gomez, Alex Arenas, &quot;Mesoscopic analysis of networks: applications to exploratory analysis and data clustering&quot;, &lt;a href=&quot;http://arxiv.org/abs/1101.1811&quot;&gt;arxiv:1101.1811&lt;/a&gt;
	&lt;li&gt;&lt;a href=&quot;&quot;&gt;Mark S. Handcock&lt;/a&gt;, Adrian E. Raftery and Jeremy Tantrum, &quot;Model-Based Clustering for Social Networks&quot; &lt;cite&gt;Journal of the Royal Statistical Society A&lt;/cite&gt; &lt;strong&gt;170&lt;/strong&gt; (2007): 301--354
[&lt;a href=&quot;http://www.csss.washington.edu/Papers/wp46.pdf&quot;&gt;PDF preprint&lt;/a&gt;]
	&lt;li&gt;M. B. Hastings, &quot;Community detection as an inference problem&quot;,
&lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.74.035102&quot;&gt;&lt;cite&gt;Physical Review
E&lt;/cite&gt; &lt;strong&gt;74&lt;/strong&gt; (2006): 035102&lt;/a&gt;
= &lt;a href=&quot;http://arxiv.org/abs/cond-mat/0604429&quot;&gt;cond-mat/0604429&lt;/a&gt;
	&lt;li&gt;Frank Havemann, Michael Heinz, Alexander Struck, Jochen Gl&amp;auml;ser,
&quot;Identification of Overlapping Communities by Locally Calculating Community-Changing Resolution Levels&quot;, &lt;cite&gt;Journal of Statistical Mechanics: Theory and Experiment&lt;/cite&gt; (2011): P01023, &lt;a href=&quot;http://arxiv.org/abs/1008.1004&quot;&gt;arxiv:1008.1004&lt;/a&gt;
	&lt;li&gt;Qirong Ho, Le Song, Eric Xing, &quot;Evolving Cluster Mixed-Membership Blockmodel for Time-Evolving Networks&quot;, &lt;a href=&quot;http://jmlr.csail.mit.edu/proceedings/papers/v15/ho11b.html&quot;&gt;AISTATS 2011&lt;/a&gt;
	&lt;li&gt;Qirong Ho, Ankur Parikh, Le Song, Eric Xing, &quot;Multiscale Community Blockmodel for Network Exploration&quot;, &lt;a href=&quot;http://jmlr.csail.mit.edu/proceedings/papers/v15/ho11a.html&quot;&gt;AISTATS 2011&lt;/a&gt;
	&lt;li&gt;Erik Holmstr&amp;ouml;m, Nicolas Bock and Joan Br&amp;auml;nnlund, &quot;Density
Analysis of Network Community Divisions&quot;, &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0608612&quot;&gt;cond-mat/0608612&lt;/a&gt;
	&lt;li&gt;Yanqing Hu, Yuchao Nie, Hua Yang, Jie Cheng, Ying Fan, and Zengru Di,  &quot;Measuring the significance of community structure in complex networks&quot;,
&lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.82.066106&quot;&gt;&lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;82&lt;/strong&gt;
(2010): 066106&lt;/a&gt;
	&lt;li&gt;I. Ispolatov, I. Mazo, A. Yuryev, &quot;Finding mesoscopic communities
in sparse
networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/q-bio.MN/0512038&quot;&gt;q-bio.MN/0512038&lt;/a&gt;
= &lt;cite&gt;Journal of Statistical Mechanics&lt;/cite&gt; (2006): P09014
	&lt;li&gt;Brian Karrer, Elizaveta Levina, M. E. J. Newman, &quot;Robustness of
community structure in
networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/0709.2108&quot;&gt;arxiv:0709.2108&lt;/a&gt;
	&lt;li&gt;Alireza Khadivi, Ali Ajdari Rad, and Martin Hasler, &quot;Network
community-detection enhancement by proper
weighting&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.83.046104&quot;&gt;&lt;cite&gt;Physical
Review E&lt;/cite&gt; &lt;strong&gt;83&lt;/strong&gt; (2011): 046104&lt;/a&gt;
	&lt;li&gt;Jussi M. Kumpula, Jari Saramaki, Kimmo Kaski, and Janos Kertesz,
&quot;Resolution limit in complex network community detection with Potts model
approach&quot;,&lt;a href=&quot;http://arxiv.org/abs/cond-mat/0610370&quot;&gt;cond-mat/0610370&lt;/a&gt;
	&lt;li&gt;Darong Lai, Christine Nardini and Hongtao Lu, &quot;Partitioning
networks into communities by message passing&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.83.016115&quot;&gt;&lt;citE&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;83&lt;/strong&gt; (2011): 016115&lt;/a&gt;
	&lt;li&gt;Renaud Lambiotte, &quot;Multi-scale Modularity in Complex Networks&quot;,
&lt;a href=&quot;http://arxiv.org/abs/1004.4268&quot;&gt;arxiv:1004.4268&lt;/a&gt;
	&lt;li&gt;Andrea Lancichinetti, Santo Fortunato
		&lt;ul&gt;
		&lt;li&gt;&quot;Benchmarks for testing
community detection algorithms on directed and weighted graphs with overlapping
communities&quot;, &lt;a href=&quot;http://arxiv.org/abs/0904.3940&quot;&gt;arxiv:0904.3940&lt;/a&gt;
		&lt;li&gt;&quot;Community detection algorithms: A comparative
analysis&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.80.056117&quot;&gt;&lt;cite&gt;Physical
Review E&lt;/citE&gt; &lt;strong&gt;80&lt;/strong&gt; (2009): 056117&lt;/a&gt;
		&lt;li&gt;&quot;Limits of modularity maximization in community detection&quot;, &lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;84&lt;/strong&gt; (2011): 066122, &lt;a href=&quot;http://arxiv.org/abs/1107.1155&quot;&gt;arxiv:1107.1155&lt;/a&gt;
		&lt;li&gt;&quot;Consensus clustering in complex networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/1203.6093&quot;&gt;arxiv:1203.6093&lt;/a&gt;
		&lt;/ul&gt;
	&lt;li&gt;Andrea Lancichinetti, Filippo Radicchi, Jose' Javier Ramasco, Santo Fortunato, &quot;Finding statistically significant communities in networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/1012.2363&quot;&gt;arxiv:1012.2363&lt;/a&gt;
	&lt;li&gt;Pierre Latouche, Etienne Birmel&amp;eacute;, and Christophe Ambroise, &quot;Overlapping stochastic block models with application to the French political blogosphere&quot;, &lt;a href=&quot;http://projecteuclid.org/euclid.aoas/1300715192&quot;&gt;&lt;cite&gt;Annals of Applied Statistics&lt;/cite&gt; &lt;strong&gt;5&lt;/strong&gt; (2011): 309--336&lt;/a&gt;, &lt;a href=&quot;http://arxiv.org/abs/0910.2098&quot;&gt;arxiv:0910.2098&lt;/a&gt;
	&lt;li&gt;Sune Lehmann, Martin Schwartz, Lars Kai Hansen, &quot;Bi-clique
Communities&quot;, &lt;a href=&quot;http://arxiv.org/abs/0710.4867&quot;&gt;arxiv:0710.4867&lt;/a&gt;
	&lt;li&gt;Michele Leone, Sumedha, Martin Weigt, &quot;Clustering by
soft-constraint affinity propagation: Applications to gene-expression
data&quot;, &lt;a href=&quot;http://arxiv.org/abs/0705.2646&quot;&gt;arxiv:0705.2646&lt;/a&gt;
	&lt;li&gt;Jure Leskovec, Kevin J. Lang, Anirban Dasgupta and Michael
W. Mahoney, &quot;Community Structure in Large Networks: Natural Cluster Sizes and
the Absence of Large Well-Defined
Clusters&quot;, &lt;a href=&quot;http://arxiv.org/abs/0810.1355&quot;&gt;arxiv:0810.1355&lt;/a&gt;
	&lt;li&gt;Ian X.Y. Leung, Pan Hui, Pietro Lio', Jon Crowcroft, &quot;Towards Real
Time Community Detection in Large
Networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/0808.2633&quot;&gt;arxiv:0808.2633&lt;/a&gt;
	&lt;li&gt;D. Liu, N. Blenn, P. Van Mieghem, &quot;Modeling Social Networks with Overlapping Communities Using Hypergraphs and Their Line Graphs&quot;, &lt;a href=&quot;http://arxiv.org/abs/1012.2774&quot;&gt;arxiv:1012.2774&lt;/a&gt;
	&lt;li&gt;Claire P. Massen, Jonathan P. K. Doye, &quot;Thermodynamics of Community
Structure&quot;, &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0610077&quot;&gt;cond-mat/0610077&lt;/a&gt;
	&lt;li&gt;Aaron F. McDaid, Derek Greene, Neil Hurley, &quot;Normalized Mutual Information to evaluate overlapping community finding algorithms&quot;, &lt;a href=&quot;http://arxiv.org/abs/1110.2515&quot;&gt;arxiv:1110.2515&lt;/a&gt;
	&lt;li&gt;Aaron F. McDaid, Thomas Brendan Murphy, Nial Friel, Neil J Hurley, &quot;Clustering in networks with the collapsed Stochastic Block Model&quot;, &lt;a href=&quot;http://arxiv.org/abs/1203.3083&quot;&gt;arxiv:1203.3083&lt;/a&gt;
	&lt;li&gt;A. D. Medus and C. O. Dorso, &quot;Alternative approach to community
detection in networks&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.79.066111&quot;&gt;&lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;79&lt;/strong&gt; (2009): 066111&lt;/a&gt;
	&lt;li&gt;Atieh Mirshahvalad, Johan Lindholm, Mattias Derlen, Martin Rosvall, &quot;Significant communities in large sparse networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/1110.0305&quot;&gt;arxiv:1110.0305&lt;/a&gt;
	&lt;li&gt;Bivas Mitra, Lionel Tabourier, Camille Roth, &quot;Intrinsically Dynamic Network Communities&quot;, &lt;a href=&quot;http://arxiv.org/abs/1111.2018&quot;&gt;arxiv:1111.2018&lt;/a&gt;
	&lt;li&gt;Stefanie Muff, Francesco Rao, and Amedeo Caflisch, &quot;Local
modularity measure for network clusterizations&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1103/PhysRevE.72.056107&quot;&gt;&lt;cite&gt;Physical Review
E&lt;/cite&gt; &lt;strong&gt;72&lt;/strong&gt; (2005): 056107&lt;/a&gt;
	&lt;li&gt;Takashi Nishikawa, Adilson E. Motter, &quot;Discovering Network Structure Beyond Communities&quot;, &lt;a href=&quot;http://arxiv.org/abs/1111.6115&quot;&gt;arxiv:1111.6115&lt;/a&gt;
	&lt;li&gt;Andreas Noack, &quot;Modularity clustering is force-directed
layout&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.79.026102&quot;&gt;&lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;79&lt;/strong&gt; (2009): 026102&lt;/a&gt; &lt;a href=&quot;http://arxiv.org/abs/0807.4052&quot;&gt;arxiv:0807.4052&lt;/a&gt;
	&lt;li&gt;Gergely Palla, Imre Derenyi, Illes Farkas and Tamas Vicsek,
&quot;Uncovering the overlapping community structure of complex networks in nature
and society&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1038/nature03607&quot;&gt;&lt;cite&gt;Nature&lt;/cite&gt; &lt;strong&gt;435&lt;/strong&gt;
(2005): 814--818&lt;/a&gt; = &lt;a
href=&quot;http://arxiv.org/abs/physics/0506133&quot;&gt;physics/0506133&lt;/a&gt;
	&lt;li&gt;Gergely Palla, Illes J. Farkas, Peter Pollner, Imre Derenyi, Tamas
Vicsek, &quot;Directed network
modules&quot;, &lt;a href=&quot;http://arxiv.org/abs/physics/0703248&quot;&gt;physics/0703248&lt;/a&gt;
	&lt;li&gt;Carlo Piccardi, &quot;Finding and testing network communities by lumped Markov chains&quot;, &lt;a href=&quot;http://arxiv.org/abs/1106.0596&quot;&gt;arxiv:1106.0596&lt;/a&gt;
	&lt;li&gt;Nicolas Pissard and Houssem Assadi, &quot;Detecting overlapping
communities in linear time with P&amp;amp;A
algorithm&quot;, &lt;a href=&quot;http://arxiv.org/abs/physics/0509254&quot;&gt;physics/0509254&lt;/a&gt;
	&lt;li&gt;Pascal Pons, &quot;Post-Processing Hierarchical Community Structures:
Quality Improvements and Multi-scale
View&quot;, &lt;a href=&quot;http://arxiv.org/abs/cs.DS/0608050&quot;&gt;cs.DS/0608050&lt;/a&gt;
	&lt;li&gt;Mason A. Porter, Jukka-Pekka Onnela, Peter J. Mucha, &quot;Communities
in Networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/0902.3788&quot;&gt;arxiv:0902.3788&lt;/a&gt;
	&lt;li&gt;Ioannis Psorakis, Stephen Roberts, Ben Sheldon, &quot;Efficient Bayesian Community Detection using Non-negative Matrix Factorisation&quot;, &lt;a href=&quot;http://arxiv.org/abs/1009.2646&quot;&gt;arxiv:1009.2646&lt;/a&gt;
	&lt;li&gt;Josep M. Pujol, Javier B&amp;eacute;jar, and Jordi Delgado, &quot;Clustering
algorithm for determining community structure in large networks&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1103/PhysRevE.74.016107&quot;&gt;&lt;cite&gt;Physical Review
E&lt;/citE&gt; &lt;strong&gt;74&lt;/strong&gt; (2006): 016107&lt;/a&gt;
	&lt;li&gt;Francisco A. Rodrigues, Gonzalo Travieso, Luciano da F. Costa,
&quot;Fast Community Identification by Hierarchical
Growth&quot;, &lt;a href=&quot;http://arxiv.org/abs/physics/0602144&quot;&gt;physics/0602144&lt;/a&gt;
	&lt;li&gt;Huaijun Qiu and Edwin R. Hancock, &quot;Graph matching and clustering
using spectral
partitions&quot;, &lt;a
hrf=&quot;http://dx.doi.org/10.1016/j.patcog.2005.06.014&quot;&gt;&lt;cite&gt;Pattern
Recognition&lt;/cite&gt; &lt;strong&gt;39&lt;/strong&gt; (2006): 22--34&lt;/a&gt; [In this context, for
the ideas on hierarchical decomposition, which sounds like it might work 
for community discovery, if in fact it's not equivalent to some existing
community-discovery algorithm.]
	&lt;li&gt;Filippo Radicchi, Andrea Lancichinetti and Jos&amp;eacute; J. Ramasco,
&quot;Combinatorial approach to modularity&quot;, &lt;citE&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;82&lt;/strong&gt; (2010): 026102, &lt;a href=&quot;http://arxiv.org/abs/1004.5283&quot;&gt;arxiv:1004.5283&lt;/a&gt;
	&lt;li&gt;Usha Nandini Raghavan, Reka Albert, Soundar Kumara, &quot;Near linear
time algorithm to detect community structures in large-scale
networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/0709.2938&quot;&gt;arxiv:0709.2938&lt;/a&gt; [&quot;every
node is initialized with a unique label and at every step each node adopts the
label that most of its neighbors currently have&quot;]
	&lt;li&gt;Anil Raj, Chris H. Wiggins, &quot;An information-theoretic derivation of min-cut based clustering&quot;, &lt;a href=&quot;http://arxiv.org/abs/0811.4208&quot;&gt;arxiv:0811.4208&lt;/a&gt; [I'm not sure if &quot;explained over drinks&quot; counts as &quot;heard the talk&quot;]
	&lt;li&gt;J&amp;ouml;rg Reichardt and Stefan Bornholdt, &quot;When are networks truly
modular?&quot;, &lt;a href=&quot;http://arxiv.org/abs/cond-mat/0606220&quot;&gt;cond-mat/0606220&lt;/a&gt;
	&lt;li&gt;J&amp;ouml;rg Reichardt and Michele Leone, &quot;(Un)detectable cluster
structure in sparse
networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/0711.1452&quot;&gt;arxiv:0711.1452&lt;/a&gt;
	&lt;li&gt;Fergal Reid, Aaron McDaid, Neil Hurley, &quot;Partitioning Breaks Communities&quot;, &lt;a href=&quot;http://arxiv.org/abs/1105.5344&quot;&gt;arxiv:1105.5344&lt;/a&gt;
	&lt;li&gt;Thomas Richardson, Peter J. Mucha, Mason A. Porter, &quot;Spectral tripartitioning of networks&quot;, &lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;80&lt;/strong&gt;
(2009): 036111, &lt;a href=&quot;http://arxiv.org/abs/0812.2852&quot;&gt;arxiv:0812.2852&lt;/a&gt;
	&lt;li&gt;Daniel M. Romero, Chenhao Tan, Johan Ugander, &quot;Social-Topical Affiliations: The Interplay between Structure and Popularity&quot;, &lt;a href=&quot;http://arxiv.org/abs/1112.1115&quot;&gt;arxiv:1112.1115&lt;/a&gt;
	&lt;li&gt;Peter Ronhovde and Zohar Nussinov, &quot;Local resolution-limit-free
Potts model for community
detection&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.81.046114&quot;&gt;&lt;cite&gt;Physical
Review E&lt;/cite&gt; &lt;strong&gt;81&lt;/strong&gt; (2010): 046114&lt;/a&gt;, &lt;a href=&quot;http://arxiv.org/abs/0812.1072&quot;&gt;arxiv:0812.1072&lt;/a&gt;
	&lt;li&gt;Ryan Rossi, Brian Gallagher, Jennifer Neville, Keith Henderson, &quot;Role-Dynamics: Fast Mining of Large Dynamic Networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/1203.2200&quot;&gt;arxiv:1203.2200&lt;/a&gt;
	&lt;li&gt;Somwrita Sarkar and Andy Dong, &quot;Community detection in graphs using
singular value
decomposition&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.83.046114&quot;&gt;&lt;cite&gt;Physical
Review E&lt;/cite&gt; &lt;strong&gt;83&lt;/strong&gt; (2011): 046114&lt;/a&gt;
	&lt;li&gt;Erin N. Sawardecker, Marta Sales-Pardo, Lu&amp;iacute;s A. Nunes Amaral, &quot;Detection of node group membership in networks with group overlap&quot;, &lt;a href=&quot;http://arxiv.org/abs/0812.1243&quot;&gt;arxiv:0812.1243&lt;/a&gt;
	&lt;li&gt;Michael T. Schaub, Renaud Lambiotte, Mauricio Barahona, &quot;Coding of Markov dynamics for multiscale community detection in complex networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/1109.6642&quot;&gt;arxiv:1109.6642&lt;/a&gt;
	&lt;li&gt;Devavrat Shah, Tauhid Zaman, &quot;Community Detection in Networks: The Leader-Follower Algorithm&quot;, &lt;a href=&quot;http://arxiv.org/abs/1011.0774&quot;&gt;arxiv:1011.0774&lt;/a&gt;
	&lt;li&gt;Janne Sinkkonen, Janne Aukia, Samuel Kaski, &quot;Component models for large networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/0803.1628&quot;&gt;arxiv:0803.1628&lt;/a&gt;
	&lt;li&gt;Tom A.B. Snijders and Krzysztof Nowicki, &quot;Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure&quot;,
&lt;a href=&quot;http://dx.doi.org/10.1007/s003579900004&quot;&gt;&lt;citE&gt;Journal of Classification&lt;/cite&gt;
&lt;strong&gt;14&lt;/strong&gt; (1997): 75--100&lt;/a&gt;
	&lt;li&gt;Matthew Steen, Satoru Hayasaka, Karen Joyce, Paul Laurienti,
&quot;Assessing the consistency of community structure in complex networks&quot;, &lt;cite&gt;Physical
Review E&lt;/cite&gt; &lt;strong&gt;84&lt;/strong&gt; (2011): 016111, &lt;a href=&quot;http://arxiv.org/abs/1106.0041&quot;&gt;arxiv:1106.0041&lt;/a&gt;
	&lt;li&gt;S. Stramaglia, Guo-Rong Wu, M. Pellicoro, D. Marinazzo, &quot;Expanding the Transfer Entropy to Identify Information Subgraphs in Complex Systems&quot;, &lt;a href=&quot;http://arxiv.org/abs/1203.3037&quot;&gt;arxiv:1203.3037&lt;/a&gt;
	&lt;li&gt;Daniel L. Sussman, Minh Tang, Donniell E. Fishkind, Carey E. Priebe, &quot;A consistent dot product embedding for stochastic blockmodel graphs&quot;, &lt;a href=&quot;http://arxiv.org/abs/1108.2228&quot;&gt;arxiv:1108.2228&lt;/a&gt;
	&lt;li&gt;Chayant Tantipathananandh, &lt;a
href=&quot;http://www.cs.uic.edu/~tanyabw/&quot;&gt;Tanya Berger-Wolf&lt;/a&gt; and David Kempe,
&quot;A Framework For Community Identification in Dynamic Social Networks&quot; [&lt;a
href=&quot;http://www.cs.uic.edu/~tanyabw/research/pubs/TantipathananandhEtal_NetworkCommunities07.pdf&quot;&gt;PDF&lt;/a&gt;]
	&lt;li&gt;Gergely Tibely, Marton Karsai, Lauri Kovanen, Kimmo Kaski, Janos Kertesz, Jari Saramaki, &quot;Communities and beyond: mesoscopic analysis of a large social network with complementary methods&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.83.056125&quot;&gt;&lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;83&lt;/strong&gt; (2011): 056125&lt;/a&gt;, &lt;a href=&quot;http://arxiv.org/abs/1006.0418&quot;&gt;arxiv:1006.0418&lt;/a&gt;
	&lt;li&gt;V.A. Traag, P. Van Dooren, Y. Nesterov, &quot;Narrow scope for resolution-free community detection&quot;, &lt;a href=&quot;http://arxiv.org/abs/1104.3083&quot;&gt;arxiv:1104.3083&lt;/a&gt;
	&lt;li&gt;Joshua R. Tyler, Dennis M. Wilkinson and Bernardo A. Huberman,
&quot;Email as Spectroscopy: Automated Discovery of Community Structure within
Organizations,&quot; &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0303264&quot;&gt;cond-mat/0303264&lt;/a&gt;
	&lt;li&gt;I. Vragovic and E. Louis, &quot;Network community structure and loop
coefficient method&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1103/PhysRevE.74.016105&quot;&gt;&lt;cite&gt;Physical
Review E&lt;/cite&gt; &lt;strong&gt;74&lt;/strong&gt; (2006): 016105&lt;/a&gt;
	&lt;li&gt;Matthew L. Wallace, Yves Gingras, Russell Duhon, &quot;A new approach for detecting scientific specialties from raw cocitation networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/0807.4903&quot;&gt;arxiv:0807.4903&lt;/a&gt;
	&lt;li&gt;Haoran Wen, E. A. Leicht and Raissa M. D'Souza,
&quot;Improving community detection in networks by targeted node removal&quot;,
&lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.83.016114&quot;&gt;&lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;83&lt;/strong&gt;
(2011): 016114&lt;/a&gt;
	&lt;li&gt;Huijie Yang, Wenxu Wang, Tao Zhou, Binghong ang and Fangcui Zhao,
&quot;Reconstruct the Hierarchical Structure in a Complex Network&quot;, &lt;a
href=&quot;http://arxiv.org/abs/physics/0508026&quot;&gt;physics/0508026&lt;/a&gt; [&quot;Based upon
the eigenvector centrality (EC) measure, a method is proposed to reconstruct
the hierarchical structure of a complex network. It is tested on the Santa Fe
Institute collaboration network, whose structure is well known.&quot;]
	&lt;li&gt;Hugo Zanghi, Franck Picard, Vincent Miele, Christophe Ambroise, &quot;Strategies for Online Inference of Model-Based Clustering in large Networks&quot;,
&lt;a href=&quot;http://arxiv.org/abs/0910.2034&quot;&gt;arxiv:0910.2034&lt;/a&gt;
	&lt;li&gt;Weituo Zhang, Chjan C. Lim, &quot;The Concentration and Stability of the Community Detecting Functions on Random Networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/1203.5974&quot;&gt;arxiv:1203.5974&lt;/a&gt;
	&lt;li&gt;Yunpeng Zhao, Elizaveta Levina, Ji Zhu, &quot;On Consistency of Community Detection in Networks&quot;, &lt;a href=&quot;http://arxiv.org/abs/1110.3854&quot;&gt;arxiv:1110.3854&lt;/a&gt;
	&lt;li&gt;Haijun Zhou
		&lt;ul&gt;
		&lt;li&gt;&quot;Distance, dissimilarity index, and network community
structure,&quot; &lt;a href=&quot;http://arxiv.org/abs/physics/0302032&quot;&gt;physics/0302032&lt;/a&gt;
		&lt;li&gt;&quot;Network Landscape from a Brownian Particle's
Perspective,&quot; &lt;a
href=&quot;http://arxiv.org/abs/physics/0302030&quot;&gt;physics/0302030&lt;/a&gt;
		&lt;/ul&gt;
	&lt;li&gt;Etay Ziv, Manuel Middendorf and Chris Wiggins, &quot;An
Information-Theoretic Approach to Network Modularity&quot;, &lt;a
href=&quot;http://arxiv.org/abs/q-bio.QM/0411033&quot;&gt;q-bio.QM/0411033&lt;/a&gt;
	&lt;/ul&gt;

&lt;ul&gt;To finish writing:
	&lt;li&gt;&quot;Functional Community Discovery II&quot;
	&lt;/ul&gt;
</description>
  </item>
  </channel>
</rss>
