Concentration and regularization of random graphs
From MaRDI portal
Publication:5371146
DOI10.1002/rsa.20713zbMath1373.05179arXiv1506.00669OpenAlexW2962681781MaRDI QIDQ5371146
Can M. Le, Elizaveta Levina, R. V. Vershinin
Publication date: 24 October 2017
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.00669
Related Items
Overlapping community detection in networks via sparse spectral decomposition, Coverings of random ellipsoids, and invertibility of matrices with i.i.d. heavy-tailed entries, Hierarchical Community Detection by Recursive Partitioning, Community detection and percolation of information in a geometric setting, Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model, Randomized Spectral Clustering in Large-Scale Stochastic Block Models, Unnamed Item, Convexified modularity maximization for degree-corrected stochastic block models, Optimal and algorithmic norm regularization of random matrices, Find Your Place: Simple Distributed Algorithms for Community Detection, Norms of random matrices: local and global problems, Modularity Maximization for Graphons, Outliers in spectrum of sparse Wigner matrices, Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs, Unnamed Item, Bias-Adjusted Spectral Clustering in Multi-Layer Stochastic Block Models, Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks, Vertex nomination, consistent estimation, and adversarial modification, Spectral norm bounds for block Markov chain random matrices, Spectral Estimation of Large Stochastic Blockmodels with Discrete Nodal Covariates, Estimating a network from multiple noisy realizations, Recovering Structured Probability Matrices, Quantum Query Algorithms Are Completely Bounded Forms, Unnamed Item, On semidefinite relaxations for the block model, Statistical inference on random dot product graphs: a survey, Estimating the number of communities by spectral methods, Network classification with applications to brain connectomics, Two-sample Hypothesis Testing for Inhomogeneous Random Graphs, Optimization via low-rank approximation for community detection in networks, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, Spectral edge in sparse random graphs: upper and lower tail large deviations, Community detection in sparse networks via Grothendieck's inequality, Sparse random tensors: concentration, regularization and applications, On the spread of influence in graphs, A spectral method for community detection in moderately sparse degree-corrected stochastic block models, Analysis of spectral clustering algorithms for community detection: the general bipartite setting, An approximation algorithm for the maximum spectral subgraph problem, Constructive regularization of the random matrix norm, Unnamed Item, Unnamed Item, Unnamed Item, Global and individualized community detection in inhomogeneous multilayer networks, Long time dynamics for interacting oscillators on graphs
