Skip navigation
Skip navigation

On generic chaining and the smallest singular value of random matrices with heavy tails

Mendelson, Shahar; Paouris, Grigoris


We present a very general chaining method which allows one to control the supremum of the empirical process suph∈H|N-1∑i=1Nh2(Xi)-Eh2| in rather general situations. We use this method to establish two main results. First, a quantitative (non-asymptoti

CollectionsANU Research Publications
Date published: 2012
Type: Journal article
Source: Journal of Functional Analysis
DOI: 10.1016/j.jfa.2012.01.027


File Description SizeFormat Image
01_Mendelson_On_generic_chaining_and_the_2012.pdf306.75 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator