Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the Probability of Conjunctions of Stationary Gaussian Processes (1312.7129v2)

Published 26 Dec 2013 in math.PR, math.ST, and stat.TH

Abstract: Let ${X_i(t),t\ge0}, 1\le i\le n$ be independent centered stationary Gaussian processes with unit variance and almost surely continuous sample paths. For given positive constants $u,T$, define the set of conjunctions $C_{[0,T],u}:={t\in [0,T]: \min_{1 \le i \le n} X_i(t) \ge u}.$ Motivated by some applications in brain mapping and digital communication systems, we obtain exact asymptotic expansion of $ P(C_{[0,T],u} \not=\varphi)$ as $u\to\infty$. Moreover, we establish the Berman sojourn limit theorem for the random process ${\min_{1 \le i \le n} X_i(t), t\ge0}$ and derive the tail asymptotics of the supremum of each order statistics process.

Summary

We haven't generated a summary for this paper yet.