相关论文: Approximating the Sum of Correlated Lognormals: An…

Copulas are widely used in financial economics as well as in other areas of applied mathematics. Yet, there is much arbitrariness in their choice. The author proposes "a natural copula" concept, which minimizes Wasserstein distance between…

In this paper, we investigate the precise local large deviation probabilities for random sums of independent real-valued random variables with a common distribution $F$, where $F(x+\Delta)=F((x, x+T])$ is an $\mathcal{O}$-regularly varying…

We consider the safety evaluation of discrete time, stochastic systems over a finite horizon. Therefore, we discuss and link probabilistic invariance with reachability as well as reach-avoid problems. We show how to efficiently compute…

When approximating the joint distribution of the component counts of a decomposable combinatorial structure that is `almost' in the logarithmic class, but nonetheless has irregular structure, it is useful to be able first to establish that…

The effect that weighted summands have on each other in approximations of $S=w_1S_1+w_2S_2+\cdots+w_NS_N$ is investigated. Here, $S_i$'s are sums of integer-valued random variables, and $w_i$ denote weights, $i=1,\dots,N$. Two cases are…

We establish a quantitative normal approximation result for sums of random variables with multilevel local dependencies. As a corollary, we obtain a quantitative normal approximation result for linear functionals of random fields which may…

Validating and controlling safety-critical systems in uncertain environments necessitates probabilistic reachable sets of future state evolutions. The existing methods of computing probabilistic reachable sets normally assume that…

This paper considers binomial approximation of continuous time stochastic processes. It is shown that, under some mild integrability conditions, a process can be approximated in mean square sense and in other strong metrics by binomial…

We suggest approximating the distribution of the sum of independent and identically distributed random variables with a Pareto-like tail by combining extreme value approximations for the largest summands with a normal approximation for the…

Given $n$ independent random variables $X_1, X_2, ..., X_n$ and an integer $C$, we study the fundamental problem of computing the probability that the sum $X=X_1+X_2+...+X_n$ is at most $C$. We assume that each random variable $X_i$ is…

We discuss a simple method of constructing correlated random networks, which was recently proposed by M. Bogu~n'a and R. Pastor-Satorras (cond-mat/0306072). The result of this construction procedure is a sparse network whose degree--degree…

We consider a type of nonnormal approximation of infinitely divisible distributions that incorporates compound Poisson, Gamma, and normal distributions. The approximation relies on achieving higher orders of cumulant matching, to obtain…

In this paper we propose an alternative to the coupling of Berkes, Liu and Wu [1] to obtain strong approximations for partial sums of dependent sequences. The main tool is a new Rosen-thal type inequality expressed in terms of the coupling…

A research frontier has emerged in scientific computation, wherein numerical error is regarded as a source of epistemic uncertainty that can be modelled. This raises several statistical challenges, including the design of statistical…

For a variant of the algorithm in [Pit19] (arXiv:1903.10816) to compute the approximate density or distribution function of a linear mixture of independent random variables known by a finite sample, it is presented a proof of the functional…

We establish the rate of convergence of distributions of sums of independent identically distributed random variables to the Gaussian distribution in terms of truncated pseudomoments by implementing the idea of Yu. Studnyev for getting…

Randomized rounding is a standard method, based on the probabilistic method, for designing combinatorial approximation algorithms. In Raghavan's seminal paper introducing the method (1988), he writes: "The time taken to solve the linear…

The execution time of programs is a key element in many areas of computer science, mainly those where achieving good performance (e.g., scheduling in cloud computing) or a predictable one (e.g., meeting deadlines in embedded systems) is the…

A composite likelihood is an inference function derived by multiplying a set of likelihood components. This approach provides a flexible framework for drawing inference when the likelihood function of a statistical model is computationally…

In this paper, we consider convex feasibility problems where the underlying sets are loosely coupled, and we propose several algorithms to solve such problems in a distributed manner. These algorithms are obtained by applying proximal…