Related papers: A Deceptively Simple Quadratic Recurrence
We study (asymmetric) $U$-statistics based on a stationary sequence of $m$-dependent variables; moreover, we consider constrained $U$-statistics, where the defining multiple sum only includes terms satisfying some restrictions on the gaps…
We present a set of conditions which, if satisfied, provide for a complete asymptotic analysis of random matrices with source term containing two distinct eigenvalues. These conditions are shown to be equivalent to the existence of a…
This review is an extended version of the Seoul ICM 2014 proceedings.It is a short overview of the "topological recursion", a relation appearing in the asymptotic expansion of many integrable systems and in enumerative problems. We recall…
A simple approach is presented to study the asymptotic behavior of some algorithms with an underlying tree structure. It is shown that some asymptotic oscillating behaviors can be precisely analyzed without resorting to complex analysis…
The paper deals with asymptotic properties of the adaptive procedure proposed in the author paper (2007) for estimation of unknown nonparametric regression. We prove that this procedure is asymptotically efficient for a quadratic risk. It…
This paper is concerned with the study of constrained statistical learning problems, the unconstrained version of which are at the core of virtually all of modern information processing. Accounting for constraints, however, is paramount to…
We study solutions of three-term recurrence relations whose $N$-step transfer matrices belong to the uniform Stolz class. In particular, we derive the first order of their uniform asymptotics. For orthonormal polynomials we show more.…
We consider the fundamental problem of solving quadratic systems of equations in $n$ variables, where $y_i = |\langle \boldsymbol{a}_i, \boldsymbol{x} \rangle|^2$, $i = 1, \ldots, m$ and $\boldsymbol{x} \in \mathbb{R}^n$ is unknown. We…
The process of renormalization to eliminate divergences arising in quantum field theory is not uniquely defined; one can always perform a finite renormalization, rendering finite perturbative results ambiguous. The consequences of making…
Likelihood-based methods of statistical inference provide a useful general methodology that is appealing, as a straightforward asymptotic theory can be applied for their implementation. It is important to assess the relationships between…
Quadratically constrained quadratic programs (QCQPs) are an expressive family of optimization problems that occur naturally in many applications. It is often of interest to seek out sparse solutions, where many of the entries of the…
We consider large random matrices $X$ with centered, independent entries but possibly different variances. We compute the normalized trace of $f(X) g(X^*)$ for $f,g$ functions analytic on the spectrum of $X$. We use these results to compute…
Recurrence plots and recurrence quantification analysis have become popular in the last two decades. Recurrence based methods have on the one hand a deep foundation in the theory of dynamical systems and are on the other hand powerful tools…
We consider a two-dimensional analogue of Helmholtz resonator with walls of finite thickness in the critical case when there exists an eigenfrequency equalling to the limit of poles generated by both the bounded component of the resonator…
The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…
Quantum systems exhibit recurrence phenomena after equilibration, but it is a difficult task to evaluate the recurrence time of a quantum system because it drastically increases as the system size increases (usually double-exponential in…
We present a {\sl non--perturbative} method, called {\sl Parametric Perturbation Theory} (PPT), which is alternative to the ordinary perturbation theory. The method relies on a principle of simplicity for the observable solutions, which are…
We propose a new method of analyzing the asymptotics of moments of certain linear random recurrences which is based on the technique of iterative functions. By using the method, we show that the moments of the number of collisions and the…
It is well known that the Newton method may not converge when the initial guess does not belong to a specific quadratic convergence region. We propose a family of new variants of the Newton method with the potential advantage of having a…
This paper considers the problem of testing whether there exists a non-negative solution to a possibly under-determined system of linear equations with known coefficients. This hypothesis testing problem arises naturally in a number of…