The -model for Random Graphs --- Regression, Cramér-Rao Bounds, and Hypothesis Testing
arXiv:1611.05699 · doi:10.1109/TSP.2017.2691667
Abstract
We develop a maximum-likelihood based method for regression in a setting where the dependent variable is a random graph and covariates are available on a graph-level. The model generalizes the well-known -model for random graphs by replacing the constant model parameters with regression functions. Cramér-Rao bounds are derived for the undirected -model, the directed -model, and the generalized -model. The corresponding maximum likelihood estimators are compared to the bounds by means of simulations. Moreover, examples are given on how to use the presented maximum likelihood estimators to test for directionality and significance. Last, the applicability of the model is demonstrated using dynamic social network data describing communication among healthcare workers.
References in corpus (13)
- The structure and function of complex networks
- Temporal Networks
- Estimating Potential Infection Transmission Routes in Hospital Wards Using Wearable Proximity Sensors
- Random graphs with a given degree sequence
- Maximum lilkelihood estimation in the -model
- A central limit theorem in the -model for undirected random graphs with a diverging number of vertices
- Non-parametric Bayesian modeling of complex networks
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Inference using noisy degrees: Differentially private -model and synthetic graphs
- Maximum entropy distributions on graphs
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
- Directed or Undirected? A New Index to Check for Directionality of Relations in Socio-Economic Networks
- Statistical Inference in a Directed Network Model with Covariates