Related papers: Weak convergence of the periodic multiplicative Se…
This work provides some general theorems about unconditional and conditional weak convergence of empirical processes in the case of Poisson sampling designs. The theorems presented in this work are stronger than previously published…
Weak values arise in quantum theory when the result of a weak measurement is conditioned on a subsequent strong measurement. The majority of the trials are discarded, leaving only very few successful events. Intriguingly those can display a…
We provide general formulation of weak identification in semiparametric models and an efficiency concept. Weak identification occurs when a parameter is weakly regular, i.e., when it is locally homogeneous of degree zero. When this happens,…
We address the problem of testing weak optimality of a given solution of a given interval linear program. The problem was recently wrongly stated to be polynomially solvable. We disprove it. We show that the problem is NP-hard in general.…
In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters $\omega$ and we are interested in the…
The concept of a modular value of an observable of a pre- and post-selected quantum system is introduced. It is similar in form and in some cases has a close connection to the weak value of an observable, but instead of describing an…
This work considers the problem of estimating the parameters of negative mixture models, i.e. mixture models that possibly involve negative weights. The contributions of this paper are as follows. (i) We show that every rational probability…
We consider a minimal realization of a rational matrix functions. We perturb the polynomial part and one of the constant matrices from the realization part. We derive explicit computable expressions of backward errors of approximate…
Recently, we systematically studied the basic theory of Bregman circumcenters in another paper. In this work, we aim to apply Bregman circumcenters to optimization algorithms. Here, we propose the forward Bregman monotonicity which is a…
We show that the existence of a computationally efficient calibration algorithm, with a low weak calibration rate, would imply the existence of an efficient algorithm for computing approximate Nash equilibria - thus implying the unlikely…
The variational calculation of the two-electron reduced density matrix (2-RDM) is extended to periodic molecular systems. If the 2-RDM theory is extended to the periodic case without consideration of time-reversal symmetry, however, it can…
We study the asymptotic properties, in the weak sense, of regenerative processes and Markov renewal processes. For the latter, we derive both renewal-type results, also concerning the related counting process, and ergodic-type ones,…
We propose an efficient algorithm for computing a common eigenvector of a finite set of square matrices. As an immediate consequence we obtain an algorithm for determining whether the matrices admit a simultaneous triangulation, and, if so,…
In this paper, we present and analyze a new set of low-rank recovery algorithms for linear inverse problems within the class of hard thresholding methods. We provide strategies on how to set up these algorithms via basic ingredients for…
By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…
Predictive recursion is an accurate and computationally efficient algorithm for nonparametric estimation of mixing densities in mixture models. In semiparametric mixture models, however, the algorithm fails to account for any uncertainty in…
We consider $p$-weak differentiable structures that were recently introduced by the first and last named authors, and prove that the product of $p$-weak charts is a $p$-weak chart. This implies that the product of two spaces with a $p$-weak…
In this paper, we describe a new algorithm that approximates the extreme eigenvalue/eigenvector pairs of a symmetric matrix. The proposed algorithm can be viewed as an extension of the Jacobi eigenvalue method for symmetric matrices…
It is a well-known rule of thumb that approximations of stochastic partial differential equations have essentially twice the order of weak convergence compared to the corresponding order of strong convergence. This is already known for many…
We employ data from precision electroweak tests and collider searches to derive constraints on the possibility that weak-singlet fermions mix with the ordinary Standard Model fermions. Our findings are presented within the context of a…