Approximate estimation in a class of directed networks
From MaRDI portal
Cites work
- A nonparametric view of network models and Newman–Girvan and other modularities
- A note on asymptotic distributions in directed exponential random graph models with bi-degree sequences
- An Exponential Family of Probability Distributions for Directed Graphs
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Asymptotics in undirected random graph models parameterized by the strengths of vertices
- Connected components in random graphs with given expected degree sequences
- Degree-based moment estimation for ordered networks
- scientific article; zbMATH DE number 204193 (Why is no real title available?)
- Maximum likelihood estimation in the -model
- Probability Inequalities for Sums of Bounded Random Variables
- Random graphs with a given degree sequence
Cited in
(6)- Estimating a network from multiple noisy realizations
- Two-step estimation of network-formation models with incomplete information
- Estimation of extremal properties in non-negative networks
- Estimation of Sparse Directional Connectivity With Expectation Maximization
- Horvitz-Thompson estimator under partial information with an application to network degree distribution
- Estimating network edge probabilities by neighbourhood smoothing
This page was built for publication: Approximate estimation in a class of directed networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079113)
