9 research outputs found
Revan-degree indices on random graphs
Given a simple connected non-directed graph , we consider two
families of graph invariants:
(which has gained interest recently) and (that we introduce in this work); where denotes the edge of
connecting the vertices and , is the Revan degree of the
vertex , and is a function of the Revan vertex degrees. Here, with and the maximum and minimum
degrees among the vertices of and is the degree of the vertex .
Particularly, we apply both and R on two models of
random graphs: Erd\"os-R\'enyi graphs and random geometric graphs. By a
thorough computational study we show that \left and
\left, normalized to the order of the graph, scale
with the average Revan degree \left; here \left
denotes the average over an ensemble of random graphs. Moreover, we provide
analytical expressions for several graph invariants of both families in the
dense graph limit.Comment: 16 pages, 10 figure
Spectral and localization properties of random bipartite graphs
Bipartite graphs are often found to represent the connectivity between the
components of many systems such as ecosystems. A bipartite graph is a set of
nodes that is decomposed into two disjoint subsets, having and
vertices each, such that there are no adjacent vertices within the same set.
The connectivity between both sets, which is the relevant quantity in terms of
connections, can be quantified by a parameter that equals the
ratio of existent adjacent pairs over the total number of possible adjacent
pairs. Here, we study the spectral and localization properties of such random
bipartite graphs. Specifically, within a Random Matrix Theory (RMT) approach,
we identify a scaling parameter that fixes the
localization properties of the eigenvectors of the adjacency matrices of random
bipartite graphs. We also show that, when ) the
eigenvectors are localized (extended), whereas the
localization--to--delocalization transition occurs in the interval
. Finally, given the potential applications of our findings, we
round off the study by demonstrating that for fixed , the spectral
properties of our graph model are also universal.Comment: 17 pages, 10 figure