Network inference from temporally dependent grouped observations
From MaRDI portal
Publication:2129609
Recommendations
Cites work
- scientific article; zbMATH DE number 1350309 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A central limit theorem in the \(\beta \)-model for undirected random graphs with a diverging number of vertices
- Affiliation networks with an increasing degree sequence
- An introduction to variational methods for graphical models
- 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
- Estimating time-varying networks
- Network inference from grouped observations using Hub Models
- Networks. An introduction.
- On the convergence properties of the EM algorithm
- Probabilistic Independence Networks for Hidden Markov Probability Models
- Pseudo-likelihood methods for community detection in large sparse networks
- Random graphs with a given degree sequence
- Statistical guarantees for the EM algorithm: from population to sample-based analysis
- The EM Algorithm and Extensions, 2E
- Time varying undirected graphs
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)