Abstract
We address the expected supremum of a linear combination of shifts of the sinc kernel with random coefficients. When the coefficients are Gaussian, the expected supremum is of order √log n, where n is the number of shifts. When the coefficients are uniformly bounded, the expected supremum is of order log log n. This is a noteworthy difference to orthonormal functions on the unit interval, where the expected supremum is of order √n log n for all reasonable coefficient statistics.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
