EUVIMEDEUVIMED entdecken
Crossref

Central limit theorems for local network statistics

P A Maugis

Biometrika · 01.09.2024 · 111 (3) · 743-754

DOI: 10.1093/biomet/asad080 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Biometrika, online erschienen am 22.12.2023. Verfasst von P A Maugis. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 58 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Subgraph counts, in particular the number of occurrences of small shapes such as triangles, characterize properties of random networks. As a result, they have seen wide use as network summary statistics. Subgraphs are typically counted globally, making existing approaches unable to describe vertex-specific characteristics. In contrast, rooted subgraphs focus on vertex neighbourhoods, and are fundamental descriptors of local network properties. We derive the asymptotic joint distribution of rooted subgraph counts in inhomogeneous random graphs, a model that generalizes most statistical network models. This result enables a shift in the statistical analysis of graphs, from estimating network summaries to estimating models linking local network structure and vertex-specific covariates. As an example, we consider a school friendship network and show that gender and race are significant predictors of local friendship patterns.

Zitieren

APA

Maugis, P. A. (2024). Central limit theorems for local network statistics. Biometrika, 111(3), 743-754. https://doi.org/10.1093/biomet/asad080

Vancouver

Maugis PA. Central limit theorems for local network statistics. Biometrika. 2024;111(3):743-754. doi:10.1093/biomet/asad080

BibTeX
@article{Maugis2024,
  author = {Maugis, P A},
  title = {Central limit theorems for local network statistics},
  journal = {Biometrika},
  year = {2024},
  volume = {111},
  number = {3},
  pages = {743--754},
  doi = {10.1093/biomet/asad080}
}
Kostenlos starten →