Quantifying randomness in real networks

Nature Communications

Volumn 6, Issue , 2015, Pages

  Orsini, Chiara ^a,b   Dankulov, Marija M ^c,d   Colomer De Simon, Pol ^e   Jamakovic, Almerima ^f   Mahadevan, Priya ^g   Vahdat, Amin ^h   Bassler, Kevin E ^i,j   Toroczkai, Zoltan ^k   Bogunã, Marian ^e   Caldarelli, Guido ^l   Fortunato, Santo ^d   Krioukov, Dmitri ^a,m  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF PISA   (Italy)

^c UNIVERSITY OF BELGRADE   (Serbia)

^d AALTO UNIVERSITY   (Finland)

^e UNIVERSITY OF BARCELONA   (Spain)

^f UNIVERSITY OF BERN   (Switzerland)

^g PALO ALTO RESEARCH CENTER   (United States)

^h GOOGLE INC   (United States)

ⁱ University of Houston   (United States)

^j MAX PLANCK INSTITUT FÜR PHYSIK KOMPLEXER SYSTEME   (Germany)

^k UNIVERSITY OF NOTRE DAME   (United States)

^l IMT SCHOOL FOR ADVANCED STUDIES LUCCA   (Italy)

^m Northeastern University   (United States)

more..

Author keywords

[No Author keywords available]

Indexed keywords

CORRELATION; DATABASE; GRAPHICAL METHOD; INTERNET; NETWORK ANALYSIS; PROTEIN; QUANTITATIVE ANALYSIS; SOFTWARE;

AIRPORT; BRAIN; COMPUTER PROGRAM; FUNCTIONAL MAGNETIC RESONANCE IMAGING; HUMAN; INTERNET; PROTEIN INTERACTION; TRUST;

UNITED STATES;

EID: 84944930378     PISSN: None     EISSN: 20411723     Source Type: Journal    
DOI: 10.1038/ncomms9627     Document Type: Article

References (65)

