Automatic network fingerprinting through single-node motifs

PLoS ONE

Volumn 6, Issue 1, 2011, Pages

  Echtermeyer, Christoph ^a   Costa, Luciano da Fontoura ^b   Rodrigues, Francisco A ^b   Kaiser, Marcus ^a,c,d  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

^c NEWCASTLE UNIVERSITY   (United Kingdom)

^d Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER NETWORK; DNA FINGERPRINTING; HIGH THROUGHPUT SCREENING; PROTEIN MOTIF; TIME SERIES ANALYSIS; VALIDATION PROCESS; BIOLOGICAL MODEL; TECHNIQUE; THEORETICAL MODEL;

ALGORITHMS; HIGH-THROUGHPUT SCREENING ASSAYS; METHODS; MODELS, BIOLOGICAL; MODELS, THEORETICAL;

EID: 79551634271     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0015765     Document Type: Article

References (69)

1. Bornholdt S, Schuster HG, eds (2003) Handbook of graphs and networks: from the Genome to the Internet. John Wiley and Sons, 1st edition.
2. Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang D (2006) Complex networks: Structure and dynamics. Physics Reports 424: 175-308.
3. Sporns O, Chialvo DR, Kaiser M, Hilgetag CC (2004) Organization, development and function of complex brain networks. Trends in Cognitive Sciences 8: 418-25.
4. Kaiser M (2007) Brain architecture: a design for natural computation. Philosophical Transactions of the Royal Society A 365: 3033-45.
5. Bullmore E, Sporns O (2009) Complex brain networks: graph theoretical analysis of structural and functional systems. Nature Reviews Neuroscience 10: 186-98.
6. Lazer D, Pentland A, Adamic L, Aral S, Barabási AL, et al. (2009) Social science. Computational social science. Science 323: 721-3.
7. Borgatti SP, Mehra A, Brass DJ, Labianca G (2009) Network analysis in the social sciences. Science 323: 892-5.
8. Centola D (2010) The Spread of Behavior in an Online Social Network Experiment. Science 329: 1194-7.
9. Albert R, Jeong H, Barabási AL (1999) Diameter of the World-Wide Web. Nature 401: 130-1.
10. Faloutsos M, Faloutsos P, Faloutsos C (1999) On Power-Law Relationships of the Internet Topology. In: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication. ACM. pp 251-62.
11. Nowak MA (2006) Five rules for the evolution of cooperation. Science (New York, NY) 314: 1560-3.
12. Szabo G, Fath G (2007) Evolutionary games on graphs. Physics Reports 446: 97-216.
13. Perc M, Szolnoki A (2010) Coevolutionary games-a mini review. BioSystems 99: 109-25.
14. Barthélemy M, Barrat A, Pastor-Satorras R, Vespignani A (2005) Dynamical patterns of epidemic outbreaks in complex heterogeneous networks. Journal of theoretical biology 235: 275-88.
15. Funk S, Salathe M, Jansen VAA (2010) Modelling the influence of human behaviour on the spread of infectious diseases: a review. Journal of The Royal Society Interface.
16. Pastor-Satorras R, Vespignani A (2001) Epidemic Spreading in Scale-Free Networks. Physical Review Letters 86: 3200-3.
17. Meloni S, Arenas A, Moreno Y (2009) Traffic-driven epidemic spreading in finite-size scale-free networks. Proceedings of the National Academy of Sciences of the United States of America 106: 16897-902.
18. Watts DJ (2002) A simple model of global cascades on random networks. Proceedings of the National Academy of Sciences of the United States of America 99: 5766-71.
19. Buldyrev SV, Parshani R, Paul G, Stanley HE, Havlin S (2010) Catastrophic cascade of failures in interdependent networks. Nature 464: 1025-8.
20. Albert R, Jeong H, Barabási AL (2000) Error and attack tolerance of complex networks. Nature 406: 378-82.
21. Kaiser M, Martin R, Andras P, Young MP (2007) Simulation of robustness against lesions of cortical networks. European Journal of Neuroscience 25: 3185-92.
22. Estrada E (2007) Topological structural classes of complex networks. Physical Review E 75: 1-12.
23. Barabási AL (2009) Scale-free networks: a decade and beyond. Science 325: 412-3.
24. Watts DJ, Strogatz SH (1998) Collective dynamics of 'small-world' networks. Nature 393: 440-2.
25. Schnettler S (2009) A structured overview of 50 years of small-world research. Social Networks 31: 165-78.
26. Albert R, Barabási AL (2002) Statistical mechanics of complex networks. Reviews of modern physics 74: 47-97.
27. Newman MEJ (2003) The Structure and Function of Complex Networks. SIAM Review 45: 167-256.
28. Newman MEJ, Barabási AL, Watts DJ (2006) The Structure and Dynamics of Networks. NJ: Princeton University Press.
29. Jeong H, Mason SP, Barabási AL, Oltvai ZN (2001) Lethality and centrality in protein networks. Nature 411: 41-2.
30. Rodrigues FA, Costa LDF (2009) Protein lethality investigated in terms of long range dynamical interactions. Molecular BioSystems 5: 385-90.
31. Perc M (2009) Evolution of cooperation on scale-free networks subject to error and attack. New Journal of Physics 11: 033027.
32. Carmi S, Havlin S, Kirkpatrick S, Shavitt Y, Shir E (2007) A model of Internet topology using k-shell decomposition. Proceedings of the National Academy of Sciences of the United States of America 104: 11150-4.
33. Seidman SB (1983) Network Structure and Minimum Degree. Social Networks 5.
34. Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, et al. (2010) Identification of influential spreaders in complex networks. Nature Physics 6: 888-93.
35. Costa LDF, Rodrigues FA, Travieso G, Boas PRV (2007) Characterization of complex networks: A survey of measurements. Advances in Physics 56: 167-242.
36. Newman MEJ, Leicht EA (2007) Mixture models and exploratory analysis in networks. Proceedings of the National Academy of Sciences of the United States of America 104: 9564-9.
37. Wang J, Lai CH (2008) Detecting groups of similar components in complex networks. New Journal of Physics 10: 123023.
38. Costa LDF, Rodrigues FA (2009) Seeking for simplicity in complex networks. Europhysics Letters 85: 48001.
39. Gross T, Blasius B (2008) Adaptive coevolutionary networks: a review. Journal of the Royal Society, Interface 5: 259-71.
40. Saavedra S, Reed-Tsochas F, Uzzi B (2008) Asymmetric disassembly and robustness in declining networks. Proceedings of the National Academy of Sciences of the United States of America 105: 16466-71.
41. Costa LDF, Rodrigues FA, Hilgetag CC, Kaiser M (2009) Beyond the average: Detecting global singular nodes from local features in complex networks. Europhysics Letters 87: 18008.
42. Ramasco JJ, Mungan M (2008) Inversion method for content-based networks. Physical Review E 77: 036122.
43. Costa LDF, Kaiser M, Hilgetag CC (2007) Predicting the connectivity of primate cortical networks from topological and spatial node properties. BMC Systems Biology 1: 16.
44. Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, et al. (2002) Network motifs: simple building blocks of complex networks. Science 298: 824-7.
45. Johnson RA, Wichern DW (2007) Applied multivariate statistical analysis. Prentice Hall Englewood Cliffs, NJ, USA, 6th edition, 800 p.
46. Parzen E (1962) On Estimation of a Probability Density Function and Mode. The annals of mathematical statistics 33: 1065-76.
47. Duda RO, Hart PE, Stork DG (2001) Pattern classification. Wiley Interscience, 2nd edition, 680 p.
48. Wasserman S, Faust K (1994) Social Network Analysis: Methods and Applications (Structural Analysis in the Social Sciences). Cambridge University Press.
49. Kuramochi M, Karypis G (2001) Frequent Subgraph Discovery. In: Proceedings of the 2001 IEEE International Conference on Data Mining IEEE Computer Society. pp 313-20.
50. Kashtan N, Itzkovitz S, Milo R, Alon U (2004) Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20: 1746-58.
51. Middendorf M, Ziv E, Wiggins CH (2005) Inferring network mechanisms: the Drosophila melanogaster protein interaction network. Proceedings of the National Academy of Sciences of the United States of America 102: 3192-7.
52. Bordino I, Donato D, Gionis A, Leonardi S (2008) Mining Large Networks with Subgraph Counting. In: 8th IEEE International Conference on Data Mining (ICDM). IEEE.
53. Ribeiro P, Silva F, Kaiser M (2009) Strategies for Network Motifs Discovery. In: 5th IEEE International Conference on e-Science. IEEE. pp 80-7.
54. Groening M (2005) The Simpsons Uncensored Family Album. HarperCollins Entertainment.
55. Erdös P, Rényi A (1959) On Random Graphs I. Publ Math (Debrecen) 6: 290-7.
56. Barabási AL, Albert R (1999) Emergence of Scaling in Random Networks. Science 286: 509-12.
57. Kaiser M, Goerner M, Hilgetag CC (2007) Criticality of spreading dynamics in hierarchical cluster networks without inhibition. New Journal of Physics 9: 110.
58. Costa LDF, Silva FN (2006) Hierarchical Characterization of Complex Networks. Journal of Statistical Physics 125: 841-76.
59. Milgram S (1967) The small world problem. Psychology today 2: 60-7.
60. Kochen M, ed (1989) The Small World. Ablex Publishing, Norwood, NJ.
61. Guare J (1994) Six degrees of separation: a play. Vintage Books, 2 edition.
62. Eaton JW (2002) GNU Octave Manual. Limited, Network Theory.
63. Milo R, Itzkovitz S, Kashtan N, Levitt R, Shen-Orr S, et al. (2004) Superfamilies of evolved and designed networks. Science 303: 1538-42.
64. Kaiser M, Hilgetag CC (2004) Edge vulnerability in neural and metabolic networks. Biological cybernetics 90: 311-7.
65. MacKay DJ (2003) Information theory, inference, and learning algorithms. Cambridge University Press, 1st edition.
66. Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Computing Surveys 31: 264-323.
67. Arthur D, Vassilvitskii S (2007) k-means++: The advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics. pp 1027-35.
68. Ozik J, Hunt BR, Ott E (2004) Growing networks with geographical attachment preference: Emergence of small worlds. Physical Review E 69: 026108(5).
69. Mahalanobis PC (1936) On the generalized distance in statistics. Proceedings of the National Institute of Science of India 2: 49-55.