60G15 Gaussian processes
Refine
Document Type
- Article (2)
Language
- English (2)
Has Fulltext
- yes (2)
Is part of the Bibliography
- no (2)
Keywords
- FIND algorithm (1)
- Gaussian process (1)
- Malliavin calculus (1)
- Quickselect (1)
- complexity (1)
- contraction method (1)
- delay equation (1)
- fractional Brownian motion (1)
- functional limit theorem (1)
- key comparisons (1)
Institute
- Mathematik (2)
In this article, we illustrate the flexibility of the algebraic integration formalism introduced in M. Gubinelli (2004), Controlling Rough Paths, J. Funct. Anal. 216, 86-140, by establishing an existence and uniqueness result for delay equations driven by rough paths. We then apply our results to the case where the driving path is a fractional Brownian motion with Hurst parameter H > 1/3.
We consider versions of the FIND algorithm where the pivot element used is the median of a subset chosen uniformly at random from the data. For the median selection we assume that subsamples of size asymptotic to c⋅nα are chosen, where 0<α≤12, c>0 and n is the size of the data set to be split. We consider the complexity of FIND as a process in the rank to be selected and measured by the number of key comparisons required. After normalization we show weak convergence of the complexity to a centered Gaussian process as n→∞, which depends on α. The proof relies on a contraction argument for probability distributions on càdlàg functions. We also identify the covariance function of the Gaussian limit process and discuss path and tail properties.
