Related papers: Time inhomogeneity in longest gap and longest run …
For a general renewal process $N$ (allowing delay, defect and multiple simultaneous arrivals) the independence of the first renewal epochs of the marked processes got from $N$ by Bernoulli $0$/$1$ thinning is characterized. This…
Solutions to the interval observation problem for delayed impulsive and switched systems with $L_1$-performance are provided. The approach is based on first obtaining stability and $L_1/\ell_1$-to-$L_1/\ell_1$ performance analysis…
We study the optimal sequencing of a batch of tasks on a machine subject to random disruptions driven by a non-homogeneous Poisson process (NHPP), such that every disruption requires the interrupted task to be re-processed from scratch, and…
Consider the continuous greedy paths model: given a $d$-dimensional Poisson point process with positive marks interpreted as masses, let $\mathrm P(\ell)$ denote the maximum mass gathered by a path of length $\ell$ starting from the origin.…
The goal of this paper is to investigate the tools of extreme value theory originally introduced for discrete time stationary stochastic processes (time series), namely the tail process and the tail measure, in the framework of continuous…
Assumed data streams from a delayed choice gedanken experiment must satisfy a Bell's identity independently of locality assumptions. The violation of Bell's inequality by assumed correlations of identical form among these data streams…
Many experiments are concerned with the comparison of counts between treatment groups. Examples include the number of successful signups in conversion rate experiments, or the number of errors produced by software versions in canary…
The longest stretch $L(n)$ of consecutive heads in $n$ i.i.d. coin tosses is seen from the prism of large deviations. We first establish precise asymptotics for the moment generating function of $L(n)$ and then show that there are precisely…
Let $L_t$ be the longest gap before time $t$ in an inhomogeneous Poisson process with rate function $\lambda_t$ proportional to $t^{\alpha-1}$ for some $\alpha\in(0,1)$. It is shown that $\lambda_tL_t-b_t$ has a limiting Gumbel distribution…
Recent years have witnessed the surge of asynchronous parallel (async-parallel) iterative algorithms due to problems involving very large-scale data and a large number of decision variables. Because of asynchrony, the iterates are computed…
Renewal processes are broadly used to model stochastic behavior consisting of isolated events separated by periods of quiescence, whose durations are specified by a given probability law. Here, we identify the minimal sufficient statistic…
An important aspect of multiple hypothesis testing is controlling the significance level, or the level of Type I error. When the test statistics are not independent it can be particularly challenging to deal with this problem, without…
This paper describes limiting behaviour of tail empirical process associated with long memory stochastic volatility models. We show that such process has dichotomous behaviour, according to an interplay between a Hurst parameter and a tail…
In this paper we revisit random linear under-determined systems with sparse solutions. We consider $\ell_1$ optimization heuristic known to work very well when used to solve these systems. A collection of fundamental results that relate to…
We consider the classical sequential binary hypothesis testing problem in which there are two hypotheses governed respectively by distributions $P_0$ and $P_1$ and we would like to decide which hypothesis is true using a sequential test. It…
For a stochastic difference equation $D_n=A_nD_{n-1}+B_n$ which stabilises upon time we study tail distribution asymptotics of $D_n$ under the assumption that the distribution of $\log(1+|A_1|+|B_1|)$ is heavy-tailed, that is, all its…
Makespan scheduling on identical machines is one of the most basic and fundamental packing problems studied in the discrete optimization literature. It asks for an assignment of $n$ jobs to a set of $m$ identical machines that minimizes the…
We say that a string of length $d$ occurs, in a Bernoulli sequence, if a success is followed by exactly $(d-1)$ failures before the next success. The counts of such $d$-strings are of interest, and in specific independent Bernoulli…
This paper discovers fundamental principles of the backoff process that governs the performance of IEEE 802.11. A simplistic principle founded upon regular variation theory is that the backoff time has a truncated Pareto-type tail…
We study the large-time asymptotic of renewal-reward processes with a heavy-tailed waiting time distribution. It is known that the heavy tail of the distribution produces an extremely slow dynamics, resulting in a singular large deviation…