Cancer inst 86 pp 829835 anderson c j wasserman s and

Info icon This preview shows pages 27–29. Sign up to view the full content.

View Full Document Right Arrow Icon
Cancer Inst. 86 , pp. 829–835. Anderson, C. J., Wasserman, S. and Crouch, B. (1999). A p primer: Logit models for social networks, Social Networks 21 , pp. 37–66. Banks, D. and Constantine, G. M. (1998). Metric models for random graphs, J. Classificat. 15 , pp. 199–223. Barab´ asi, A. L. (2002). Linked: The New Science of Networks (Perseus Publishing, Cambridge, MA). Barab´ asi, A. L. and Albert, R. (1999). Emergence of scaling in random networks, Science 286 , pp. 509–512. Batada, N. N., Reguly, T., Breitkreutz, A., Boucher, L., Breitkreutz, B.-J., Hurst, L. D. and Tyers, M. (2006). Stratus not altocumulus: A new view of the yeast protein interaction network, PLoS Biology 4 , pp. 1720–1731. Belabbas, M.-A. and Wolfe, P. J. (2009). Spectral methods in machine learning and new strategies for very large data sets, Proc. Natl. Acad. Sci. USA 106 , pp. 369–374. Blitzstein, J. and Diaconis, P. (2011). A sequential importance sampling algorithm for generating random graphs with prescribed degrees, Internet Math. 6 , pp. 489–522. 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 27

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

View Full Document Right Arrow Icon
28 B. P. Olding and P. J. Wolfe Bollob´as, B. and Scott, A. D. (2004). Max Cut for random graphs with a planted partition, Combinat. Probab. Comput. 13 , pp. 451–474. Brandes, U., Delling, D., Gaertler, M., G¨orke, R., Hoefer, M., Nikoloski, Z. and Wagner, D. (2008). On modularity clustering, IEEE Trans. Knowl. Data Eng. 20 , pp. 172–188. Carley, K. and Banks, D. (1993). Nonparametric inference for network data, J. Math. Sociol. 18 , pp. 1–26. Ceyhan, E., Priebe, C. E. and Marchette, D. J. (2007). A new family of random graphs for testing spatial segregation, Canad. J. Statist. 35 , pp. 27–50. Chung, F., Lu, L. and Vu, V. (2003). Spectra of random graphs with given expected degrees, Proc. Natl. Acad. Sci. USA 100 , pp. 6313–6318. Chung, F. R. K. (1997). Spectral Graph Theory (American Mathematical Society, Providence, RI). Clauset, A., Moore, C. and Newman, M. E. J. (2008). Hierarchical structure and the prediction of missing links in networks, Nature 453 , pp. 98–101. Danon, L., Diaz-Guilera, A., Duch, J. and Arenas, A. (2005). Comparing com- munity structure identification, J Statist. Mech. 9 , p. P09008. de Solla Price, D. J. (1965). Networks of scientific papers, Science 149 , pp. 510–515. Dunne, J. A., Williams, R. J. and Martinez, N. D. (2002). Food-web structure and network theory: The role of connectance and size, Proc. Natl. Acad. Sci. USA 99 , pp. 12917–12922. Eagle, N., Pentland, A. and Lazer, D. (2008). Mobile phone data for infer- ring social network structure, in H. Liu, J. J. Salerno and M. J. Young (eds), Social Computing, Behavioral Modeling, and Prediction (Springer, New York, NY), pp. 79–88. Eckmann, J.-P. and Moses, E. (2002). Curvature of co-links uncovers hidden thematic layers in the World Wide Web, Proc. Natl. Acad. Sci. USA 99 , pp. 5825–5829.
Image of page 28
Image of page 29
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