Fraser Daly

Fraser Daly

Auto-generated profile, based on publicly available information

Fraser Daly

School of Mathematical and Computer Sciences, Heriot–Watt University, Edinburgh, UK

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2016 in Journal of Applied Probability
Verified
Journal Article
Closed access
PDF file
FDFraser Daly
Fraser Daly
We consider compound geometric approximation for a nonnegative, integer-valued random variable W. The bound we give is straightforward but relies on having a lower bound on the failure rate of W. Applications are presented to M/G/1 queuing systems, for which we state explicit bounds in approximations for the number of customers in the system and the number of customers served during a busy period. Other applications are given to birth–death processes and Poisson processes.

14 July 2016 in ESAIM: Probability and Statistics
Verified
Journal Article
Closed access
PDF file
FDFraser Daly
Fraser Daly
We explore negative dependence and stochastic orderings, showing that if an integer-valued random variable W satisfies a certain negative dependence assumption, then W is smaller (in the convex sense) than a Poisson variable of equal mean. Such W include those which may be written as a sum of totally negatively dependent indicators. This is generalised to other stochastic orderings. Applications include entropy bounds, Poisson approximation and concentration. The proof uses thinning and size-biasing. We also show how these give a different Poisson approximation result, which is applied to mixed Poisson distributions. Analogous results for the binomial distribution are also presented.

6 October 2021 in Scandinavian Actuarial Journal
Verified
Journal Article
Open access
FDFraser Daly
Fraser Daly
Let Y=X1+⋯+XN be a sum of a random number of exchangeable random variables, where the random variable N is independent of the Xj, and the Xj are from the generalized multinomial model introduced by Tallis [(1962). The use of a generalized multinomial distribution in the estimation of correlation in discrete data. Journal of the Royal Statistical Society: Series B (Methodological) 24(2), 530–534]. This relaxes the classical assumption that the Xj are independent. Motivated by applications in insurance, we use zero-biased coupling and its generalizations to give explicit error bounds in the approximation of Y by a Gaussian random variable in Wasserstein distance when either the random variables Xj are centred or N has a Poisson distribution. We further establish an explicit bound for the approximation of Y by a gamma distribution in the stop-loss distance for the special case where N is Poisson. Finally, we briefly comment on analogous Poisson approximation results that make use of size-biased couplings. The special case of independent Xj is given special attention throughout. As well as establishing results which extend beyond the independent setting, our bounds are shown to be competitive with known results in the independent case.

1 June 2018 in Journal of Applied Probability
Verified
Journal Article
Closed access
PDF file
FDFraser Daly
Fraser Daly
OJOliver Johnson
Oliver Johnson
It is well known that assumptions of monotonicity in size-bias couplings may be used to prove simple, yet powerful, Poisson approximation results. Here we show how these assumptions may be relaxed, establishing explicit Poisson approximation bounds (depending on the first two moments only) for random variables which satisfy an approximate version of these monotonicity conditions. These are shown to be effective for models where an underlying random variable of interest is contaminated with noise. We also state explicit Poisson approximation bounds for sums of associated or negatively associated random variables. Applications are given to epidemic models, extremes, and random sampling. Finally, we also show how similar techniques may be used to relax the assumptions needed in a Poincaré inequality and in a normal approximation result.

23 November 2023 in Statistics & Probability Letters
Verified
Journal Article
Open access
FDFraser Daly
Fraser Daly
We discuss Stein’s method for approximation by the stationary distribution of a single-birth Markov chain, in conjunction with stochastic monotonicity and similar assumptions. We use bounds on the increments of the solution of Poisson’s equation for such a process. Applications include rates of convergence to stationarity, and bounding the total variation distance between the stationary distributions of two Markov chains in the case where one transition matrix dominates the other.

28 October 2022 in Probability in the Engineering and Informational Sciences
Verified
Journal Article
Closed access
PDF file
LYLetian Yu
Letian Yu
FDFraser Daly
Fraser Daly
OJOliver Johnson
Oliver Johnson
We consider the problem of group testing (pooled testing), first introduced by Dorfman. For nonadaptive testing strategies, we refer to a nondefective item as “intruding” if it only appears in positive tests. Such items cause misclassification errors in the well-known COMP algorithm and can make other algorithms produce an error. It is therefore of interest to understand the distribution of the number of intruding items. We show that, under Bernoulli matrix designs, this distribution is well approximated in a variety of senses by a negative binomial distribution, allowing us to understand the performance of the two-stage conservative group testing algorithm of Aldridge.