Degree-based moment estimation for ordered networks
DOI10.1007/S11424-017-5307-5zbMATH Open1368.93685OpenAlexW2612154593MaRDI QIDQ2398853FDOQ2398853
Authors: Ting Yan, M. A. Abd Elgawad, 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
Recommendations
- The method of moments and degree distributions for network models
- Asymptotic in the ordered networks with a noisy degree sequence
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Edgeworth expansions for network moments
- Directed weighted random graphs with an increasing bi-degree sequence
Applications of graph theory (05C90) Communication networks in operations research (90B18) Estimation and detection in stochastic control theory (93E10)
Cites Work
- A survey of statistical network models
- Exponential-family random graph models for valued networks
- Empirical Analysis of an Evolving Social Network
- An Exponential Family of Probability Distributions for Directed Graphs
- Probability Inequalities for Sums of Bounded Random Variables
- Instability, sensitivity, and degeneracy of discrete exponential families
- Markov Graphs
- Random graphs with a given degree sequence
- A central limit theorem in the \(\beta \)-model for undirected random graphs with a diverging number of vertices
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- Title not available (Why is that?)
- Asymptotics in undirected random graph models parameterized by the strengths of vertices
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
- Title not available (Why is that?)
- Real and functional analysis
Cited In (6)
- A coarse graining algorithm based on \(m\)-order degree in complex network
- Asymptotic in the ordered networks with a noisy degree sequence
- Edgeworth expansions for network moments
- Approximate estimation in a class of directed networks
- Estimation of local degree distributions via local weighted averaging and Monte Carlo cross-validation
- The method of moments and degree distributions for network models
Uses Software
This page was built for publication: Degree-based moment estimation for ordered networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398853)
