A uniform random graph model for directed acyclic networks and its effect on motif-finding

Journal of Complex Networks

Volumn 2, Issue 4, 2014, Pages 419-430

  Carstens, C J ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

Citation networks; Complex networks; Directed acyclic graphs; Motifs; Random network models

Indexed keywords

COMPLEX NETWORKS; SWITCHING; TOPOLOGY;

CITATION NETWORKS; DIRECTED ACYCLIC GRAPH (DAG); MOTIFS; RANDOM GRAPH MODELS; RANDOM NETWORK MODELS; REAL-WORLD NETWORKS; SPECIFIC PROPERTIES; SWITCHING METHODS;

DIRECTED GRAPHS;

EID: 84924970402     PISSN: 20511310     EISSN: 20511329     Source Type: Journal    
DOI: 10.1093/comnet/cnu028     Document Type: Article

References (24)

1. Karrer, B. & Newman, M. E. J. (2009) Random graph models for directed acyclic networks. Phys. Rev. E, 80, 046110.
2. Carstens, C. J. (2013) Motifs in directed acyclic networks. In 2013 International Conference on Signal- Image Technology Internet-Based Systems (SITIS), Kyoto, Japan. IEEE, pp. 605-611.
3. Milo, R., S. Shen-Orr, Itzkovitz, S., Kashtan, N., Chklovskii, D. & Alon, U. (2002) Network motifs: simple building blocks of complex networks. Science, 298, 824-827.
4. Milo, R., Kashtan, N., Itzkovitz, S., Newman, M. E. J. & Alon, U. (2003) On the uniform generation of random graphs with prescribed degree sequences. arXiv:cond-mat/0312028 (preprint).
5. Maslov, S. & Sneppen, K. (2002) Specificity and stability in topology of protein networks. Science, 296, 910-913.
6. Wernicke, S. (2005) A faster algorithm for detecting network motifs. Algorithms in Bioinformatics. Lecture Notes in Computer Science, Vol. 3692. Berlin, Heidelberg: Springer, pp. 165-177.
7. Artzy-Randrup, Y. & Stone, L. (2005) Generating uniformly distributed random networks. Phys. Rev. E, 72, 056708.
8. Rao, A. R., Jana, R. & Bandyopadhyay, S. (1996) A Markov chain Monte Carlo method for generating random (0, 1)-matrices with given marginals. Sankhya, 58, 225-242.
9. Berger, A. & Müller-Hannemann, M. (2009) Uniform sampling of undirected and directed graphs with a fixed degree sequence. arXiv:0912.0685 (preprint).
10. Berger, A. & Müller-Hannemann, M. (2010) Uniform sampling of digraphs with a fixed degree sequence. In Graph Theoretic Concepts in Computer Science. Lecture Notes in Computer Science. Berlin Heidelberg: Springer, pp. 220-231.
11. Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., S. Shen-Orr, Ayzenshtat, I., Sheffer, M. & Alon, U. (2004) Superfamilies of evolved and designed networks. Science, 303, 1538-1542.
12. Szpilrajnm, E. (1930) Sur l'extension de l'ordre partiel. Fundam. Math., 16, 1251-1256.
13. Kahn, A. B. (1962) Topological sorting of large networks. Commun. ACM, 5, 558-562.
14. Ajwani, D., Friedrich, T. & Meyer, U. (2006) An algorithm for online topological ordering. Electron. Notes Discrete Math., 25, 7-12.
15. Lovász, L. Random walks on graphs: a survey. In D. Miklós, V. T. Sós, and T. Sz?onyi, eds, Combinatorics, Paul Erd?os is Eighty, vol. 2. János Bolyai Mathematical Society, 1993, pp 353-398.
16. Wong, E., Baur, B., Quader, S. & Huang, C.-H. (2012) Biological network motif detection: principles and practice. Briefings Bioinform., 13, 202-215.
17. Kdd cup dataset. http://www.cs.cornell.edu/projects/kddcup/datasets.html, 2003. Accessed 20 May 2013.
18. Leskovec, J. High-energy physics citation network. http://snap.stanford.edu/data/cit-HepPh.html, 2003. Accessed 19 June 2013.
19. Kashtan, N., Itzkovitz, S., Milo, R. & Alon, U. (2002) MFinder Software. http://www.weizmann.ac.il/ mcb/UriAlon/groupNetworkMotifSW.html. Accessed 29 July 2013.
20. Implementation of Karrer-Newman algorithm and ordered switching method. https://github.com/queenBNE/DirectedAcyclicNetworks, 2014.
21. Csardi, G. & Nepusz, T. (2006) The igraph software package for complex network research. Int. J. Complex Syst., p. 1695.
22. Chen, P., Xie, H., Maslov, S. & Redner, S. (2007) Finding scientific gems with Google's pagerank algorithm. J. Informetrics, 1, 8-15.
23. Wu, Z.-X. & Holme, P. (2009) Modeling scientific-citation patterns and other triangle-rich acyclic networks. Phys. Rev. E, 80, 037101.
24. Goñi, J., Corominas-Murtra, B., Solé, R. V. & Rodríguez-Caso, C. (2010) Exploring the randomness of directed acyclic networks. Phys. Rev. E, 82, 066115.