We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
For all α > 0 and real random variables X, we establish sharp bounds for the smallest and the largest deviation of αX from the logarithmic distribution also known as Benford's law. In the case of uniform X, the value of the smallest possible deviation is determined explicitly. Our elementary calculation puts into perspective the recurring claims that a random variable conforms to Benford's law, at least approximately, whenever it has large spread.
We consider the distribution of the age of an individual picked uniformly at random at some fixed time in a linear birth-and-death process. By exploiting a bijection between the birth-and-death tree and a contour process, we derive the cumulative distribution function for this distribution. In the critical and supercritical cases, we also give rates for the convergence in terms of the total variation and other metrics towards the appropriate exponential distribution.
In this paper we prove that a parallel system consisting of Weibull components with different scale parameters ages faster than a parallel system comprising Weibull components with equal scale parameters in the convex transform order when the lifetimes of components of both systems have different shape parameters satisfying some restriction. Moreover, while comparing these two systems, we show that the dispersive and the usual stochastic orders, and the right-spread order and the increasing convex order are equivalent. Further, some of the known results in the literature concerning comparisons of k-out-of-n systems in the exponential model are extended to the Weibull model. We also provide solutions to two open problems mentioned by Balakrishnan and Zhao (2013) and Zhao et al. (2016).
We show that under some slight assumptions, the positive sojourn time of a product of symmetric processes converges towards ½ as the number of processes increases. Monotony properties are then exhibited in the case of symmetric stable processes, and used, via a recurrence relation, to obtain upper and lower bounds on the moments of the occupation time (in the first and third quadrants) for two-dimensional Brownian motion. Explicit values are also given for the second and third moments in the n-dimensional Brownian case.
Let X1, X2, . . . be independent copies of a random vector X with values in ℝd and a continuous distribution function. The random vector Xn is a complete record, if each of its components is a record. As we require X to have independent components, crucial results for univariate records clearly carry over. But there are substantial differences as well. While there are infinitely many records in the d = 1 case, they occur only finitely many times in the series if d ≥ 2. Consequently, there is a terminal complete record with probability 1. We compute the distribution of the random total number of complete records and investigate the distribution of the terminal record. For complete records, the sequence of waiting times forms a Markov chain, but unlike the univariate case now the state at ∞ is an absorbing element of the state space.
In this work we consider the generalized Pólya process with baseline intensity function r and parameters α and β recently studied by Cha (2014). The aim of this work is to provide both univariate and multivariate stochastic comparisons between two generalized Pólya processes with different baseline intensity functions and the same parameters α and β for the epoch and inter-epoch times of the two processes. The comparisons are analogous to stochastic comparisons in Belzunce et al. (2001) for two nonhomogeneous Poisson or pure-birth processes with different intensity functions. Moreover, we study both univariate and multivariate ageing properties of the epoch and inter-epoch times of the generalized Pólya process.
We introduce a large and flexible class of discrete tempered stable distributions, and analyze the domains of attraction for both this class and the related class of positive tempered stable distributions. Our results suggest that these are natural models for sums of independent and identically distributed random variables with tempered heavy tails, i.e. tails that appear to be heavy up to a point, but ultimately decay faster.
Bounds of the quantile entropy in the past lifetime of some ageing classes are explored firstly. The quantile entropy in the past lifetime of a random variable is shown to be increasing if its expected inactivity time is increasing. Some closure properties of the less quantile entropy in the past lifetime order are obtained under the model of generalized order statistics. Moreover, sufficient conditions are given for a function of a random variable and for a weighted random variable to have more quantile entropy in the past lifetime than original random variable.
We show that for $p\geqslant 1$, the $p$th moment of suprema of linear combinations of independent centered random variables are comparable with the sum of the first moment and the weak $p$th moment provided that $2q$th and $q$th integral moments of these variables are comparable for all $q\geqslant 2$. The latest condition turns out to be necessary in the independent and identically distributed case.
Let X and Y be two independent and nonnegative random variables with corresponding distributions F and G. Denote by H the distribution of the product XY, called the product convolution of F and G. Cline and Samorodnitsky (1994) proposed sufficient conditions for H to be subexponential, given the subexponentiality of F. Relying on a related result of Tang (2008) on the long-tail of the product convolution, we obtain a necessary and sufficient condition for the subexponentiality of H, given that of F. We also study the reverse problem and obtain sufficient conditions for the subexponentiality of F, given that of H. Finally, we apply the obtained results to the asymptotic study of the ruin probability in a discrete-time insurance risk model with stochastic returns.
We investigate conditions in order to decide whether a given sequence of real numbers represents expected maxima or expected ranges. The main result provides a novel necessary and sufficient condition, relating an expected maxima sequence to a translation of a Bernstein function through its Lévy–Khintchine representation.
Log-concave random variables and their various properties play an increasingly important role in probability, statistics, and other fields. For a distribution F, denote by 𝒟F the set of distributions G such that the convolution of F and G has a log-concave probability mass function or probability density function. In this paper, we investigate sufficient and necessary conditions under which 𝒟F ⊆ 𝒟G, where F and G belong to a parametric family of distributions. Both discrete and continuous settings are considered.
We consider a continuous, infinitely divisible random field in ℝd, d = 1, 2, 3, given as an integral of a kernel function with respect to a Lévy basis with convolution equivalent Lévy measure. For a large class of such random fields, we compute the asymptotic probability that the excursion set at level x contains some rotation of an object with fixed radius as x → ∞. Our main result is that the asymptotic probability is equivalent to the right tail of the underlying Lévy measure.
Current literature on stochastic dominance assumes utility/loss functions to be the same across random variables. However, decision models with inconsistent utility functions have been proposed in the literature. The use of inconsistent loss functions when comparing between two random variables can also be appropriate under other problem settings. In this paper we generalize almost stochastic dominance to problems with inconsistent utility/loss functions. In particular, we propose a set of conditions that is necessary and sufficient for clear preferences when the utility/loss functions are allowed to vary across different random variables.
Taylor's law (TL) originated as an empirical pattern in ecology. In many sets of samples of population density, the variance of each sample was approximately proportional to a power of the mean of that sample. In a family of nonnegative random variables, TL asserts that the population variance is proportional to a power of the population mean. TL, sometimes called fluctuation scaling, holds widely in physics, ecology, finance, demography, epidemiology, and other sciences, and characterizes many classical probability distributions and stochastic processes such as branching processes and birth-and-death processes. We demonstrate analytically for the first time that a version of TL holds for a class of distributions with infinite mean. These distributions, a subset of stable laws, and the associated TL differ qualitatively from those of light-tailed distributions. Our results employ and contribute to the methodology of Albrecher and Teugels (2006) and Albrecher et al. (2010). This work opens a new domain of investigation for generalizations of TL.
In this paper we study general aggregation of stochastic arrangement increasing random variables, including both the generalized linear combination and the standard aggregation as special cases. In terms of monotonicity, supermodularity, and convexity of the kernel function, we develop several sufficient conditions for the increasing convex order on the generalized aggregations. Some applications in reliability and risks are also presented.
The present paper is devoted to complete convergence and the strong law of large numbers under moment conditions near those of the law of the single logarithm (LSL) for independent and identically distributed arrays. More precisely, we investigate limit theorems under moment conditions which are stronger than $2p$ for any $p<2$, in which case we know that there is almost sure convergence to 0, and weaker than $E\,X^{4}/(\log ^{+}|X|)^{2}<\infty$, in which case the LSL holds.
We observe the frog model, an infinite system of interacting random walks, on ℤ with an asymmetric underlying random walk. For certain initial frog distributions we construct an explicit formula for the moments of the leftmost visited site, as well as their asymptotic scaling limits as the drift of the underlying random walk vanishes. We also provide conditions in which the lower bound can be scaled to converge in probability to the degenerate distribution at 1 as the drift vanishes.
In the present work, some new maximal inequalities for nonnegative N-demi(super)martingales are first developed. As an application, new bounds for the cumulative distribution function of the waiting time for the first occurrence of a scan statistic in a sequence of independent and identically distributed (i.i.d.) binary trials are obtained. A numerical study is also carried out for investigating the behavior of the new bounds.