Directed cycles and related structures in random graphs: I- Static properties

Abstract

We study directed random graphs (random graphs whose edges are directed), and present new results on the so-called strong components of those graphs. We provide analytic and simulation results on two special classes of strong component, called cycle components and knots, which are important in random networks that represent certain computational systems.

References in corpus (4)

• Statistical mechanics of complex networks
• Who is the best connected scientist? A study of scientific coauthorship networks
• The combinatorics of resource sharing
• Directed cycles and related structures in random graphs: II--Dynamic properties

Cited by in corpus (6)

• Functional Integration of Ecological Networks through Pathway Proliferation
• Early appraisal of the fixation probability in directed networks
• Boolean delay equations on networks: An application to economic damage propagation
• Descents and nodal load in scale-free networks
• Directed cycles and related structures in random graphs: II--Dynamic properties
• Reachability and recoverability of sink nodes in growing acyclic directed networks