Related papers: Approximation of rejective sampling inclusion prob…
In this paper we provide an upper bound for the conjunction probability of independent Gaussian smooth processes and then we prove that this bound is a good approximation with exponentially smaller error. Our result confirms the heuristic…
Correction to Annals of Probability 28 (2000) 277--302 [doi:10.1214/aop/1019160120].
We prove a tight upper bound on the variance of the priority sampling method (aka sequential Poisson sampling). Our proof is significantly shorter and simpler than the original proof given by Mario Szegedy at STOC 2006, which resolved a…
This paper studies the problem of estimating the order of arrival of the vertices in a random recursive tree. Specifically, we study two fundamental models: the uniform attachment model and the linear preferential attachment model. We…
We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We study rate of convergence of recursive estimation procedures for the general…
The paper describes an application of Aggregating Algorithm to the problem of regression. It generalizes earlier results concerned with plain linear regression to kernel techniques and presents an on-line algorithm which performs nearly as…
Correlation measure of order $k$ is an important measure of randomness in binary sequences. This measure tries to look for dependence between several shifted version of a sequence. We study the relation between the correlation measure of…
In this paper, we consider approximating expansions for the distribution of integer valued random variables, in circumstances in which convergence in law cannot be expected. The setting is one in which the simplest approximation to the…
We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…
In earlier work the authors obtained integral formulas for probabilities for a single particle in the asymmetric simple exclusion process. Here formulas are obtained for joint probabilities for several particles. In the case of a single…
Edgeworth expansion provides higher-order corrections to the normal approximation for a probability distribution. The classical proof of Edgeworth expansion is via characteristic functions. As a powerful method for distributional…
We extend the empirical likelihood of Owen [Ann. Statist. 18 (1990) 90-120] by partitioning its domain into the collection of its contours and mapping the contours through a continuous sequence of similarity transformations onto the full…
The aim of the present work is to show that the results obtained earlier on the approximation of distributions of sums of independent summands by the accompanying compound Poisson laws and the estimates of the proximity of sequential…
Continuing the work of [9] who defined the restrictiveness of stochastic orders and calculated the restrictiveness of the usual stochastic order and the likelihood ratio order, we calculate the restrictiveness of the hazard rate order.…
In this paper, we study high order correctors in stochastic homogenization. We consider elliptic equations in divergence form on $\mathbb{Z}^d$, with the random coefficients constructed from i.i.d. random variables. We prove moment bounds…
We prove an asymptotic Edgeworth expansion for the profiles of certain random trees including binary search trees, random recursive trees and plane-oriented random trees, as the size of the tree goes to infinity. All these models can be…
Proof terms are syntactic expressions that represent computations in term rewriting. They were introduced by Meseguer and exploited by van Oostrom and de Vrijer to study equivalence of reductions in (left-linear) first-order term rewriting…
We present novel bounds for estimating discrete probability distributions under the $\ell_\infty$ norm. These are nearly optimal in various precise senses, including a kind of instance-optimality. Our data-dependent convergence guarantees…