Dimension reduction in vertex-weighted exponential random graphs
From MaRDI portal
Cites work
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Decomposition of mean-field Gibbs distributions into product measures
- Estimating and understanding exponential random graph models
- Estimation in spin glasses: a first step
- Exponential random graphs behave like mixtures of stochastic block models
- Global versus local asymptotic theories of finite-dimensional normed spaces
- Inequalities on the Lambert W function and hyperpower function
- Inference in Ising models
- Large networks and graph limits
- Mixing time of exponential random graphs
- Mixing time of vertex-weighted exponential random graphs
- On the Lambert \(w\) function
- Random Graphs
- Representations for partially exchangeable arrays of random variables
- Weighted exponential random graph models: scope and large network limits
This page was built for publication: Dimension reduction in vertex-weighted exponential random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2143327)