Asymptotics in undirected random graph models parameterized by the strengths of vertices

From MaRDI portal
Publication:3465105

DOI10.5705/ss.2014.180zbMath1419.62046OpenAlexW3125445225MaRDI QIDQ3465105

Hansheng Wang, Ting Yan, Hong Qin

Publication date: 28 January 2016

Published in: Statistica Sinica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5705/ss.2014.180




Related Items (20)

Inference in a probit model for affiliation networksAsymptotic distribution in directed finite weighted random graphs with an increasing bi-degree sequenceAsymptotics of score test in the generalized \(\beta\)-model for networksDetection thresholds for the \(\beta\)-model on sparse graphsAsymptotic distribution in affiliation finite discrete weighted networks with an increasing degree sequenceAsymptotic in the ordered networks with a noisy degree sequenceDegree-based moment estimation for ordered networksApproximate estimation in a class of directed networksA note on undirected random graph models parameterized by the strengths of verticesAsymptotic in undirected random graph models with a noisy degree sequenceAsymptotics in a probit model for directed networksAsymptotics in the Thurstone model with an increasing itemsTime‐varying β‐model for dynamic directed networksInference in a class of directed random graph models with an increasing number of parametersA network Poisson model for weighted directed networks with covariatesAsymptotic theory in network models with covariates and a growing number of node parametersAsymptotic theory in bipartite graph models with a growing number of parametersBivariate gamma modelExponential-family models of random graphs: inference in finite, super and infinite population scenariosConsistent structure estimation of exponential-family random graph models with block structure







This page was built for publication: Asymptotics in undirected random graph models parameterized by the strengths of vertices