相关论文: An asymptotic approximation for the permanent of a…
The first aim of this paper is to establish the weak convergence rate of nonlinear two-time-scale stochastic approximation algorithms. Its second aim is to introduce the averaging principle in the context of two-time-scale stochastic…
We study the rate of convergence of linear two-time-scale stochastic approximation methods. We consider two-time-scale linear iterations driven by i.i.d. noise, prove some results on their asymptotic covariance and establish asymptotic…
In this note, we are concerned with the asymptotic approximation of a class of double integrals which can be represented as an angular spectrum superposition. These double integrals typically appear in electromagnetic scattering problems.…
In this contribution, we address the numerical solutions of high-order asymptotic equivalent partial differential equations with the results of a lattice Boltzmann scheme for an inhomogeneous advection problem in one spatial dimension. We…
We propose and analyze a specific asymptotic stochastic order for random processes based on the measure of departure discussed in the literature. As applications, we stochastically compare mixtures of order statistics and record values…
We construct a deterministic approximation algorithm for computing a permanent of a $0,1$ $n$ by $n$ matrix to within a multiplicative factor $(1+\epsilon)^n$, for arbitrary $\epsilon>0$. When the graph underlying the matrix is a constant…
The asymptotic volume of the polytope of symmetric stochastic matrices can be determined by asymptotic enumeration techniques as in the case of the Birkhoff polytope. These methods can be extended to polytopes of symmetric stochastic…
We study the complexity of approximating the permanent of a positive semidefinite matrix $A\in \mathbb{C}^{n\times n}$. 1. We design a new approximation algorithm for $\mathrm{per}(A)$ with approximation ratio $e^{(0.9999 + \gamma)n}$,…
We derive a novel deterministic equivalence for the two-point function of a random matrix resolvent. Using this result, we give a unified derivation of the performance of a wide variety of high-dimensional linear models trained with…
Stochastic alternating algorithms for bi-objective optimization are considered when optimizing two conflicting functions for which optimization steps have to be applied separately for each function. Such algorithms consist of applying a…
Asymptotic equivalence results for nonparametric regression experiments have always assumed that the variances of the observations are known. In practice, however the variance of each observation is generally considered to be an unknown…
We study the relative asymptotics of two sequences of multiple orthogonal polynomials corresponding to two Nikishin systems of measures on the real line, the second one of which is obtained from the first one perturbing the generating…
We study the asymptotic stability of the semi-discrete (SD) numerical method for the approximation of stochastic differential equations. Recently, we examined the order of $\mathcal L^2$-convergence of the truncated SD method and showed…
Asymptotics deviation probabilities of the sum S n = X 1 + $\times$ $\times$ $\times$ + X n of independent and identically distributed real-valued random variables have been extensively investigated , in particular when X 1 is not…
Stochastic approximation algorithm is a useful technique which has been exploited successfully in probability theory and statistics for a long time. The step sizes used in stochastic approximation are generally taken to be deterministic and…
We derive asymptotic formulas for central extended binomial coefficients, which are generalizations of binomial coefficients. To do so, we relate the exact distribution of the sum of independent discrete uniform random variables to the…
We study the approximation of stationary processes by a simple class of purely deterministic signals. This has an analytic counterpart in the approximation of symmetric positive definite Toeplitz matrices by submatrices of finite rank. We…
We show that the permanent of an $n \times n$ matrix with iid Bernoulli entries $\pm 1$ is of magnitude $n^{({1/2}+o(1))n}$ with probability $1-o(1)$. In particular, it is almost surely non-zero.
A periodic perturbation generates a complicated dynamics close to separatrices and saddle points. We construct an asymptotic solution which is close to the separatrix for the unperturbed Duffing's oscillator over a long time. This solution…
Some asymptotic notions for random variables are discussed. In particular, different versions of O and o for sequences of random variables are studied. The results are elementary and more or less well-known, but collected here for future…