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

DOI10.1002/CJS.11735MaRDI QIDQ6180912

No author found.

Publication date: 22 January 2024

zbMATH Keywords

asymptotic propertiesbipartite graphsmoment estimationnode degrees

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Cites Work

• Unnamed Item
• Unnamed Item
• Random graphs with a given degree sequence
• Small worlds among interlocking directors: network structure and distance in bipartite graphs
• Edgeworth expansions for network moments
• Statistical mechanics of complex networks
• Asymptotics in undirected random graph models parameterized by the strengths of vertices
• An Exponential Family of Probability Distributions for Directed Graphs
• Affiliation networks with an increasing degree sequence
• High-Dimensional Probability
• The number of graphs and a random graph with a given degree sequence
• A central limit theorem in the  -model for undirected random graphs with a diverging number of vertices
• Asymptotics in directed exponential random graph models with an increasing bi-degree sequence

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