A polynomial time approximation scheme for computing the supremum of Gaussian processes
From MaRDI portal
Publication:2341621
DOI10.1214/13-AAP997zbMath1323.60056arXiv1202.4970MaRDI QIDQ2341621
Publication date: 27 April 2015
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.4970
60G15: Gaussian processes
60C05: Combinatorial probability
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Simple and efficient pseudorandom generators from gaussian processes, On the Cover Time of Dense Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cover times, blanket times, and majorizing measures
- Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
- Multiple cover time
- Algorithmic derandomization via complexity theory
- Unimodality and Dominance For Symmetric Random Vectors
- The Generic Chaining