Googling the brain: Discovering hierarchical and asymmetric network structures, with applications in neuroscience

Internet Mathematics

Volumn 7, Issue 4, 2011, Pages 233-254

  Crofts, Jonathan J ^a   Higham, Desmond J ^b  

^a NOTTINGHAM TRENT UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84875430378     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2011.604284     Document Type: Article

References (38)

1. Jorgen Bang-Jensen and Gregory Gutin. Digraphs: Theory, Algorithms and Applications. New York: Springer, 2002.
2. S. T. Barnard, A. Pothen, and H. D. Simon. “A Spectral Algorithm for Envelope Reduction in Sparse Matrices.” Numerical Linear Algebra 2 (1995), 317–334.
3. S. P. Borgatti. “Centrality and Network Flow.” Social Networks 27 (2005) 55–71.
4. F. Chen, Z. Chen, Z. Liu, L. Xiang, and Z. Yuan. “Finding and Evaluating the Hierarchical Structure in Complex Networks.” Journal of Physics A: Mathematical and Theoretical 40 (2007), 5013–5023.
5. Fan Chung. Spectral Graph Theory. Providence: American Mathematical Society, 1997.
6. L. da F. Costa, F. A. Rodrigues, G. Travieso, and P. R. Villas Boas. “Characterization of Complex Networks: A Survey of Measurements.” Advances in Physics 56:1 (2007), 167–242.
7. J. J. Crofts and D. J. Higham. “A Weighted Communicability Measure Applied to Complex Brain Networks.” Journal of the Royal Society Interface 6:33 (2009), 411–414.
8. J. J. Crofts, E. Estrada, D. J. Higham, and A. Taylor. “Mapping Directed Networks.” Electronic Transactions in Numerical Analysis 37 (2010), 337–350.
9. Richard Michael Durbin. “Studies on the Development and organization of the Nervous System of Caenorhabditis elegans.” PhD thesis, University of Cambridge, 1987.
10. E. Estrada and N. Hatano. “Statistical-Mechanical Approach to Subgraph Centrality in Complex Networks.” Chemical Physics Letters 439 (2007), 247–251.
11. E. Estrada and N. Hatano. “Communicability in Complex Networks.” Physical Review E 77 (2008), 036111.
12. Ernesto Estrada and Desmond J. Higham. “Network Properties Revealed through Matrix Functions.” SIAM Review 52 (2010), 696–714.
13. E. Estrada and J. A. Rodríguez-Velázquez. “Subgraph Centrality in Complex Networks.” Physical Review E 71 (2005), 056103.
14. E. Estrada, D. J. Higham, and N. Hatano. “Communicability and Multipartite Structure in Complex Networks at Absolute Temperatures.” Physical Review E 78 (2008), 026102.
15. E. Estrada, D. J. Higham, and N. Hatano. “Communicability Betweenness in Complex Networks.” Physica A 388 (2009), 764–774.
16. S. Fortunato. “Community Detection in Graphs.” Physics Reports 486 (201), 75–174.
17. M. Girvan and M. E. Newman. “Community Structure in Social and Biological Networks.” Proceedings of the National Academy of Sciences 99:12 (2002), 7821–7826, 2002.
18. P. Grindrod. “Range-Dependent Random Graphs and Their Application to Modeling Large Small-World Proteome Datasets.” Physical Review E 66 (2002), 066702.
19. P. Grindrod. “Modeling Proteome Networks with Range-Dependent Random Graphs.” American Journal of PharmacoGenomics 3 (2003), 1–4.
20. Peter Grindrod, Desmond J. Higham, Mark C. Parsons, and Ernesto Estrada. “Communicability across Evolving Networks.” Physical Review E (2011), 832011, 046120.
21. D. J. Higham. “Unravelling Small World Networks.” Journal of Computational and Applied Mathematics 158 (2003), 61–74.
22. P. Holme, F. Liljeros, C. R. Edling, and B. J. Kim. “Network Bipartivity.” Physical Review E 68 (2003), 056107.
23. M. Kaiser and C. C. Hilgetag. “Nonoptimal Component Placement, but Short Processing Paths, Due to Long-Distance Projections in Neural Systems.” PLoS Computational Biology 2 (2006), e95.
24. L. Katz. “A New Index Derived from Sociometric Data Analysis.” Psychometrika 18 (1953), 39–43.
25. A. N. Langville and C. D. Meyer. Google’s PageRank and Beyond. Princeton: Princeton University Press, 2006.
26. S. Morita, K. Oshio, Y. Osana, Y. Funabashi, K. Oka, and K. Kawamura. “Geometrical Stucture of the Neuronal Caenorhabditis elegans.” Physica A 298 (2001), 553–561.
27. L. Muchnik, R. Itzhak, S. Solomon, and Y. Louzoun. “Self- Emergence of Knowledge Trees: Extraction of Wikipedia Hierarchies.” Physical Review E 76 (2007), 016106.
28. M. E. J. Newman. “A Measure of Betweeness Centrality Based on Random Walks.” Social Networks 27 (2005), 39–54.
29. M. E. J. Newman. Networks: An Introduction. Oxford: Oxford University Press, 2010.
30. Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. “The PageRank Citation Ranking: Bringing Order to the Web.” Technical report, Stanford Digital Library Technologies Project, 1998.
31. R. K. Pan, N. Chatterjee, and S. Sinha.“Mesoscopic Organization Reveals the Constraints Governing Caenorhabditis elegans Nervous System.” PLoS One 5:2 (2010), e9240.
32. E. Ravasz and A. L. Barabási. “Hierarchical Organization in Complex Networks.” Physical Review E 67 (2003), 026112.
33. O. Sporns and R. Kotter. “Motifs in Brain Networks.” PLoS Biology 2:11 (2004), 1910–1918.
34. Gilbert Strang. Computational Science and Engineering. Wellesley: Wellesley–Cambridge Press, 2008.
35. A. Trusina, S. Maslov, P. Minnhagen, and K. Sneppin. “Hierarchy Measures in Complex Networks.” Physical Review Letters 92:17 (2004), 178702.
36. R. Van Driessche and D. Roose. “An Improved Spectral Bisection Algorithm and Its Application to Dynamic Load Balancing.” Parallel Computing 21 (1995), 29–48.
37. L. R. Varshney, B. L. Chen, E. Paniagua, D. H. Hall, and D. B. Chklovski. “Structural Properties of the Caenorhabditis elegans Neuronal Network.” PLoS Computational Biology 7:2 (2011), e1001066.
38. C. Zhou, L. Zemanova, G. Zamora, C. C. Hilgetag, and J. Kurths. “Hierarchical Organization Unveiled by Functional Connectivity in Complex Brain Networks.” Physical Review Letters 97 (2006), 238103.