30
B. P. Olding and P. J. Wolfe
Pemantle, R. (2007). A survey of random processes with reinforcement,
Probab.
Surv.
4
, pp. 1–79.
Pothen, A., Simon, H. D. and Liou, K.-P. (1990). Partitioning sparse matrices
with eigenvectors of graphs,
SIAM J. Matrix Anal. Appl.
11
, pp. 430–452.
Radicchi, F., Castellano, C., Cecconi, F., Loreto, V. and Parisi, D. (2004). Defin-
ing and identifying communities in networks,
Proc. Natl. Acad. Sci. USA
101
, pp. 2658–2663.
Reichardt, J. and Bornholdt, S. (2004). Detecting fuzzy community structures in
complex networks with a Potts model,
Phys. Rev. Lett.
93
, pp. 218701(1–4).
Rosvall, M. and Bergstrom, C. T. (2007). An information-theoretic framework
for resolving community structure in complex networks,
Proc. Natl. Acad.
Sci. USA
104
, pp. 7327–7331.
Rosvall, M. and Bergstrom, C. T. (2008). Maps of random walks on complex
networks reveal community structure,
Proc. Natl. Acad. Sci. USA
105
,
pp. 1118–1123.
Snijders, T. A. B. (1981). The degree variance: An index of graph heterogeneity,
Social Networks
3
, pp. 163–223.
Snijders, T. A. B., Pattison, P. E., Robins, G. L. and Handcock, M. S. (2006). New
specifications for exponential random graph models,
Sociolog. Methodol.
36
,
pp. 99–153.
Stutzbach, D., Rejaie, R., Duﬃeld, N., Sen, S. and Willinger, W. (2006). On unbi-
ased sampling for unstructured peer-to-peer networks, in
Proc. 6th ACM
SIGCOMM Conference on Internet Measurement
, pp. 27–40.
Thompson, S. K. (2006). Adaptive web sampling,
Biometrics
62
, pp. 1224–1234.
Viger, F. and Latapy, M. (2005). Eﬃcient and simple generation of random sim-
ple connected graphs with prescribed degree sequence, in L. Wang (ed.),
Proc. 11th Annual International Computing and Combinatorics Conference
(Springer, Berlin), pp. 440–449.