Network inference from temporally dependent grouped observations

DOI10.1016/j.csda.2022.107470OpenAlexW4220698219MaRDI QIDQ2129609

Yunpeng Zhao

Publication date: 22 April 2022

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

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

zbMATH Keywords

social networksforward-backward algorithmgrouping behavior

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Pseudo-likelihood methods for community detection in large sparse networks
• Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
• Statistical guarantees for the EM algorithm: from population to sample-based analysis
• Random graphs with a given degree sequence
• Estimating time-varying networks
• On the convergence properties of the EM algorithm
• Time varying undirected graphs
• An introduction to variational methods for graphical models
• Probabilistic Independence Networks for Hidden Markov Probability Models
• The EM Algorithm and Extensions, 2E
• Affiliation networks with an increasing degree sequence
• Network Inference From Grouped Observations Using Hub Models
• A central limit theorem in the  -model for undirected random graphs with a diverging number of vertices
• Networks
• Asymptotics in directed exponential random graph models with an increasing bi-degree sequence

This page was built for publication: Network inference from temporally dependent grouped observations