Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 815035, 7 pages
http://dx.doi.org/10.1155/2013/815035
Research Article

Persistent Homology of Collaboration Networks

School of Mathematical and Geospatial Sciences, RMIT University, Melbourne, VIC 3001, Australia

Received 29 March 2013; Accepted 19 May 2013

Academic Editor: Tingwen Huang

Copyright © 2013 C. J. Carstens and K. J. Horadam. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. E. J. Newman, “Analysis of weighted networks,” Physical Review E, vol. 70, no. 5, Article ID 056131, 9 pages, 2004. View at Publisher · View at Google Scholar · View at Scopus
  2. T. Opsahl and P. Panzarasa, “Clustering in weighted networks,” Social Networks, vol. 31, no. 2, pp. 155–163, 2009. View at Publisher · View at Google Scholar · View at Scopus
  3. M. S. Granovetter, “The strength of weak ties,” American Journal of Sociology, vol. 78, no. 6, pp. 1360–1380, 1983. View at Google Scholar
  4. G. Palla, I. Derényi, I. Farkas, and T. Vicsek, “Uncovering the overlapping community structure of complex networks in nature and society,” Nature, vol. 435, no. 7043, pp. 814–818, 2005. View at Publisher · View at Google Scholar · View at Scopus
  5. V. de Silva and R. Ghrist, “Coverage in sensor networks via persistent homology,” Algebraic & Geometric Topology, vol. 7, pp. 339–358, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. D. Horak, S. Maletić, and M. Rajković, “Persistent homology of complex networks,” Journal of Statistical Mechanics, vol. 2009, no. 3, Article ID P03034, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  7. H. Lee, H. Kang, M. K. Chung, B. N. Kim, and D. S. Lee, “Persistent brain network homology from the perspective of dendrogram,” IEEE Transactions on Medical Imaging, vol. 31, no. 12, pp. 2267–2277, 2012. View at Google Scholar
  8. H. Lee, M. K. Chung, H. Kang, B.-N. Kim, and D. S. Lee, “Discriminative persistent homology of brain networks,” in Proceedings of the 8th IEEE International Symposium on Biomedical Imaging: from Nano to Macro (ISBI '11), pp. 841–844, April 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. H. Lee, M. K. Chung, H. Kang, B. N. Kim, and D. S. Lee, “Computing the shape of brain networks using graph filtration and Gromov-Hausdorff metric,” in Proceedings of the 14th International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI '11), vol. 6891, pp. 289–296, 2011.
  10. H. Edelsbrunner and J. Harer, “Persistent homology—a survey,” in Surveys on Discrete and Computational Geometry. Twenty Years Later, vol. 453 of Contemporary Mathematics, pp. 257–282, American Mathematical Society, Providence, RI, USA, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. G. Carlsson, “Topology and data,” Bulletin American Mathematical Society, vol. 46, no. 2, pp. 255–308, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. R. Ghrist, “Barcodes: the persistent topology of data,” Bulletin American Mathematical Society, vol. 45, no. 1, pp. 61–75, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  13. A. Hatcher, Algebraic Topology, Cambridge University Press, Cambridge, Mass, USA, 2002. View at MathSciNet
  14. A. Zomorodian, “Fast construction of the Vietoris-Rips complex,” Computers & Graphics, vol. 34, no. 3, pp. 263–271, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. M. E. J. Newman, “The structure of scientific collaboration networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 98, no. 2, pp. 404–409, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. M. E. J. Newman, “Finding community structure in networks using the eigenvectors of matrices,” Physical Review E, vol. 74, no. 3, Article ID 036104, 19 pages, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  17. D. Cohen-Steiner, H. Edelsbrunner, and J. Harer, “Stability of persistence diagrams,” Discrete & Computational Geometry, vol. 37, no. 1, pp. 103–120, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. P. Erdős and A. Rényi, “On random graphs. I,” Publicationes Mathematicae Debrecen, vol. 6, pp. 290–297, 1959. View at Google Scholar · View at MathSciNet
  19. M. Kahle, “Topology of random clique complexes,” Discrete Mathematics, vol. 309, no. 6, pp. 1658–1671, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. M. Bastian, S. Heymann, and M. Jacomy, “Gephi: an open source software for exploring and manipulating networks,” 2009, http://gephi.org.
  21. A. Tausz, M. Vejdemo-Johansson, and H. Adams, “Javaplex: a research software package for persistent (co)homology,” 2011, http://code.google.com/p/javaplex/.
  22. A. J. Zomorodian, Topology for Computing, vol. 16 of Cambridge Monographs on Applied and Computational Mathematics, Cambridge University Press, New York, NY, USA, 2005. View at Publisher · View at Google Scholar · View at MathSciNet