scientific article; zbMATH DE number 7415089
From MaRDI portal
Publication:5159418
Publication date: 27 October 2021
Full work available at URL: https://arxiv.org/abs/2105.08678
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Random Simplicial Complexes: Models and Phenomena ⋮ Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Rate-optimal graphon estimation
- A measure-theoretic approach to the theory of dense hypergraphs
- Coauthorship and citation networks for statisticians
- Consistency of spectral hypergraph partitioning under planted partition model
- Oracle inequalities for network models and sparse graphon estimation
- Random graphs with a given degree sequence
- Spectral clustering and the high-dimensional stochastic blockmodel
- Networks beyond pairwise interactions: structure and dynamics
- Critical exponents of graphs
- Statistical analysis of network data. Methods and models
- Representations for partially exchangeable arrays of random variables
- Multivariate sampling and the estimation problem for exchangeable arrays
- Exchangeable trait allocations
- Generalized random dot product graph
- Central limit theorems for the large-spin asymptotics of quantum spins
- Community detection in degree-corrected block models
- Entrywise eigenvector analysis of random matrices with low expected rank
- Sampling perspectives on sparse exchangeable graphs
- Sampling and estimation for (sparse) exchangeable graphs
- Optimal graphon estimation in cut distance
- Dynamic network models and graphon estimation
- Matrix estimation by universal singular value thresholding
- Consistency of spectral clustering in stochastic block models
- Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Stochastic blockmodels with a growing number of classes
- A nonparametric view of network models and Newman–Girvan and other modularities
- Spectral redemption in clustering sparse networks
- A Decomposition for Three-Way Arrays
- Hypergraph limits: A regularity approach
- $\beta$ models for random hypergraphs with a given degree sequence
- Latent Space Approaches to Social Network Analysis
- Community Detection and Stochastic Block Models
- Edge Exchangeable Models for Interaction Networks
- Sparse Graphs Using Exchangeable Random Measures
- A Survey of Statistical Network Models
- Community Recovery in Hypergraphs
- Concentration and regularization of random graphs
- Estimating network edge probabilities by neighbourhood smoothing
- Discussion of ``Coauthorship and citation networks for statisticians
This page was built for publication:
