Topological and spectral properties of random digraphs

Abstract

We investigate some topological and spectral properties of Erdos-R\'enyi (ER) random digraphs D(n,p). In terms of topological properties, our primary focus lies in analyzing the number of non-isolated vertices Vx(D) as well as two vertex-degree-based topological indices: the Randi\'c index R(D) and sum-connectivity index (D). First, by performing a scaling analysis we show that the average degree k serves as scaling parameter for the average values of Vx(D), R(D) and (D). Then, we also state expressions relating the number of arcs, spectral radius, and closed walks of length 2 to (n,p), the parameters of ER random digraphs. Concerning spectral properties, we compute six different graph energies on D(n,p). We start by validating k as the scaling parameter of the graph energies. Additionally, we reformulate a set of bounds previously reported in the literature for these energies as a function (n,p). Finally, we phenomenologically state relations between energies that allow us to extend previously known bounds.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…