Kevin Peralta-Martinez, J A Méndez-Bermúdez, José M Sigarreta
{"title":"Hyperbolic random geometric graphs: Structural and spectral properties.","authors":"Kevin Peralta-Martinez, J A Méndez-Bermúdez, José M Sigarreta","doi":"10.1103/PhysRevE.111.024309","DOIUrl":null,"url":null,"abstract":"<p><p>In this paper we perform a thorough numerical study of structural and spectral properties of hyperbolic random geometric graphs (HRGs) G(n,ρ,α,ζ) by means of a random matrix theory (RMT) approach. HRGs are formed by distributing n nodes in a Poincaré disk of fixed radius ρ; the radial node distribution is characterized by the exponent α and ζ controls the curvature of the embedding space. Specifically, we report and analyze average structural properties [by means of the number of nonisolated vertices V_{x}(G), topological indices, and clustering coefficients] and average spectral properties [by means of standard RMT measures: the ratio between consecutive eigenvalue spacings r_{R}(G), the ratio between nearest- and next-to-nearest-neighbor eigenvalue distances r_{C}(G), and the inverse participation ratio and the Shannon entropy S(G) of the eigenvectors]. Even though HRGs are, in general, more elaborated than Euclidean random geometric graphs, we show that both types of random graphs share important average properties, namely: (i) 〈V_{x}(G)〉 is a simple function of the average degree 〈k〉, 〈V_{x}(G)〉≈n[1-exp(-γ〈k〉)], while (ii) properly normalized 〈r_{R}(G)〉, 〈r_{C}(G)〉 and 〈S(G)〉 scale with the parameter ξ∝〈k〉n^{δ}. Here, γ≡γ(α/ζ), δ≡δ(α/ζ), and 〈·〉 is the average over a graph ensemble.</p>","PeriodicalId":48698,"journal":{"name":"Physical Review E","volume":"111 2-1","pages":"024309"},"PeriodicalIF":2.2000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Physical Review E","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1103/PhysRevE.111.024309","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, FLUIDS & PLASMAS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper we perform a thorough numerical study of structural and spectral properties of hyperbolic random geometric graphs (HRGs) G(n,ρ,α,ζ) by means of a random matrix theory (RMT) approach. HRGs are formed by distributing n nodes in a Poincaré disk of fixed radius ρ; the radial node distribution is characterized by the exponent α and ζ controls the curvature of the embedding space. Specifically, we report and analyze average structural properties [by means of the number of nonisolated vertices V_{x}(G), topological indices, and clustering coefficients] and average spectral properties [by means of standard RMT measures: the ratio between consecutive eigenvalue spacings r_{R}(G), the ratio between nearest- and next-to-nearest-neighbor eigenvalue distances r_{C}(G), and the inverse participation ratio and the Shannon entropy S(G) of the eigenvectors]. Even though HRGs are, in general, more elaborated than Euclidean random geometric graphs, we show that both types of random graphs share important average properties, namely: (i) 〈V_{x}(G)〉 is a simple function of the average degree 〈k〉, 〈V_{x}(G)〉≈n[1-exp(-γ〈k〉)], while (ii) properly normalized 〈r_{R}(G)〉, 〈r_{C}(G)〉 and 〈S(G)〉 scale with the parameter ξ∝〈k〉n^{δ}. Here, γ≡γ(α/ζ), δ≡δ(α/ζ), and 〈·〉 is the average over a graph ensemble.
期刊介绍:
Physical Review E (PRE), broad and interdisciplinary in scope, focuses on collective phenomena of many-body systems, with statistical physics and nonlinear dynamics as the central themes of the journal. Physical Review E publishes recent developments in biological and soft matter physics including granular materials, colloids, complex fluids, liquid crystals, and polymers. The journal covers fluid dynamics and plasma physics and includes sections on computational and interdisciplinary physics, for example, complex networks.