Skip to content
Preprint

Dynamic Networks with Node Heterogeneity and Homophily

Aug 2026 · 0 citations · 36 references
Mathematics

TL;DR

A novel normalized squared loss is proposed, paving the way for efficient and stable estimation of parameters in a high-dimensional setting and providing more sophisticated tools for the prediction of future networks with statistical guarantees.

Abstract

The goal of this paper is to model node heterogeneity and link homophily for dynamic networks. The proposed framework brings new insights on how networks evolve over time. It also provides more sophisticated tools for the prediction of future networks with statistical guarantees. The new model accounts for the link homophily associated with both observed traits and latent traits. The joint modeling of node heterogeneity and both observed and latent homophily effects also poses the significant challenge in statistical inference, resulted from the large number of confounding parameters in the model. To overcome this, we propose a novel normalized squared loss, paving the way for efficient and stable estimation of parameters in a high-dimensional setting. We provide a rigorous theoretical analysis of the estimation method, and demonstrate its effectiveness through extensive simulations and the illustration with some real-world network data.

View source

Similar papers

Preprint Aug 2026

Inference for High-Dimensional Network Data

A novel method of inference for network-dependent high-dimensional random vectors is developed, allowing the approximation theory to capture the interaction between the decay of dependence and the growth of network neighborhoods.

Yuya Sasaki, Baoyuan Zheng · 0 citations
Preprint Sep 2026

Moment Restrictions for Dyadic Network Formation Models with Nontransferable Utility

This paper investigates the construction of moment restrictions in dyadic network formation models with unobserved individual heterogeneity under nontransferable utility. Using observed links and covariates from five-node pentads, we construct moment restrictions that do not depend on individual fixed effects. For a br...

Han-Ping Chen, Ze-Qi Wu · 0 citations
Preprint Aug 2026

Inference for subgraph densities in noisy dynamic networks

By specifying a stochastically evolving hidden Markov network model, this work addresses two important directions for further investigation identified by Chang et al. (2022): robustness to non-identical network replicates, and efficient aggregation of multiple available network snapshots.

Peter W. MacDonald, E. Kolaczyk · 1 citation
Open access Jul 2026

Centrality-driven Sparse Optimal Control of Belief Formation in Social Networks

A sparse optimal control framework built on the Network Drift-Diffusion Model (NDDM) is proposed, which shows that the best centrality choice depends strongly on the network topology, and the system undergoes phase transitions as control parameters vary.

Bo Wang · 0 citations
Preprint Jul 2026

Decorated graphons for temporal network estimation

The framework gives a nonparametric baseline for dynamic network analysis with explicit convergence guarantees and establishes nonparametric convergence rates in both block-model and Holder-smooth regimes.

Charles Dufour, S. Olhede · 0 citations
Preprint Aug 2026

Joint Estimation of Sparse Multilayer Networks via Graph Limits

A nonparametric joint estimator based on blockmodel approximations is developed, which captures each layer's varying sparsity and connection structure, accounting for heterogeneity via shared latent variables across all layers, and enables high-resolution estimation even in sparser layers.

Youngseok Song, S. Olhede · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.