Asymptotic theory in bipartite graph models with a growing number of parameters

DOI10.1002/CJS.11735MaRDI QIDQ6180912FDOQ6180912

Authors:

Publication date: 22 January 2024

Published in: The Canadian Journal of Statistics (Search for Journal in Brave)

Recommendations

• Affiliation networks with an increasing degree sequence
• Affiliation discrete weighted networks with an increasing degree sequence
• New Consistent and Asymptotically Normal Parameter Estimates for Random-Graph Mixture Models
• Asymptotic distributions in affiliation networks with an increasing sequence
• Asymptotics in undirected random graph models parameterized by the strengths of vertices

zbMATH Keywords

asymptotic propertiesbipartite graphsmoment estimationnode degrees

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Cites Work

• Statistical mechanics of complex networks
• An Exponential Family of Probability Distributions for Directed Graphs
• Title not available (Why is that?)
• High-dimensional probability. An introduction with applications in data science
• Title not available (Why is that?)
• 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
• Asymptotics in undirected random graph models parameterized by the strengths of vertices
• Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
• The number of graphs and a random graph with a given degree sequence
• Small worlds among interlocking directors: network structure and distance in bipartite graphs
• Affiliation networks with an increasing degree sequence
• Edgeworth expansions for network moments

This page was built for publication: Asymptotic theory in bipartite graph models with a growing number of parameters

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