Directed cycles and related structures in random graphs: II—Dynamic properties
Valmir C. Barbosa,
Raul Donangelo and
Sergio R. Souza
Physica A: Statistical Mechanics and its Applications, 2004, vol. 334, issue 3, 566-582
Abstract:
We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies, one that forces the graph to a condition of near acyclicity at all times and another that allows the appearance of nontrivial directed cycles, we provide analytic and simulation results related to the distributions of degrees. Within the latter strategy, in particular, we investigate the appearance and behavior of the strong components that were our subject in the first part of this study.
Keywords: Random networks; Directed random networks; Evolving networks; Strong components (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437103011063
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:334:y:2004:i:3:p:566-582
DOI: 10.1016/j.physa.2003.11.010
Access Statistics for this article
Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis
More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().