Exploring the randomness of directed acyclic networks

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 82, Issue 6, 2010, Pages

  Goñi, Joaquín ^a   Corominas Murtra, Bernat ^b   Solé, Ricard V ^b,c,d   Rodríguez Caso, Carlos ^b  

^a UNIVERSITY OF NAVARRA   (Spain)

^b INSTITUCIÓ CATALANA DE RECERCA I ESTUDIS AVANÇATS ICREA   (Spain)

^c SANTA FE INSTITUTE   (United States)

^d INSTITUTE OF EVOLUTIONARY BIOLOGY CSIC UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC NETWORKS; CELL LINEAGE; CITATION NETWORKS; COMPONENT DISTRIBUTIONS; CONFIGURATION MODEL; DEGREE SEQUENCE; DIRECTED ACYCLIC GRAPHS; ELEGANS; FEED-FORWARD; FINITE SIZE; FOOD WEBS; NULL MODEL; REAL SYSTEMS; TIME-DEPENDENT PROCESS; TOPOLOGICAL INVARIANTS;

ECOLOGY; RANDOM PROCESSES; TOPOLOGY;

REAL TIME SYSTEMS;

EID: 78651439508     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.82.066115     Document Type: Article

References (33)

1. D. J. Watts and S. H. Strogatz, Nature (London) 393, 440 (1998). 10.1038/30918
2. M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Phys. Rev. E 64, 026118 (2001). 10.1103/PhysRevE.64.026118
3. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford University Press, Oxford, 2003).
4. R. V. Sole, R. Ferrer-Cancho, J. M. Montoya, and S. Valverde, Complexity 8, 20 (2002). 10.1002/cplx.10055
5. S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, Phys. Rep. 424, 175 (2006). 10.1016/j.physrep.2005.10.009
6. N. Hummon and P. Doreian, Soc. Networks 11, 39 (1989). 10.1016/0378-8733(89)90017-8
7. E. Garfield, I. H. Sher, and R. J. Torpie, Air Force Office of Scientific Research Technical Report No. F49(638)-1256 (The Institute for Scientific Information, Philadelphia, PA, 1964).
8. S. Valverde, R. V. Sole, M. A. Bedau, and N. Packard, Phys. Rev. E 76, 056118 (2007). 10.1103/PhysRevE.76.056118
9. G. Csardi, K. J. Strandburg, L. Zalanyi, J. Tobochnik, and P. Erdi, Physica A 374, 783 (2007). 10.1016/j.physa.2006.08.022
10. J. H. Fowler and S. Jeon, Soc. Networks 30, 16 (2008). 10.1016/j.socnet.2007.05.001
11. S. J. Chandler, The Network Structure of Supreme Court Jurispurdence, University of Houston Law Center No. 2005-W-01 (2005), p. 2005-W-01, http://ssrn.com/abstract=742065.
12. R. Clay, Nonlinear Networks and Systems (John Wiley & Sons Inc., New York, 1971).
13. S. Haykin, Neural Networks: A Comprehensive Foundation (Prentice-Hall, London, 1999).
14. H. Frank and I. T. Frisch, Communication, Transmission and Transportation Networks (Addison-Wesley, Reading, MA, 1971).
15. Random Graphs, edited by, W. Fulton, A. Katok, F. Kirwan, P. Sarnak, B. Simon, and, B. Totaro, (Cambridge University Press, Cambridge, England, 2001).
16. M. Molloy and B. Reed, Random Struct. Algorithms 6, 161 (1995). 10.1002/rsa.3240060204
17. B. Karrer and M. E. J. Newman, Phys. Rev. Lett. 102, 128701 (2009). 10.1103/PhysRevLett.102.128701
18. W. Aiello, F. Chung, and L. Lu, A random graph model for massive graphs, Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2001 (unpublished), pp. 171-180.
19. S. Maslov and K. Sneppen, Science 296, 910 (2002). 10.1126/science. 1065103
20. S. Hanhijarvi, G. Garriga, and K. Puolamaki, Randomization Techniques for Graphs, Proceedings of the 9th SIAM International Conference on Data Mining (2009), http://siam.org/proceeedings/datamining/2009/dm09.php.
21. P. Suppes, Axiomatic Set Theory (Dover, New York, 1960).
22. J. Kelley, General Topology, Graduate Texts in Mathematics Vol. 27 (Van Nostrand, New York, 1955), p. 1975.
23. i, due to the assumption of sparseness. As we shall see in Sec., such an assumption does not hold for some real systems.
24. We observe that we defined an ordering which is just the opposite of the one defined in. The reason for this stems from the interesting role played by order theory to understand the particular properties of DAGs. In this way, in our ordering, a maximal will display a number smaller than any of its neighbors, and the opposite happens in the case of minimal, leading this definition of order to being more intuitive for the reader. It is clear, however, that any choice is equivalent, provided that the construction is internally consistent.
25. C. Rodríguez-Caso, B. Corominas-Murtra, and R. V. Sole, Mol. Biosyst. 5, 1617 (2009). 10.1039/b904960f
26. C. E. Shannon, Bell Syst. Tech. J. 27, 379 (1948).
27. i j = 1 position in A and m and n are the numbers obtained in the randomization method. For the sake of simplicity we avoid the use of this double notation saying that node position is invariant in the matrix.
28. A measure quantifying how random or how deterministic is a structure in relation to the space allowed by the topological invariants was required. The degree-degree joint entropy of a graph holds this property. Other valuable measures, such as assortativity or mutual information, have been pointed out. Assortativity measures degree-degree correlations and degree-degree mutual information quantifies the predictability of neighbors' degrees from the sole knowledge of the degree of a given node in relation to the available degree richness of the system. The former case strictly looks for linear relationships, and it is supposed to be a more appropriate measure for normally distributed data. Furthermore, both approaches naturally require certain degree-degree variance within the graph. For instance, a large feed-forward single chain of nodes has a strong degree-degree determinism that none of these two measurements would capture. The reason is that most of the degree-degree pairs would be (2,2) for undirected and (1,1) for any directed degree analyses. In this sense, degree-degree joint entropy provides a suitable measure of the relation or determinism of degree-degree relations with neither parametric assumptions nor degree-degree variance requisites. Accordingly, we used the concept of degree-degree relations instead of degree-degree correlations.
29. Release WS202, http://www.wormbase.org
30. V. Batagelj and A. Mrvar, Pajek Datasets, http://vlado.fmf.uni-lj.si/pub/ networks/data/
31. M. E. J. Newman, Phys. Rev. Lett. 89, 208701 (2002). 10.1103/PhysRevLett. 89.208701
32. J. G. Foster, D. V. Foster, P. Grassberger, and M. Paczuski, Proc. Natl. Acad. Sci. U.S.A. 107, 10815 (2010). 10.1073/pnas.0912671107
33. R. V. Sole and S. Valverde, Complex Networks, Lecture Notes in Physics (Springer-Verlag, Berlin, 2004), pp. 189-210.