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

TL;DR

This paper investigates the structure of directed random graphs, focusing on strong components such as cycle components and knots, providing analytical and simulation insights relevant to computational network systems.

Contribution

It introduces new analytical and simulation results on cycle components and knots in directed random graphs, highlighting their significance in computational networks.

Findings

Analytic results on cycle components and knots

Simulation data supporting theoretical findings

Insights into the structure of strong components in directed graphs

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.