Saved in:
Bibliographic Details
Main Authors: Patularu, Andrei-Eugeniu, van der Hoorn, Pim
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2602.17289
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915807115608064
author Patularu, Andrei-Eugeniu
van der Hoorn, Pim
author_facet Patularu, Andrei-Eugeniu
van der Hoorn, Pim
contents This paper investigates the limiting behaviour of degree-degree correlation metrics for sequences of random graphs under a general assumption of local convergence in probability. We establish convergence results for Pearson's correlation coefficient r, Spearman's rho, Kendall's tau, average nearest neighbour degree (ANND), and average nearest neighbour rank (ANNR). Our results explicitly show how the limits of these degree-degree correlation metrics depend on the local structure of the graph. We then apply our general results to study degree-degree correlations in rank-1 inhomogeneous random graphs and random geometric graphs, deriving explicit expressions for ANND in both models and for Pearson's correlation coefficient in the latter one. Keywords: random graphs, degree-degree metrics, neutral mixing
format Preprint
id arxiv_https___arxiv_org_abs_2602_17289
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Limiting Behavior of Degree-Degree Metrics under Local Convergence in Probability
Patularu, Andrei-Eugeniu
van der Hoorn, Pim
Probability
05C80 05C80
This paper investigates the limiting behaviour of degree-degree correlation metrics for sequences of random graphs under a general assumption of local convergence in probability. We establish convergence results for Pearson's correlation coefficient r, Spearman's rho, Kendall's tau, average nearest neighbour degree (ANND), and average nearest neighbour rank (ANNR). Our results explicitly show how the limits of these degree-degree correlation metrics depend on the local structure of the graph. We then apply our general results to study degree-degree correlations in rank-1 inhomogeneous random graphs and random geometric graphs, deriving explicit expressions for ANND in both models and for Pearson's correlation coefficient in the latter one. Keywords: random graphs, degree-degree metrics, neutral mixing
title Limiting Behavior of Degree-Degree Metrics under Local Convergence in Probability
topic Probability
05C80 05C80
url https://arxiv.org/abs/2602.17289