Normalized Sombor Indices as Complexity Measures of Random Networks

We perform a detailed computational study of the recently introduced Sombor indices on random networks. Specifically, we apply Sombor indices on three models of random networks: Erdös-Rényi networks, random geometric graphs, and bipartite random networks. Within a statistical random matrix theory approach, we show that the average values of Sombor indices, normalized to the order of the network, scale with the average degree. Moreover, we discuss the application of average Sombor indices as complexity measures of random networks and, as a consequence, we show that selected normalized Sombor indices are highly correlated with the Shannon entropy of the eigenvectors of the adjacency matrix.


Introduction
Given a network G = (V(G), E(G)), the Sombor index of G, introduced by I. Gutman in [1], is defined as where uv denotes the edge of the network G connecting the vertices u and v and k u is the degree of the vertex u. Additionally, the modified Sombor index of G was proposed in [2] as In addition, two other Sombor indices have been introduced: the first Banhatti-Sombor index [3] BSO(G) = ∑ uv∈E(G) and the α-Sombor index [4] SO α (G) = ∑ uv∈E(G) here α ∈ R. In fact, there is a general index that includes all the Sombor indices listed above: the first (α, β) − KA index of G which was introduced in [5] as with α, β ∈ R. Please note that SO(G) = KA 1 2,1/2 (G), m SO(G) = KA 1 2,−1/2 (G), BSO(G) = KA 1 −2,1/2 (G), and SO α (G) = KA 1 α,1/α (G). Additionally, we note that KA 1 1,β (G) equals the general sum-connectivity index [6] Reduced versions of SO(G), m SO(G) and KA 1 α,β (G) were also introduced in [1,2,7]. However, when dealing with random networks we use to approximate vertex degrees by average degrees and since average degrees may be less than one, reduced degree-based indices are not amenable for us. Thus, we do not consider reduced Sombor indices here.
Even though Sombor indices were introduced very recently, there are already several works available in the literature where these indices are applied to chemical graphs of interest, see e.g., [4,5,[7][8][9][10][11][12][13][14][15][16][17][18]. Additionally, bounds for Sombor indices as well as relations among them and with many other topological indices have been reported in [4,10,[19][20][21][22][23][24]. From the application point of view, they have been shown to be useful to to model entropy and enthalpy of vaporization of alkanes [25]. In addition, the Sombor matrix was proposed and studied in [26]. However, to the best of our knowledge, Sombor indices have not been applied to random networks yet; thus in this work we undertake this task.
Here we consider three models of random networks: Erdös-Rényi (ER) networks, random geometric (RG) graphs, and bipartite random (BR) networks. ER networks [27][28][29][30] G ER (n, p) are formed by n vertices connected independently with probability p ∈ [0, 1], while RG graphs [31,32] G RG (n, r) consist of n vertices uniformly and independently distributed on the unit square, where two vertices are connected by an edge if their Euclidean distance is less or equal than the connection radius r ∈ [0, √ 2]. In addition, we examine BR networks G BR (n 1 , n 2 , p) composed by two disjoint sets, set 1 and set 2, with n 1 and n 2 vertices each such that there are no adjacent vertices within the same set, being n = n 1 + n 2 the total number of vertices in the bipartite network. The vertices of the two sets are connected randomly with probability p ∈ [0, 1].
We stress that the computational study of Sombor indices we perform here is justified by the random nature of the network models we want to explore. Since a given parameter set [(n, p), (n, r), or (n 1 , n 2 , p)] represents an infinite-size ensemble of random [ER, RG, or BR] networks, the computation of a Sombor index on a single network is irrelevant. In contrast, the computation of a Sombor index on a large ensemble of random networks, all characterized by the same parameter set, may provide useful average information about the full ensemble. This statistical approach, well known in random matrix theory studies, is not widespread in studies involving topological indices, mainly because topological indices are not commonly applied to random networks; for very recent exceptions see [33,34].
Therefore, the purpose of this work is threefold. First, we push forward the statistical (computational) analysis of topological indices as a generic tool for studying average properties of random networks; second, we perform for the first time (to our knowledge), a scaling study of Sombor indices on random networks; and third, we discuss the application of selected Sombor indices as complexity measures of random networks.

Sombor Indices on Erdös-Rényi Networks
In what follows we present the average values of the indices defined in Equations (1)- (5). All averages are computed over ensembles of 10 7 /n ER networks characterized by the parameter pair (n, p).
On the one hand, in Figure 1a-c we present, respectively, the average Sombor index SO(G ER ) , the average modified Sombor index m SO(G ER ) , and the average first Banhatti-Sombor index BSO(G ER ) as a function of the probability p of ER networks of sizes n = {125, 250, 500, 1000}. On the other hand, in Figure 2 we plot the average α-Sombor index SO α (G ER ) , see Figure 2a, and the average first (α, β) − KA index KA 1 α,β (G ER ) , see Figure 2c,d, as a function p of ER networks of size n = 1000. In Figure 2 we show curves for α ∈ [−2, 2] and, in the case of KA 1 α,β (G ER ) , we choose to report β = 1/2 and β = 2 as representative cases.
From this figures we observe that: (iii) The curves of KA 1 α,β (G ER ) show three different behaviors as a function of p depending on the values of α and β: For α < α 0 , they grow for small p, approach a maximum value and then decrease when p is further increased. For α > α 0 , they are monotonically increasing functions of p. For α = α 0 the curves saturate above a given value of p. For β = 1/2 and β = 2, the cases reported in Figure 2c,d, we found α 0 = −2 and α 0 = −1/2, respectively. (iv) When np 1, we can approximate Therefore, for np 1, the average values of the Sombor indices are well approximated by: In Figure 1a-c, we show that Equations (7)-(9) (dashed lines) indeed describe well the data (thick full curves) for large enough p. We also verified that Equations (10) and (11) describe well the data for np 1 reported in Figure 2a-c, however we did not include them to avoid figure saturation.
We note that in Figure 1a-c we present average Sombor indices as a function of the probability p of ER networks of four different sizes n. It is quite clear from these figures that the curves, characterized by the different network sizes, are very similar but displaced on both axes. A similar observation can be made for SO α (G ER ) and KA α,β (G ER ) (not shown in Figure 2a From Equations (7) where X and f represent all the Sombor indices studied here and the r.h.s. of Equations (7)-(11), respectively. Therefore, in Figures 1d-f and 2d-f we plot average Sombor indices, normalized to n, as a function of k showing that all indices are now properly scaled; i.e., the curves painted in different colors for different network sizes fall on top of each other. Moreover, we can rewrite Equations (7)-(11) as In Figure 1d-f, we show that Equations (13)-(15) (orange-dashed lines) indeed describe well the data (thick full curves) for k ≥ 10. We also verified that Equations (16) and (17) describe well the data for k ≥ 10 reported in Figure 2d-f (not shown here to avoid figure saturation).
It is relevant to stress that even when Equation (12) was deduced form Equations (7)-(11), expected to be valid in the dense limit (i.e., for k 1), it is indeed valid for any k as clearly seen in Figures 1d-f and 2d-f.

Sombor Indices on Random Geometric Graphs
As in the previous Subsection, here we present the average values of the Sombor indices listed in Equations (1)- (5). Again, all averages are computed over ensembles of 10 7 /n random graphs, each ensemble characterized by a fixed parameter pair (n, r).
Then, in Figure 3a-c we present, respectively, the average Sombor index SO(G RG ) , the average modified Sombor index m SO(G RG ) , and the average first Banhatti-Sombor index BSO(G RG ) as a function of the connection radius r of RG graphs of sizes n = {125, 250, 500, 1000}. Additionally, in Figure 4 we plot the average α-Sombor index SO α (G RG ) , see Figure 4a, and the average first Figure 4c,d, as a function r of RG graphs of size n = 1000. In fact, all the observations (i-iv) made in the previous Subsection for ER networks are also valid for RG graphs by replacing G ER → G RG and p → g(r), with [35] However, given the fact that this is the first study (to our knowledge) of average Sombor indices on RG graphs, we want to stress that when nr 1, we can approximate Therefore, in the dense limit, the average values of the Sombor indices on RG graphs are well approximated by: In Figure 3a-c, we show that Equations (20)-(22) (dashed lines) indeed describe well the data (thick full curves) for large enough r. We also verified that Equations (23) and (24) describe well the data reported in Figure 4a-c, for large enough r, however we did not include them to avoid figure saturation.  It is quite remarkable to note that by substituting the average degree of Equation (19) into Equations (20)- (22) we obtain exactly the same expressions listed in Equations (13)- (17). Therefore, in Figures 3d-f and 4d-f we plot average Sombor indices, on RG graphs, normalized to n, as a function of k showing that all curves are properly scaled. Additionally, in Figure 3d-f, we show that Equations (13)-(15) (orange-dashed lines) indeed describe well the data (thick full curves) for k ≥ 10. We also verified (not shown here) that Equations (16) and (17)

Sombor Indices on Bipartite Random Networks
Now we compute average Sombor indices on ensembles of 10 7 /n BR networks. In contrast to ER and RG networks now the BR network ensembles are characterized by three parameters: n 1 , n 2 , and p. Thus, we consider two cases: n 1 = n 2 and n 1 < n 2 . We note that bounds for the Sombor index on bipartite networks have been reported in [21].
In Figure 5a-c we present, respectively, the average Sombor index SO(G BR ) , the average modified Sombor index m SO(G BR ) , and the average first Banhatti-Sombor index BSO(G BR ) as a function of the probability p of BR networks characterized by n 1 = n 2 with n 2 = {125, 250, 500, 1000} (blue lines) and BR networks characterized by n 1 < n 2 with n 1 = 125 and n 2 = {125, 250, 500, 1000} (red lines). Additionally, in Figure 6 we plot the average α-Sombor index SO α (G BR ) , see Figure 6a, and the average first (α, β) − KA index KA 1 α,β (G BR ) , see Figure 6c,d, as a function p of BR networks of size n 1 = n 2 = 1000. It is interesting to notice that all the observations (i-iv) made in Section 2.2 for ER networks are also valid for BR networks by just replacing G ER → G BR . Moreover, we can also write approximate expressions for the average Sombor indices on BR networks in the dense limit. However, since edges in a bipartite network join vertices of different sets, and we are labeling here the sets as set 1 and set 2, we replace d u by d 1 and d v by d 2 in the expression for the Sombor indices. Thus, when n 1 p 1 and n 2 p 1, we can approximate k u = k 1 ≈ k 1 and k v = k 2 ≈ k 2 in Equations (1)-(5), with Therefore, in the dense limit, the average values of the Sombor indices on BR networks are well approximated by: Above we used |E(G BR )| = n 1 n 2 p. In Figure 5a-c, we show that Equations (26)-(28) (black-dashed lines) indeed describe well the data (thick full curves) for large enough p.
As for ER networks, here for BR networks the average modified Sombor index and the average first Banhatti-Sombor index do not depend on the probability p in the dense limit, see Equations (27) and (28). Additionally, by recognizing the average degrees k 1,2 in Equations (26), (29) and (30), they can be rewritten as Therefore, by plotting SO(G BR ) vs.
and BSO(G BR ) = BSO(G BR ) / n 2 1 + n 2 2 ], see Figure 5d-f, we confirm that the curves of these average Sombor indices on BR networks coincide in the dense limit, as predicted by Equations It is relevant to stress that, while the curves m SO(G BR ) vs. p and BSO(G BR ) vs. p are properly normalized on the vertical axis, they are still not scaled on the p-axis, i.e., the curves of the main panels in Figure 5e,f do not coincide. However, through a scaling approach, it is possible to find the scaling parameter p * = p * (n 1 , n 2 ) such that the curves m SO(G BR ) vs. p and BSO(G BR ) vs. p, with p ≡ p/p * , fall on top of each other. The scaling approach has been successfully used to find universal properties of random graphs and network models, see e.g., [33,34,[36][37][38]. We can summarize this approach, as applied to the modified Sombor index and the first Banhatti-Sombor index on BR networks, in the following steps: (i) plot m SO(G BR ) and BSO(G BR ) as a function of the parameter p, which drives the BR network model from the regime of mostly isolated vertices (MIV) to the regime of mostly connected networks (MCN), so that the MCN regime can be well identified (note that this is done in Figure 5b,c); (ii) normalize m SO(G BR ) and BSO(G BR ) such that m SO(G BR ) = 1 and BSO(G BR ) = 1 in the MCN regime (note that this is done in Figure 5e,f); (iii) define the MIV-to-MCN transition point p * as the value of p such that m SO(G BR ) ≈ C and BSO(G BR ) ≈ C with C = 0.5 (in fact, any value of C ∈ (0, 1) could be used; however we prefer to define p * at half of the MIV-to-MCN transition where it can be easily extracted); (iv) extract numerically p * from the curves m SO(G BR ) vs. p and BSO(G BR ) vs. p; (v) for several combinations of n 1 and n 2 , plot p * vs. n 2 1 + n 2 2 for m SO(G BR ) and p * vs. n 2 1 + n 2 2 /(n 1 n 2 ) for BSO(G BR ) (we note that looking at the dependencies p * vs. n 2 1 + n 2 2 for m SO(G BR ) and p * vs. n 2 1 + n 2 2 /(n 1 n 2 ) were indeed educated guesses that we were able to make due to our previous experience on scaling studies, i.e., we used the functions of n 1 and n 2 that normalized the average indices m SO(G BR ) and BSO(G BR ) , respectively. In absence of any hint, one should plot p * vs. n 1 for fixed n 2 and p * vs. n 2 for fixed n 1 and then deduce the function p * (n 1 , n 2 )); and (vi) discover the dependencies p * = p * (n 1 , n 2 ) through power-law fittings. Indeed, we found that p * = 1/ n 2 1 + n 2 2 for m SO(G BR ) and p * = n 2 1 + n 2 2 /(n 1 n 2 ) for BSO(G BR ) . Thus, as can be seen in the instes of Figure 5e,f, the curves of the main panels are now properly scaled when plotted as a function of p.
It is remarkable to notice that in the case of n 1 = n 2 = n/2, where k 1 = k 2 = k = np/2, we obtain exactly the same expressions listed in Equations (13)- (17). This is verified in Figure 6d-f where we plot average Sombor indices on RG graphs, normalized to n, as a function of k showing that all curves are properly scaled.

General Scaling of Sombor Indices on Random Networks
In the previous Section we have shown that the average value of Sombor indices, normalized to the network size, scale with the average degree k of the corresponding random network models; we note that this also applies to BR networks when n 1 = n 2 . This means that k fixes the average value of any Sombor index for different combinations of network parameters; i.e., the relevant parameter of the random network models we study here is k and not the specific values of the model parameters. This result highlights the relevance of k in random network studies. Moreover, the applicability of Equations (13)- (17) to the three random network models we study here allow us to relate the average value of a given Sombor index X of the three random network models as where k ER , k RG , and k BR are given in Equations (6), (19) and (25), respectively. Now, to verify Equation (34), in Figure 7 we compare normalized Sombor indices, X(G) /n, for ER, RG, and BR networks, as a function of the corresponding k . Please note that to really put Equation (34) to test, we are using networks of different sizes. Indeed, we observe that Equation (34) is satisfied to a good numerical accuracy; that is, we observe the coincidence of the curves X(G) /n vs. k corresponding to different network models.

Sombor Indices as Complexity Mesures for Random Networks
Additionally, we want to recall that in complex systems research there is a continuous search of measures that could serve as complexity indicators. In particular, random matrix theory (RMT) has provided us with several measures able to distinguish between (i) integrable and chaotic (i.e., non-integrable) and (ii) ordered and disordered quantum systems [39,40]. Such measures are computed from the eigenvalues and eigenvectors of quantum Hamiltonian matrices. Examples of eigenvalue-based measures are the distribution of consecutive eigenvalue spacings, the spectrum rigidity and the ratios between consecutive eigenvalue spacings; while the inverse participation ratios and Shannon entropies are popular eigenvector-based complexity measures [39,40]. It is interesting to notice that all these RMT measures have also been successfully applied to study networks and graphs since they can be computed from the eigenvalues and eigenvectors of adjacency matrices; see e.g., [36,37,41] and the references therein. Therefore, these measures are able to distinguish between networks composed by mostly isolated vertices and mostly connected networks. Additionally, through scaling studies of RMT measures it has been possible to locate the percolation transition point of random network models [36,37]. It is worth mentioning that the scaling study of average Sombor indices performed in this paper has followed a statistical RMT approach; that is, from a detailed computational study we have been able to identify the average degree as the universal parameter of our random network models: i.e., the parameter that fixes the average values of the Sombor indices.
Moreover, recently, it was shown for RG graphs that there is a a huge correlation between the average-scaled Shannon entropy (of the adjacency matrix eigenvectors) and two average-scaled topological indices [38]: the Randić index R(G) and the harmonic index H(G). We believe that this is a remarkable result because it validates the use of average topological indices as RMT complexity measures; already suggested in refs. [33,34] for ER random networks. Now, it is important to stress that not every index could be used as a complexity measure. From our experience, we conclude that good candidates should fulfill a particular requirement: they should obtain well defined values in the trivial regimes (just as RMT measures are). For example, a useful complexity measure for random networks should be close to zero in the regime of mostly isolated vertices while it should become constant above the percolation transition. Indeed, this is a property that both R(G) and H(G) have: R(G) ≈ H(G) ≈ 0 for mostly isolated vertices while R(G) /n ≈ H(G) /n ≈ 1/2 once the network is well above the percolation transition. Therefore, a straightforward application of our study on Sombor indices is the identification of specific Sombor indices as complexity measure candidates. Recall that we particularly require, for an average-scaled Sombor index to work as complexity measure, that X(G) /n ≈ const. for large enough k . In fact, from Equations (14) and (15) we can see that the above condition is fulfilled for m SO(G) and BSO(G) , respectively. More generally, by properly choosing the values of α and β in Equation (17) we could also use KA α,β (G) as complexity measure. Specifically, for β = −1/α we obtain Please note that KA 1 α,−1/α (G) reproduces both m SO(G) and BSO(G) when α = 2 and α = −2, respectively. Thus, in Figure 8 we plot 2 1+1/α KA 1 α,−1/α (G) /n as a function of the average degree k for ER, RG, and BR networks. From the behavior of the averagescaled indices reported in Figure 8 we can identify three regimes: (i) a regime of mostly isolated vertices when k < 1/10, where 2 1+1/α KA 1 α,−1/α (G) /n ≈ 0, (ii) a regime corresponding to mostly connected networks when k > 10, where 2 1+1/α KA 1 α,−1/α (G) /n ≈ 1, and (iii) a transition regime in the interval 1/10 < k < 10, which is logarithmically symmetric around the percolation transition point k ≈ 1. Accordingly, we propose the use of KA 1 α,−1/α (G) as complexity measure for random network models.
Correlation between the Average KA 1 α,−1/α (G) Index and the Average Shannon Entropy Since we are proposing the use of KA 1 α,−1/α (G) as a complexity measure for random networks, it is pertinent to compare it to other standard RMT complexity measure. To this end we choose the average Shannon entropy S of the adjacency matrix eigenvectors.
In particular we construct randomly weighted adjacency matrices, see e.g., [38], such that we obtain well-known RMT ensembles in the limits of: (i) isolated vertices (where we obtain random diagonal adjacency matrices, known in RMT as the Poisson ensemble) and (ii) complete networks (where the adjacency matrices become members of the Gaussian Orthogonal Ensemble (GOE)). Specifically, for the normalized eigenvector Ψ i , i.e., ∑ n j=1 |Ψ i j | 2 = 1, S is defined as Then, we use exact numerical diagonalization to obtain the eigenvectors Ψ i (i = 1, . . . , n) of large ensembles of adjacency matrices and compute S , where the average is taken over all the eigenvectors of all the adjacency matrices of the ensemble.
In Figure 8a-c we present S(G) , normalized to S GOE ≈ ln(n/2.07), for ER, RG and BR networks; see the black-dashed lines. From these figures one can observe that

Conclusions
In this paper we have performed a thorough computational study of Sombor indices on random networks. As models of random networks we have used Erdös-Rényi networks, random geometric graphs, and bipartite random networks.
Within a statistical random matrix theory (RMT) approach, we show that the average values of Sombor indices, normalized to the order of the network n, scale with the network average degree k . Thus, we conclude that k is the parameter that fixes the average values of Sombor indices on random networks; see Equations (13)- (17) and (31)-(33) and panels (d-f) of Figures 1-7. Moreover, it is remarkable that we were able to state a scaling law that includes different network models; see Equation (34) and Figure 7. Please note that Equation (34) underlines the relevance of k in random network studies; that is, we conclude that k is the relevant parameter of the network models studied here and not the specific values of the parameters of the models. Moreover, we discuss the application of Sombor indices as complexity measures of random networks and, as a consequence, we show that the average first (α, β) − KA index (with β = −1/α), normalized to n, is highly correlated with the averaged-scaled Shannon entropy of the eigenvectors of the network adjacency matrix; see Equation (35) and Figure 8a-c, i.e., KA 1 α,−1/α (G) /n may serve as complexity measure for random network models. It is pertinent to mention that the use of Sombor indices as complexity measures for random networks has two advantages as compared with standard RMT measures: First, while computing the Shannon entropy of eigenvectors, due to adjacency matrix diagonalization, requires a cubic time complexity, O(n 3 ), computing Sombor indices requires linear time complexity, O(n). Thus, the use of Sombor indices is computationally cheaper than using eigenvalue-or eigenvector-based RMT measures. Second, the Sombor indices we selected as complexity measures, see Equation (35), can be interpreted as a variable descriptor or a general index parametrized by the continuous parameter α ∈ R. Therefore, in contrast with the standard RMT measures (such as the Shannon entropy), we now have a complexity measure that can be fitted to assess specific network properties; as the variable molecular descriptors do. Indeed, the variability as a function of α of the Sombor indices of Equation (35) can be clearly seen in Figure 8a-c.
We hope that our work may motivate further analytical as well as computational studies of Sombor indices on random networks.

Data Availability Statement:
The data presented in this study are available on request from the corresponding author.