Estimating the correlation in network disturbance models

DOI10.1093/COMNET/CNAB028MaRDI QIDQ5022515zbMATH OpenOpenAlexFDO

Authors A. D. Barbour, Gesine Reinert

Publication date 19 January 2022

Published in Journal of Complex Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2011.08290

zbMATH Keywords

maximum likelihoodnetwork autocorrelationnetwork disturbance

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Abstract: The Network Disturbance Model of Doreian (1989) expresses the dependency between observations taken at the vertices of a network by modelling the correlation between neighbouring vertices, using a single correlation parameter $ho$. It has been observed that estimation of $ho$ in dense graphs, using the method of Maximum Likelihood, leads to results that can be both biased and very unstable. In this paper, we sketch why this is the case, showing that the variability cannot be avoided, no matter how large the network. We also propose a more intuitive estimator of $ho$, which shows little bias. The related Network Effects Model is briefly discussed.

Recommendations

• Estimation of Subgraph Densities in Noisy Networks
• Estimation for dyadic-dependent exponential random graph models
• Density estimation on a network
• Regression of directed graphs on independent effects for density and reciprocity
• Maximum likelihood estimation for social network dynamics

Cited in

(3)

• scientific article; zbMATH DE number 125307 (Why is no real title available?)
• Estimating the Frequency Coupling Matrix From Network Measurements
• Constructing networks by filtering correlation matrices: a null model approach

This page was built for publication: Estimating the correlation in network disturbance models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5022515)