Erdos p and r enyi a 1959 on random graphs publicat

Info icon This preview shows pages 28–30. Sign up to view the full content.

View Full Document Right Arrow Icon
Erd¨os, P. and R´ enyi, A. (1959). On random graphs, Publicat. Mathemat. 6 , pp. 290–297. Fiedler, M. (1973). Algebraic connectivity of graphs, Czech. Math. J. 23 , pp. 298–305. Fortunato, S. and Barth´ elemy, M. (2007). Resolution limit in community detec- tion, Proc. Natl. Acad. Sci. USA 104 , pp. 36–41. Fortunato, S. and Castellano, C. (2007). Community structure in graphs, Unpub- lished manuscript. Available at: . Accessed 09.09.13. Gilbert, E. N. (1959). Random graphs, Ann. Math. Stat. 30 , pp. 1141–1144. Girvan, M. and Newman, M. E. J. (2002). Community structure in social and biological networks, Proc. Natl. Acad. Sci. USA 99 , pp. 7821–7826. Gustafsson, M., H¨ornquist, M. and Lombardi, A. (2006). Comparison and vali- dation of community structures in complex networks, Physica A: Statist. Mech. Appl. 367 , pp. 559–576. Handcock, M. S. and Gile, K. J. (2010). Modeling social networks from sampled data, Ann. Appl. Statist. 4 , pp. 5–25. Copyright © 2014. Imperial College Press. All rights reserved. May not be reproduced in any form without permission from the publisher, except fair uses permitted under U.S. or applicable copyright law. EBSCO Publishing : eBook Collection (EBSCOhost) - printed on 2/16/2016 3:37 AM via CGC-GROUP OF COLLEGES (GHARUAN) AN: 779681 ; Heard, Nicholas, Adams, Niall M..; Data Analysis for Network Cyber-security Account: ns224671
Image of page 28

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
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.
Image of page 29
Image of page 30
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern