Directed cycles and related structures in random graphs. I: Static properties
From MaRDI portal
Publication:1867892
DOI10.1016/S0378-4371(02)01739-9zbMATH Open1011.05058arXivcond-mat/0309439MaRDI QIDQ1867892FDOQ1867892
Raul Donangelo, Valmir C. Barbosa, Sergio R. Souza
Publication date: 2 April 2003
Published in: Physica A (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/cond-mat/0309439
Recommendations
Cites Work
- Statistical mechanics of complex networks
- Title not available (Why is that?)
- Introduction to algorithms
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A critical point for random graphs with a given degree sequence
- Title not available (Why is that?)
- Title not available (Why is that?)
- The birth of the giant component
- Title not available (Why is that?)
- Paths in graphs
- The structure of scientific collaboration networks
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- The transitive closure of a random digraph
- Models for parallel and distributed computation. Theory, algorithmic techniques and application
- Title not available (Why is that?)
- Directed cycles and related structures in random graphs. I: Static properties
Cited In (9)
- Directed cycles and related structures in random graphs. I: Static properties
- Giant components in three-parameter random directed graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The statistics of random directed graphs
- Functional integration of ecological networks through pathway proliferation
- Boolean delay equations on networks in economics and the geosciences
- First cycles in random directed graph processes
- Counting directed acyclic and elementary digraphs
This page was built for publication: Directed cycles and related structures in random graphs. I: Static properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1867892)