Network inference from temporally dependent grouped observations
From MaRDI portal
Publication:2129609
DOI10.1016/J.CSDA.2022.107470OpenAlexW4220698219MaRDI QIDQ2129609FDOQ2129609
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
Cites Work
- Title not available (Why is that?)
- Pseudo-likelihood methods for community detection in large sparse networks
- On the convergence properties of the EM algorithm
- The EM Algorithm and Extensions, 2E
- Time varying undirected graphs
- Statistical guarantees for the EM algorithm: from population to sample-based analysis
- Networks
- Estimating time-varying networks
- Random graphs with a given degree sequence
- An introduction to variational methods for graphical models
- A central limit theorem in the -model for undirected random graphs with a diverging number of vertices
- Title not available (Why is that?)
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Probabilistic Independence Networks for Hidden Markov Probability Models
- Network Inference From Grouped Observations Using Hub Models
- Affiliation networks with an increasing degree sequence
Cited In (4)
This page was built for publication: Network inference from temporally dependent grouped observations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129609)