Directed cycles and related structures in random graphs: II--Dynamic properties
Valmir C. Barbosa, Raul Donangelo, Sergio R. Souza
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.
Create a lesson
Related papers
Towards synergy between theory and experiments: First-passage processes under resetting with stochastic return protocols
Ashutosh Dubey, Arnab Pal
Emergent Loop Geometry in Gauge-Equivariant Graph Neural Networks
Ali Rayat, Gia-Wei Chern
Extending the mean first-passage-time formalism to the reconstruction of high free-energy barriers: A top-start approach
Ying Jiang, Ivan Saika-Voivod
Exact Microscopic One-Body Reduction in the Symmetric Exclusion Process
Olivier Bénichou, Aurélien Grabsch
Macroscopic fluctuation theory of stochastic systems undergoing monitoring
João Costa, Pedro Ribeiro, Andrea De Luca
Charge-selective topological locking and ultraslow coarsening in magnetoelastic media
Tirthankar Banerjee, Amaresh Jaiswal