A note on undirected random graph models parameterized by the strengths of vertices

DOI10.1080/03610926.2020.1728332MaRDI QIDQ5079140zbMATH OpenOpenAlexFDO

Authors Qiuping Wang

Publication date 25 May 2022

Published in Communications in Statistics: Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610926.2020.1728332

zbMATH Keywords

asymptotic representationconsistencymoment estimationnetwork data

Mathematics Subject Classification ID

Statistics (62-XX) Asymptotic properties of parametric estimators (62F12) Social networks; opinion dynamics (91D30)

Cites work

• A Berry-Esseen theorem for weakly negatively dependent random variables and its applications
• A sequential importance sampling algorithm for generating random graphs with prescribed degrees
• An Exponential Family of Probability Distributions for Directed Graphs
• Association of normal random variables and Slepian's inequality
• Association of Random Variables, with Applications
• Asymptotic equivalence and contiguity of some random graphs
• Asymptotics in undirected random graph models parameterized by the strengths of vertices
• Central limit theorems for associated random variables and the percolation model
• Detection thresholds for the \(\beta\)-model on sparse graphs
• Emergence of Scaling in Random Networks
• Exponential inequalities for sums of weakly dependent variables
• Exponential inequality for associated random variables
• scientific article; zbMATH DE number 3798860 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• Maximum likelihood estimation in the -model
• Negative association of random variables, with applications
• On the convergence rate in the central limit theorem for associated processes
• Optimal Error Bounds for the Newton–Kantorovich Theorem
• Positively correlated normal variables are associated
• Probability Inequalities for Sums of Bounded Random Variables
• Random graphs with a given degree sequence
• Some concepts of negative dependence
• The average distances in random graphs with given expected degrees

Cited in

(1)

• Adaptive inference in a dynamic nonparametric -model for networks

This page was built for publication: A note on undirected random graph models parameterized by the strengths of vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079140)