Inference for Graphs and Networks
29
Handcock, M. S., Raftery, A. E. and Tantrum, J. M. (2007). Model-based clus-
tering for social networks,
J. Roy. Statist. Soc. A
170
, pp. 301–354.
Hoff, P. D., Raftery, A. E. and Handcock, M. S. (2002). Latent space approaches
to social network analysis,
J. Amer. Statist. Assoc.
97
, pp. 1090–1098.
Hofman, J. M. and Wiggins, C. H. (2008). Bayesian approach to network modu-
larity,
Phys. Rev. Lett.
100
, pp. 258701(1–4).
Holland, P. W. and Leinhardt, S. (1981). An exponential family of probability
distributions for directed graphs,
J. Amer. Statist. Assoc.
76
, pp. 33–50.
Hunter, D. R., Goodreau, S. M. and Handcock, M. S. (2008). Goodness of fit of
social network models,
J. Amer. Statist. Assoc.
103
, pp. 248–258.
Jin, R. K.-X., Parkes, D. C. and Wolfe, P. J. (2007). Analysis of bidding networks
in eBay: Aggregate preference identification through community detection,
in C. Geib and D. Pynadath (eds),
Plan, Activity, and Intent Recognition
(PAIR): Papers from the 2007 AAAI Workshop
(AAAI Press, Menlo Park,
CA), pp. 66–73.
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S. and Saul, L. K. (1999). An intro-
duction to variational methods for graphical models,
Machine Learn.
37
,
pp. 183–233.
Karrer, B., Levina, E. and Newman, M. E. J. (2008). Robustness of community
structure in networks,
Phys. Rev. E
77
, pp. 46119(1–9).
Krishnamurthy, V., Faloutsos, M., Chrobak, M., Cui, J. H., Lao, L. and Percus,
A. G. (2007). Sampling large Internet topologies for simulation purposes,
Comput. Networks
51
, pp. 4284–4302.
Li, L., Alderson, D., Doyle, J. C. and Willinger, W. (2005). Towards a theory of
scale-free graphs: Definition, properties, and implications,
Internet Math.
2
, pp. 431–523.
Marchette, D. J. and Priebe, C. E. (2008). Predicting unobserved links in incom-
pletely observed networks,
Computat. Statist. Data Anal.
52
, pp. 1373–
1386.