Related papers: Stochastic comparisons of record values based on t…

A common assumption exists according to which machine learning models improve their performance when they have more data to learn from. In this study, the authors wished to clarify the dilemma by performing an empirical experiment utilizing…

We study the statistics of the number of records R_{n,N} for N identical and independent symmetric discrete-time random walks of n steps in one dimension, all starting at the origin at step 0. At each time step, each walker jumps by a…

Risk prediction is central to both clinical medicine and public health. While many machine learning models have been developed to predict mortality, they are rarely applied in the clinical literature, where classification tasks typically…

For random maps, the expected value of the order (i.e. the period of the sequence of compositional iterates) is approximated asymptotically. It is much smaller than the expected value for the product of the cycle lengths.

We use the method of Maximum (relative) Entropy to process information in the form of observed data and moment constraints. The generic "canonical" form of the posterior distribution for the problem of simultaneous updating with data and…

We propose and illustrate a hierarchical Bayesian approach for matching statistical records observed on different occasions. We show how this model can be profitably adopted both in record linkage problems and in capture--recapture setups,…

The best known lower and upper bounds on the mixing time for the random-to-random insertions shuffle are $(1/2-o(1))n\log n$ and $(2+o(1))n\log n$. A long standing open problem is to prove that the mixing time exhibits a cutoff. In…

We consider binary infinite order stochastic chains perturbed by a random noise. This means that at each time step, the value assumed by the chain can be randomly and independently flipped with a small fixed probability. We show that the…

The effect of redundancy on the aging of an efficient Maximum Distance Separable (MDS) parity--protected distributed storage system that consists of multidimensional arrays of storage units is explored. In light of the experimental…

In this paper, we have discussed the usual stochastic ordering relations between two systems. Each system consists of n mutually independent components. The components follow Exponentiated (Extended) Chen distribution with three parameters…

In this paper, we study inference for chains of variable order under two distinct contamination regimes. Consider we have a chain of variable memory on a finite alphabet containing zero. At each instant of time an independent coin is…

Convolutions of independent random variables often arise in a natural way in many applied problems. In this article, we compare convolutions of two sets of gamma (negative binomial) random variables in the convolution order and the usual…

We establish the consistency of an algorithm of Mondrian Forests, a randomized classification algorithm that can be implemented online. First, we amend the original Mondrian Forest algorithm, that considers a fixed lifetime parameter.…

In outlier hypothesis testing, one aims to detect outlying sequences among a given set of sequences, where most sequences are generated i.i.d. from a nominal distribution while outlying sequences (outliers) are generated i.i.d. from a…

We present a simple, pedagogical introduction to the statistics of extreme values. Motivated by a string of record high temperatures in December 1998, we consider the distribution, averages and lifetimes for a simplified model of such…

We explore how the asymptotic structure of a random $n$-term weak integer composition of $m$ evolves, as $m$ increases from zero. The primary focus is on establishing thresholds for the appearance and disappearance of substructures. These…

We study the statistics of increments in record values in a time series $\{x_0=0,x_1, x_2, \ldots, x_n\}$ generated by the positions of a random walk (discrete time, continuous space) of duration $n$ steps. For arbitrary jump length…

Record numbers are basic statistics in random walks, whose deviation principles are not very clear so far. In this paper, the asymptotic probabilities of large and moderate deviations for numbers of weak records in right continuous or left…

In this work we present for the first time an analytic framework for calculating the individual and joint distributions of the n-th most massive or n-th highest redshift galaxy cluster for a given survey characteristic allowing to formulate…

We present a sorting algorithm for the case of recurrent random comparison errors. The algorithm essentially achieves simultaneously good properties of previous algorithms for sorting $n$ distinct elements in this model. In particular, it…