On the Distribution of Topological and Spectral Indices on Random Graphs

We perform a detailed statistical study of the distribution of topological and spectral indices on random graphs $G=(V,E)$ in a wide range of connectivity regimes. First, we consider degree-based topological indices (TIs), and focus on two classes of them: $X_Σ(G) = \sum_{uv \in E} f(d_u,d_v)$ and $X_Π(G) = \prod_{uv \in E} g(d_u,d_v)$, where $uv$ denotes the edge of $G$ connecting the vertices $u$ and $v$, $d_u$ is the degree of the vertex $u$, and $f(x,y)$ and $g(x,y)$ are functions of the vertex degrees. Specifically, we apply $X_Σ(G)$ and $X_Π(G)$ on Erdös-Rényi graphs and random geometric graphs along the full transition from almost isolated vertices to mostly connected graphs. While we verify that $P(X_Σ(G))$ converges to a standard normal distribution, we show that $P( X_Π(G))$ converges to a log-normal distribution. In addition we also analyze Revan-degree-based indices and spectral indices (those defined from the eigenvalues and eigenvectors of the graph adjacency matrix). Indeed, for Revan-degree indices, we obtain results equivalent to those for standard degree-based TIs. Instead, for spectral indices, we report two distinct patterns: the distribution of indices defined only from eigenvalues approaches a normal distribution, while the distribution of those indices involving both eigenvalues and eigenvectors approaches a log-normal distribution.

Authors

Institutions

Publication Details

Journal
match Communications in Mathematical and in Computer Chemistry
Published
2026-01-21
DOI
https://doi.org/10.46793/match.96-1.10525
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the Distribution of Topological and Spectral Indices on Random Graphs

C. T. Martínez-Martínez, J. A. Méndez-Bermúdez, R. Aguilar-Sánchez
match Communications in Mathematical and in Computer Chemistry
Graph theory and applications
article

On the Distribution of Topological and Spectral Indices on Random Graphs

C. T. Martínez-Martínez, J. A. Méndez-Bermúdez, R. Aguilar-Sánchez
article en

Abstract

We perform a detailed statistical study of the distribution of topological and spectral indices on random graphs $G=(V,E)$ in a wide range of connectivity regimes. First, we consider degree-based topological indices (TIs), and focus on two classes of them: $X_Σ(G) = \sum_{uv \in E} f(d_u,d_v)$ and $X_Π(G) = \prod_{uv \in E} g(d_u,d_v)$, where $uv$ denotes the edge of $G$ connecting the vertices $u$ and $v$, $d_u$ is the degree of the vertex $u$, and $f(x,y)$ and $g(x,y)$ are functions of the vertex degrees. Specifically, we apply $X_Σ(G)$ and $X_Π(G)$ on Erdös-Rényi graphs and random geometric graphs along the full transition from almost isolated vertices to mostly connected graphs. While we verify that $P(X_Σ(G))$ converges to a standard normal distribution, we show that $P( X_Π(G))$ converges to a log-normal distribution. In addition we also analyze Revan-degree-based indices and spectral indices (those defined from the eigenvalues and eigenvectors of the graph adjacency matrix). Indeed, for Revan-degree indices, we obtain results equivalent to those for standard degree-based TIs. Instead, for spectral indices, we report two distinct patterns: the distribution of indices defined only from eigenvalues approaches a normal distribution, while the distribution of those indices involving both eigenvalues and eigenvectors approaches a log-normal distribution.

match Communications in Mathematical and in Computer ChemistryVol. 1(96)
Universidad Autónoma de Guerrero (MX), Benemérita Universidad Autónoma de Puebla (MX)
Openalex Percentile: Top 97%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.