Sparse random tensors: concentration, regularization and applications

DOI10.1214/21-EJS1838zbMath1471.15021arXiv1911.09063OpenAlexW3159451596WikidataQ114060466 ScholiaQ114060466MaRDI QIDQ2044387

Yizhe Zhu, Zhixin Zhou

Publication date: 9 August 2021

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.09063

zbMATH Keywords

spectral normhypergraph expandersparse random tensortensor sparsification

Mathematics Subject Classification ID

Combinatorial probability (60C05) Random matrices (algebraic aspects) (15B52) Multilinear algebra, tensor calculus (15A69)

Related Items (3)

Marchenko–Pastur law with relaxed independence conditions ⋮ On the second eigenvalue of random bipartite biregular graphs ⋮ Deterministic Tensor Completion with Hypergraph Expanders

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• Inverse expander mixing for hypergraphs
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• Functional limit theorems for random regular graphs
• SpicyMKL: a fast algorithm for multiple kernel learning with thousands of kernels
• Operator norm inequalities between tensor unfoldings on the partition lattice
• Consistency of spectral hypergraph partitioning under planted partition model
• Spectra of lifted Ramanujan graphs
• Constructive regularization of the random matrix norm
• Spectral analysis of large dimensional random matrices
• On codes from hypergraphs.
• The dimension-free structure of nonhomogeneous random matrices
• Norms of random matrices: local and global problems
• The spectral gap of dense random regular graphs
• Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
• Size biased couplings and the spectral gap for random regular graphs
• On the second eigenvalue of hypergraphs
• Concentration inequalities for random tensors
• Spectral radii of sparse random matrices
• Exact recovery in the hypergraph stochastic block model: a spectral algorithm
• Phase transition in the spiked random tensor with Rademacher prior
• Consistency of spectral clustering in stochastic block models
• Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs
• Deterministic algorithms for matrix completion
• Tensor decompositions for learning latent variable models
• Loose laplacian spectra of random hypergraphs
• Optimal Construction of Edge-Disjoint Paths in Random Graphs
• Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1.
• Analysis of spectral clustering algorithms for community detection: the general bipartite setting
• High-Dimensional Probability
• The Largest Eigenvalue of Sparse Random Graphs
• Random Matrices and Complexity of Spin Glasses
• Spectral Algorithms for Tensor Completion
• Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors
• A graphon approach to limiting spectral distributions of Wigner‐type matrices
• HIGH DIMENSIONAL EXPANDERS
• The Landscape of the Spiked Tensor Model
• Consistent community detection in multi-layer network data
• Matrix Completion From a Few Entries
• Spectral techniques applied to sparse random graphs
• On the spectral norm of Gaussian random matrices
• Concentration and regularization of random graphs
• Most Tensor Problems Are NP-Hard
• EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
• Spectral norm of random matrices

This page was built for publication: Sparse random tensors: concentration, regularization and applications