1. Newman., M. E. J. Networks: An Introduction (Oxford Univ. Press, 2010).
2. Barrat, A. Dynamical Processes on Complex Networks (Cambridge Univ. Press, 2008).
3. Newman., M. E. J. The structure and function of complex networks. SIAM Rev. 45, 167-256 (2003).
4. Adilson, E. Motter and Zoltán Toroczkai. Introduction: optimization in networks. Chaos 17, 026101 (2007).
5. Burda, Z., Krzywicki, A., Martin, O. C., Zagorski, M. Motifs emerge from function in model gene regulatory networks. Proc. Natl Acad. Sci. USA 108, 17263-17268 (2011).
6. Vázquez, A. et al. The topological relationship between the large-scale attributes and local interaction patterns of complex networks. Proc. Natl Acad. Sci. USA 101, 17940-17945 (2004).
7. Guimerá, R., Sales-Pardo, M., Luis, A. N. A. Classes of complex networks defined by role-to-role connectivity profiles. Nat. Phys. 3, 63-69 (2007).
8. Takemoto, K., Oosawa, C., Akutsu, T. Structure of n-clique networks embedded in a complex network. Phys. A 380, 665-672 (2007).
9. Foster, D. V., Foster, J. G., Grassberger, P., Paczuski, M. Clustering drives assortativity and community structure in ensembles of networks. Phys. Rev. E 84, 066117 (2011).
10. Colomer-de-Simón, P., Serrano, M. Á ., Beiró, M. G., Alvarez-Hamelin, J. I., Bogunã, M. Deciphering the global organization of clustering in real complex networks. Sci. Rep. 3, 2517 (2013).
11. Milo, R. et al. Network motifs: simple building blocks of complex networks. Science 298, 824-827 (2002).
12. Markov, N. T. et al. Cortical high-density counterstream architectures. Science 342, 1238406 (2013).
13. Luis, A. Amaral and Roger Guimera. Complex networks: Lies, damned lies and statistics. Nat. Phys. 2, 75-76 (2006).
14. Colizza, V., Flammini, A., Á ngeles Serrano, M., Vespignani, A. Detecting rich-club ordering in complex networks. Nat. Phys. 2, 110-115 (2006).
15. Trevino, III J., Nyberg, A., Del Genio, C. I., Bassler, K. E. Fast and accurate determination of modularity and its effect size. J. Stat. Mech. 15, P02003 (2015).
16. Mahadevan, P., Krioukov, D., Fall, K., Vahdat, A. Systematic topology analysis and generation using degree correlations. Comput. Commun. Rev. 36, 135-146 (2006).
17. Yaverog?lu,Ö . N. et al. Revealing the hidden language of complex networks. Sci. Rep. 4, 4547 (2014).
18. Karrer, B., Newman, M. E. J. Random graphs containing arbitrary distributions of subgraphs. Phys. Rev. E 82, 066118 (2010).
19. Coolen, A. C. C., Fraternali, F., Annibale, A., Fernandes, L., Kleinjung., J. Modelling Biological Networks via Tailored Random Graphs 309-329 (John Wiley & Sons, Ltd, 2011).
20. Coolen, A. C. C., Martino, A., Annibale, A. Constrained Markovian Dynamics of Random Graphs. J. Stat. Phys. 136, 1035-1067 (2009).
21. Annibale, A., Coolen, A. C. C., Fernandes, L., Fraternali, F., Kleinjung, J. Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure. J. Phys. A Math. Gen. 42, 485001 (2009).
22. Roberts, E. S., Schlitt, T., Coolen, A. C. C. Tailored graph ensembles as proxies or null models for real networks II: results on directed graphs. J. Phys. A Math. Theor. 44, 275002 (2011).
23. Roberts, E. S., Coolen, A. C. C. Unbiased degree-preserving randomization of directed binary networks. Phys. Rev. E 85, 046103 (2012).
24. Lovász., L. Large Networks and Graph Limits (American Mathematical Society, 2012).
25. Erdös, P., Rényi., A. On Random Graphs. Publ. Math. 6, 290-297 (1959).
26. Bender, E., Canfield., E. The asymptotic number of labelled graphs with given degree distribution. J. Comb. Theor. A 24, 296-307 (1978).
27. Newman, M. E. J., Strogatz, S. H., Watts, D. J. Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 26118 (2001).
28. Chatterjee, S., Diaconis, P., Sly, A. Random graphs with a given degree sequence. Ann. Appl. Probab. 21, 1400-1435 (2011).
29. Stanton, I., Pinar, A. Constructing and sampling graphs with a prescribed joint degree distribution. J. Exp. Algorithm. 17, 3.1 (2012).
30. Bianconi., G. The entropy of randomized network ensembles. Eur. Lett. 81, 28005 (2008).
31. Barvinok, A., Hartigan., J. A. The number of graphs and a random graph with a given degree sequence. Random Struct. Algorithm. 42, 301-348 (2013).
32. Holland, P. W., Leinhardt, S. An exponential family of probability distributions for directed graphs. J. Am. Stat. Assoc. 76, 33-50 (1981).
33. Park, J., Newman, M. E. J. Statistical mechanics of networks. Phys. Rev. E 70, 66117 (2004).
34. Chatterjee, S., Diaconis, P. Estimating and understanding exponential random graph models. Ann. Stat. 41, 2428-2461 (2013).
35. Horvát, S., Czabarka, É., Toroczkai, Z. Reducing degeneracy in maximum entropy models of networks. Phys. Rev. Lett. 114, 158701 (2015).
36. Squartini, T., Garlaschelli, D. Analytical maximum-likelihood method to detect patterns in real networks. N. J. Phys. 13, 083001 (2011).
37. Squartini, T., Mastrandrea, R., Garlaschelli, D. Unbiased sampling of network ensembles. N. J. Phys. 17, 023052 (2015).
38. Maslov, S., Sneppen, K., Alon, U. Handbook of Graphs and Networks chapter 8 (Wiley-VCH, 2003).
39. Maslov, S., Sneppen, K., Zaliznyak, A. Detection of topological patterns in complex networks: Correlation profile of the Internet. Phys. A 333, 529-540 (2004).
40. Gjoka, M., Kurant, M., Markopoulou, A. In 2013 Proceedings of IEEE INFOCOM 1968-1976 (IEEE, 2013).
41. Kim, H., Toroczkai, Z., Erdös, P. L., Miklós, I., Székely, L. A. Degree-based graph construction. J. Phys. A Math. Theor. 42, 392001 (2009).
42. Del Genio, C. I., Kim, H., Toroczkai, Z., Bassler, K. E. Efficient and exact sampling of simple graphs with given arbitrary degree sequence. PLoS ONE 5, e10012 (2010).
43. Kim, H., Del Genio, C. I., Bassler, K. E., Toroczkai, Z. Constructing and sampling directed graphs with given degree sequences. N. J. Phys. 14, 023012 (2012).
44. Bassler, K. E., Del Genio, C. I., Erdös, P. L., Miklós, I., Toroczkai., Z. Exact sampling of graphs with prescribed degree correlations. N. J. Phys. 17, 083052 (2015).
45. Zlatic, V. et al. On the rich-club effect in dense and weighted networks. Eur. Phys. J. B 67, 271-275 (2009).
46. Czabarka, É ., Dutle, A., Erdös, P. L., Miklós, I. On realizations of a joint degree matrix. Discret. Appl. Math. 181, 283-288 (2015).
47. Jamakovic, A., Mahadevan, P., Vahdat, A., Bogunã, M., Krioukov, D. How small are building blocks of complex networks. Preprint at http://arxiv.org/abs/0908.1143 (2009).
48. Milo, R., Kashtan, N., Itzkovitz, S., Newman, M. E. J., Alon, U. On the uniform generation of random graphs with prescribed degree sequences. Preprint at http://arxiv.org/abs/cond-mat/0312028 (2003).
49. Del Genio, C., Gross, T., Bassler., K. E. All scale-free networks are sparse. Phys. Rev. Lett. 107, 1-4 (2011).
50. Gjoka, M., Tillman, B., Markopoulou, A. in 2015 Proceedings of IEEE INFOCOM. pages 1553-1561 (IEEE, 2015).
51. de Simon, P. C. RandNetGen: a Random Network Generator. URL: http://polcolomer.github.io/RandNetGen
52. Dorogovtsev, S. N., Mendes, J., Samukhin, A. Size-dependent degree distribution of a scale-free growing network. Phys. Rev. E 63, 062101 (2001).
53. Klemm, K., Eguluz, V. Highly clustered scale-free networks. Phys. Rev. E 65, 036123 (2002).
54. Vázquez, A. Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations. Phys. Rev. E 67, 056104 (2003).
55. Serrano, M. Á ., Baguna, M. Tuning clustering in random networks with arbitrary degree distributions. Phys. Rev. E 72, 036133 (2005).
56. Papadopoulos, F., Kitsak, M., Serrano, M. Á., Bogunã, M., Krioukov, D. Popularity versus similarity in growing networks. Nature 489, 537-540 (2012).
57. Bianconi, G., Darst, R. K., Iacovacci, J., Fortunato, S. Triadic closure as a basic generating mechanism of communities in complex networks. Phys. Rev. E 90, 042806 (2014).
58. Kuo, P., Banzhaf, W., Leier, A. Network topology and the evolution of dynamics in an artificial genetic regulatory network model created by whole genome duplication and divergence. Biosystems 85, 177-200 (2006).
59. Medina, A., Lakhina, A., Matta, I., Byers., J. in MASCOTS 2001, Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems 346-353 (Washington, DC, USA, 2001).
60. Dimitropoulos, X., Krioukov, D., Riley, G., Vahdat., A. Graph annotations in modeling complex network topologies. ACM T Model. Comput. S 19, 17 (2009).
61. Foster, D., Foster, J., Paczuski, M., Grassberger, P. Communities, clustering phase transitions, and hysteresis: Pitfalls in constructing network ensembles. Phys. Rev. E 81, 046115 (2010).
62. Roberts, E. S., Coolen, A. C. C. Random graph ensembles with many short loops. In ESAIM Proc. Surv. 47, 97-115 (2014).
63. Bollobás, B., Riordan, O. Sparse graphs: metrics and random models. Random Struct. Algorithm. 39, 1-38 (2011).
64. Borgs, C., Chayes, J. T., Cohn, H., Zhao., Y. An Lp theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions. Preprint at http://arxiv.org/abs/1401.2906 (2014).
65. Beiró, M. G., Alvarez-Hamelin, J. I., Busch., J. R. A low complexity visualization tool that helps to perform complex systems analysis. N. J. Phys. 10, 125003 (2008).