Related papers: The Partial Averaging method
We study the asymptotic convergence of the partial averaging method, a technique used in conjunction with the random series implementation of the Feynman-Kac formula. We prove asymptotic bounds valid for most series representations in the…
Averaging is an important method to extract effective macroscopic dynamics from complex systems with slow modes and fast modes. This article derives an averaged equation for a class of stochastic partial differential equations without any…
We perform a thorough analysis of the relationship between discrete and series representation path integral methods, which are the main numerical techniques used in connection with the Feynman-Kac formula. First, a new interpretation of the…
In this paper we propose a general series method to estimate a semiparametric partially linear varying coefficient model. We establish the consistency and \sqrtn-normality property of the estimator of the finite-dimensional parameters of…
We study convergence properties of sparse averages of partial sums of Fourier series of continuous functions. By sparse averages, we are considering an increasing sequences of integers $n_0 < n_1 < n_2 < ...$ and looking at…
We study mean-field particle approximations of normalized Feynman-Kac semi-groups, usually called Fleming-Viot or Feynman-Kac particle systems. Assuming various large time stability properties of the semi-group uniformly in the initial…
We present a procedure for averaging one-parameter random unitary groups and random self-adjoint groups. Central to this is a generalization of the notion of weak convergence of a sequence of measures and the corresponding generalization of…
In a Cox model, the partial likelihood, as the product of a series of conditional probabilities, is used to estimate the regression coefficients. In practice, those conditional probabilities are approximated by risk score ratios based on a…
The paper introduces a method of partial fractions with matrix coefficients and its applications to finding chains of generalized eigenvectors, to evaluation of matrix exponentials, and to solution of linear systems of ordinary differential…
We present an averaging process for sections of a torsor under a unipotent group. This process allows one to integrate local sections of such a torsor into a global simplicial section. The results of this paper have applications to…
Using the age-structure formalism, we definitely establish connections between semi-Markov processes and the dynamics of open quantum systems that satisfy the Markov quantum master equations. A generalized Feynman-Kac formula of the…
In this work, we propose a method for solving Kolmogorov hypoelliptic equations based on Fourier transform and Feynman-Kac formula. We first explain how the Feynman-Kac formula can be used to compute the fundamental solution to parabolic…
Martingale methods are used to study the almost everywhere convergence of general function series. Applications are given to ergodic series, which improves recent results of Fan \cite{FanETDS}, and to dilated series, including Davenport…
Stochastic gradient methods are among the most widely used algorithms for large-scale optimization and machine learning. A key technique for improving the statistical efficiency and stability of these methods is the use of averaging schemes…
This paper presents a fractional generalized Cauchy process (FGCP) with an additive and a multiplicative Gaussian white noise for describing subordinated anomalous fluctuations. The FGCP displays intermittent dynamics during random time…
We review some aspects of the use of a technique known as group averaging, which provides a tool for the study of constrained systems. We focus our attention on the case where the gauge group is non-compact, and a `renormalized' group…
We consider the semi-parametric estimation of a scale parameter of a one-dimensional Gaussian process with known smoothness. We suggest an estimator based on quadratic variations and on the moment method. We provide asymptotic…
The technique known as group averaging provides powerful machinery for the study of constrained systems. However, it is likely to be well defined only in a limited set of cases. Here, we investigate the possibility of using a `renormalized'…
The purpose of this article is to discuss the circle method and its quantitative role in understanding pointwise almost everywhere convergence phenomena for polynomial ergodic averaging operators. Specifically, we will use the circle method…
We review the framework of Refined Algebraic Quantization and the method of Group Averaging for quantizing systems with first-class constraints. Aspects and results concerning the generality, limitations, and uniqueness of these methods are…