Related papers: Bounds for the loss probability in large loss queu…
We derive a lower bound for the probability that a random walk with i.i.d.\ increments and small negative drift $\mu$ exceeds the value $x>0$ by time $N$. When the moment generating functions are bounded in an interval around the origin,…
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr[childlparents] depend monotonically on weighted sums of the parents. In large networks where exact probabilistic inference is…
Let $\{X_{1},\ldots,X_{N_1}\}$ and $\{Y_{1},\ldots,Y_{N_2}\}$ be two sequences of interdependent heterogeneous samples, where for $i=1,\ldots,N_{1},$ $X_{i}\sim \text{Kw-G}(x, \alpha_{i}, \gamma_{i};G)$ and for $i=1,\ldots,N_{2},$…
Upper bounds for the probabilities $\mathbb{P}(F\geq \mathbb{E} F + r)$ and $\mathbb{P}(F\leq \mathbb{E} F - r)$ are proved, where $F$ is a certain component count associated with a random geometric graph built over a Poisson point process…
Given a stream of Bernoulli random variables, consider the problem of estimating the mean of the random variable within a specified relative error with a specified probability of failure. Until now, the Gamma Bernoulli Approximation Scheme…
We present a novel and flexible data-driven framework for estimating the response of higher-order moments of nonlinear stochastic systems to small external perturbations. The classical Generalized Fluctuation--Dissipation Theorem (GFDT)…
For the optimal success probability under minimum-error discrimination between $r\geq2$ arbitrary quantum states prepared with any a priori probabilities, we find new general analytical lower and upper bounds and specify the relations…
Let $\Sigma_{2n}$ be the set of all partitions of the even integers from the interval $(4,2n], n>2,$ into two odd prime parts. We select a partition from the set $\Sigma_{2n}$ uniformly at random. Let $2G_n$ be the number partitioned by…
The sample compression theory provides generalization guarantees for predictors that can be fully defined using a subset of the training dataset and a (short) message string, generally defined as a binary sequence. Previous works provided…
We treat success runs of independent identically distributed Bernoulli trials (with success parameter $p$) distributed according to the Type II binomial distribution of order $k$. However, the success runs are separated by a gap $g\ge1$ (a…
For a class of Gaussian stationary processes, we prove a limit theorem on the convergence of the distributions of the scaled last exit time over a slowly growing linear boundary. The limit is a double exponential (Gumbel) distribution.
We consider a random walk in random environment with random holding times, that is, the random walk jumping to one of its nearest neighbors with some transition probability after a random holding time. Both the transition probabilities and…
The problem of (pathwise) large deviations for conditionally continuous Gaussian processes is investigated. The theory of large deviations for Gaussian processes is extended to the wider class of random processes -- the conditionally…
The celebrated theorem of Komlos asserts that L1-boundedness is sufficient for a given sequence of functions to contain a subsequence along which (in a "lacunary" manner), and along whose every further subsequence ("hereditarily"), a strong…
A fundamental tool in network information theory is the covering lemma, which lower bounds the probability that there exists a pair of random variables, among a give number of independently generated candidates, falling within a given set.…
The standard margin-based structured prediction commonly uses a maximum loss over all possible structured outputs. The large-margin formulation including latent variables not only results in a non-convex formulation but also increases the…
A central problem in Binary Hypothesis Testing (BHT) is to determine the optimal tradeoff between the Type I error (referred to as false alarm) and Type II (referred to as miss) error. In this context, the exponential rate of convergence of…
The majority of existing probabilistic model checking case studies are based on well understood theoretical models and distributions. However, real-life probabilistic systems usually involve distribution parameters whose values are obtained…
The (strong) Bruhat order for permutations provides a partial ordering defined as follows: two permutations are comparable if one can be obtained from the other by a sequence of adjacent transpositions that each increase the number of…
Inspired by a recent paper of I. Grama, E. Le Page and M. Peign\'e, we consider a sequence $(g_n)_{n \geq 1}$ of i.i.d. random $d\times d$-matrices with non-negative entries and study the fluctuations of the process $(\log \vert g_n\cdots…