Related papers: Fast Engset computation
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…
The numerical approximation of an inverse problem subject to the convection--diffusion equation when diffusion dominates is studied. We derive Carleman estimates that are on a form suitable for use in numerical analysis and with explicit…
A nonuniform version of the Berry-Esseen bound has been proved. The most important feature of the new bound is a monotonically decreasing function C(|t|) instead of the universal constant C=29.1174: C(|t|)<C if |t| > 3.2, and C(|t|) tends…
A proof of quantumness is a protocol through which a classical machine can test whether a purportedly quantum device, with comparable time and memory resources, is performing a computation that is impossible for classical computers.…
Let $C$ be a closed cone with nonempty interior $C^\circ$ in a Banach space. Let $f:C^\circ \rightarrow C^\circ$ be an order-preserving subhomogeneous function with a fixed point in $C^\circ$. We introduce a condition which guarantees that…
This paper is concerned with uniqueness in inverse acoustic scattering with phaseless far-field data at a fixed frequency. The main difficulty of this problem is the so-called translation invariance property of the modulus of the far-field…
We study the uniform query reliability problem, which asks, for a fixed Boolean query Q, given an instance I, how many subinstances of I satisfy Q. Equivalently, this is a restricted case of Boolean query evaluation on tuple-independent…
As a compact representation of joint probability distributions over a dependence graph of random variables, and a tool for modelling and reasoning in the presence of uncertainty, Bayesian networks are of great importance for artificial…
A univariate Hawkes process is a simple point process that is self-exciting and has clustering effect. The intensity of this point process is given by the sum of a baseline intensity and another term that depends on the entire past history…
The paper studies a single-server queueing system with autonomous service and $\ell$ priority classes. Arrival and departure processes are governed by marked point processes. There are $\ell$ buffers corresponding to priority classes, and…
In this paper we establish strong embedding theorems, in the sense of the Komlos-Major-Tusnady framework, for the performance metrics of a general class of transitory queueing models of nonstationary queueing systems. The nonstationary and…
Define the non-overlapping return time of a random process to be the number of blocks that we wait before a particular block reappears. We prove a Central Limit Theorem based on these return times. This result has applications to entropy…
We consider a class of formula equations in first-order logic, Horn formula equations, which are defined by a syntactic restriction on the occurrences of predicate variables. Horn formula equations play an important role in many…
Multiple hypothesis testing problems arise naturally in science. In this paper, we introduce the new Fast Closed Testing (FACT) method for multiple testing, controlling the family-wise error rate. This error rate is state of the art in many…
In a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we study strict subsets, i.e. sets whose variational capacity with respect to a larger reference set is finite, in the case $p=1$.…
Finite Unified Theories (FUTs) are N=1 supersymmetric Grand Unified Theories (GUTs) which can be made finite to all-loop orders, leading to a drastic reduction in the number of free parameters. By confronting the predictions of SU(5) FUTs…
In this paper a fluid-structure interaction problem for the incompressible Newtonian fluid is studied. We prove the convergence of an iterative process with respect to the computational domain geometry. In our previous works on numerical…
Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms…
The standard quantum search algorithm lacks a feature, enjoyed by many classical algorithms, of having a fixed-point, i.e. a monotonic convergence towards the solution. Here we present two variations of the quantum search algorithm, which…
Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…