Degree-based moment estimation for ordered networks
From MaRDI portal
Publication:2398853
DOI10.1007/s11424-017-5307-5zbMath1368.93685OpenAlexW2612154593MaRDI QIDQ2398853
Mohamed Abd Elgawad, Ting Yan, Hong Qin, Wen Long Li
Publication date: 21 August 2017
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-017-5307-5
Applications of graph theory (05C90) Communication networks in operations research (90B18) Estimation and detection in stochastic control theory (93E10)
Related Items (2)
Asymptotic in the ordered networks with a noisy degree sequence ⋮ Approximate estimation in a class of directed networks
Uses Software
Cites Work
- Exponential-family random graph models for valued networks
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
- Random graphs with a given degree sequence
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- Empirical Analysis of an Evolving Social Network
- Instability, Sensitivity, and Degeneracy of Discrete Exponential Families
- Asymptotics in undirected random graph models parameterized by the strengths of vertices
- Markov Graphs
- An Exponential Family of Probability Distributions for Directed Graphs
- A Survey of Statistical Network Models
- Probability Inequalities for Sums of Bounded Random Variables
- A central limit theorem in the -model for undirected random graphs with a diverging number of vertices
- Real and functional analysis
- Unnamed Item
- Unnamed Item
This page was built for publication: Degree-based moment estimation for ordered networks
