Asymptotic theory in bipartite graph models with a growing number of parameters
From MaRDI portal
(Redirected from Publication:6180912)
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
Cites work
- A central limit theorem in the -model for undirected random graphs with a diverging number of vertices
- Affiliation networks with an increasing degree sequence
- An Exponential Family of Probability Distributions for Directed Graphs
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Asymptotics in undirected random graph models parameterized by the strengths of vertices
- Edgeworth expansions for network moments
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 3560401 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- Random graphs with a given degree sequence
- Small worlds among interlocking directors: network structure and distance in bipartite graphs
- Statistical mechanics of complex networks
- The number of graphs and a random graph with a given degree sequence
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)
