Numerical linear algebra in the streaming model
Proceedings of the forty-first annual ACM symposium on Theory of computing
Smooth Analysis of the Condition Number and the Least Singular Value
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Spectral Sparsification of Graphs
SIAM Journal on Computing
Ranking and sparsifying a connection graph
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
Approximating independent set in perturbed graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
In this paper, we present a new upper bound for the spectral norm of symmetric random matrices with independent (but not necessarily identical) entries. Our results improve an earlier result of Füredi and Komlós.