Degree-based moment estimation for ordered networks

DOI10.1007/S11424-017-5307-5MaRDI QIDQ2398853zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

asymptotic normalityconsistencymoment estimatorsincreasing number of parametersordered network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18) Estimation and detection in stochastic control theory (93E10)

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

Cites work

• scientific article; zbMATH DE number 3599198 (Why is no real title available?)
• scientific article; zbMATH DE number 1950482 (Why is no real title available?)
• 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
• A survey of statistical network models
• An Exponential Family of Probability Distributions for Directed Graphs
• Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
• Asymptotics in undirected random graph models parameterized by the strengths of vertices
• Empirical Analysis of an Evolving Social Network
• Exponential-family random graph models for valued networks
• Instability, sensitivity, and degeneracy of discrete exponential families
• Markov Graphs
• Probability Inequalities for Sums of Bounded Random Variables
• Random graphs with a given degree sequence
• Real and functional analysis

Cited in

(6)

• Approximate estimation in a class of directed networks
• The method of moments and degree distributions for network models
• Asymptotic in the ordered networks with a noisy degree sequence
• Edgeworth expansions for network moments
• A coarse graining algorithm based on \(m\)-order degree in complex network
• Estimation of local degree distributions via local weighted averaging and Monte Carlo cross-validation

Describes a project that uses

Uses Software

• MCODE

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)