Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn weighted U-statistics for stationary processes
113
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A weighted U-statistic based on a random sample X_1,...,X_n has the form U_n=sum_{1le i,jle n}w_{i-j}K(X_i,X_j), where K is a fixed symmetric measurable function and the w_i are symmetric weights. A large class of statistics can be expressed as weighted U-statistics or variations thereof. This paper establishes the asymptotic normality of U_n when the sample observations come from a nonlinear time series and linear processes.
rate research
Read More
We develop the theory of strong stationary duality for diffusion processes on compact intervals. We analytically derive the generator and boundary behavior of the dual process and recover a central tenet of the classical Markov chain theory in the diffusion setting by linking the separation distance in the primal diffusion to the absorption time in the dual diffusion. We also exhibit our strong stationary dual as the natural limiting process of the strong stationary dual sequence of a well chosen sequence of approximating birth-and-death Markov chains, allowing for simultaneous numerical simulations of our primal and dual diffusion processes. Lastly, we show how our new definition of diffusion duality allows the spectral theory of cutoff phenomena to extend naturally from birth-and-death Markov chains to the present diffusion context.
The Gartner-Ellis condition for the square of an asymptotically stationary Gaussian process is established. The same limit holds for the conditional distri-bution given any fixed initial point, which entails weak multiplicative ergodicity. The limit is shown to be the Laplace transform of a convolution of Gamma distributions with Poisson compound of exponentials. A proof based on Wiener-Hopf factorization induces a probabilistic interpretation of the limit in terms of a regression problem.
The approximation of integral functionals with respect to a stationary Markov process by a Riemann-sum estimator is studied. Stationarity and the functional calculus of the infinitesimal generator of the process are used to get a better understanding of the estimation error and to prove a general error bound. The presented approach admits general integrands and gives a unifying explanation for different rates obtained in the literature. Several examples demonstrate how the general bound can be related to well-known function spaces.
We prove a new concentration inequality for U-statistics of order two for uniformly ergodic Markov chains. Working with bounded and $pi$-canonical kernels, we show that we can recover the convergence rate of Arcones and Gin{e} who proved a concentration result for U-statistics of independent random variables and canonical kernels. Our result allows for a dependence of the kernels $h_{i,j}$ with the indexes in the sums, which prevents the use of standard blocking tools. Our proof relies on an inductive analysis where we use martingale techniques, uniform ergodicity, Nummelin splitting and Bernsteins type inequality. Assuming further that the Markov chain starts from its invariant distribution, we prove a Bernstein-type concentration inequality that provides sharper convergence rate for small variance terms.
The results of this paper are 3-folded. Firstly, for any stationary determinantal process on the integer lattice, induced by strictly positive and strictly contractive involution kernel, we obtain the necessary and sufficient condition for the $psi$-mixing property. Secondly, we obtain the existence of the $L^q$-dimensions of the stationary determinantal measure on symbolic space ${0, 1}^mathbb{N}$ under appropriate conditions. Thirdly, the previous two results together imply the precise increasing rate of the longest common substring of a typical pair of points in ${0, 1}^mathbb{N}$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
