Fraser Daly
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Fraser Daly has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Oliver Johnson
University of Bristol
4 shared publications - Seva Shneer
Department of Actuarial Mathematics and Statistics Heriot-Watt University UK
4 shared publications - Christophe Ley
University of Luxembourg
2 shared publications - Fatemeh Ghaderinezhad
Univ Ghent, Dept Appl Math Comp Sci & Stat, Krijgslaan 281,S9,Campus Sterre, B-9000 Ghent, Belgium
2 shared publications - Letian Yu
Department of System Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin NT, Hong Kong
2 shared publications - Robert Edward Gaunt
The University of Manchester
2 shared publications
Latest Publications
- Open Access
- 7 April 2026
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 28 (2) , 33
Approximations for the Number of Maxima and Near-maxima in Independent Data
In the setting where we have n independent observations of a random variable X , we derive explicit error bounds in total variation distance when approximating the number of observations equal to the maximum of the sample (in the case where X is discrete) or the number of observations within a given distance of an order statistic of the sample (in the case where X is absolutely continuous). The logarithmic and Poisson distributions are used as approximations in the discrete case, with proofs which include the development of Stein’s method for a logarithmic target distribution. In the absolutely continuous case our approximations are by the negative binomial distribution, and are established by considering negative binomial approximation for mixed binomials. The cases where X is geometric, Gumbel and uniform are used as illustrative examples.
- 7 April 2026
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 28 (2) , 33
Open AccessApproximations for the Number of Maxima and Near-maxima in Independent Data
In the setting where we have n independent observations of a random variable X , we derive explicit error bounds in total variation distance when approximating the number of observations equal to the maximum of the sample (in the case where X is discrete) or the number of observations within a given distance of an order statistic of the sample (in the case where X is absolutely continuous). The logarithmic and Poisson distributions are used as approximations in the discrete case, with proofs which include the development of Stein’s method for a logarithmic target distribution. In the absolutely continuous case our approximations are by the negative binomial distribution, and are established by considering negative binomial approximation for mixed binomials. The cases where X is geometric, Gumbel and uniform are used as illustrative examples.
- Open Access
Rates of convergence for extremal spacings in Kakutani's random interval-splitting process
Kakutani's random interval-splitting process iteratively divides, via a uniformly random splitting point, the largest sub-interval in a partition of the unit interval. The length of the longest sub-interval after $n$ steps, suitably centred and scaled, is known to satisfy a central limit theorem as $n \to \infty$. We provide a quantitative (Berry-Esseen) upper bound for the finite-$n$ approximation in the central limit theorem, with conjecturally optimal rates in $n$. We also prove convergence to an exponential distribution for the length of the smallest sub-interval, with quantitative bounds. The Kakutani process can be embedded in certain branching and fragmentation processes, and we translate our results into that context also. Our proof uses conditioning on an intermediate time, a conditional independence structure for statistics involving small sub-intervals, an Hermite-Edgeworth expansion, and moments estimates with quantitative error bounds.Open AccessRates of convergence for extremal spacings in Kakutani's random interval-splitting process
Kakutani's random interval-splitting process iteratively divides, via a uniformly random splitting point, the largest sub-interval in a partition of the unit interval. The length of the longest sub-interval after $n$ steps, suitably centred and scaled, is known to satisfy a central limit theorem as $n \to \infty$. We provide a quantitative (Berry-Esseen) upper bound for the finite-$n$ approximation in the central limit theorem, with conjecturally optimal rates in $n$. We also prove convergence to an exponential distribution for the length of the smallest sub-interval, with quantitative bounds. The Kakutani process can be embedded in certain branching and fragmentation processes, and we translate our results into that context also. Our proof uses conditioning on an intermediate time, a conditional independence structure for statistics involving small sub-intervals, an Hermite-Edgeworth expansion, and moments estimates with quantitative error bounds. - Open Access
Stein's method for asymmetric Laplace approximation
Motivated by its appearance as a limiting distribution for random and non-random sums of independent random variables, in this paper we develop Stein's method for approximation by the asymmetric Laplace distribution. Our results generalise and offer technical refinements on existing results concerning Stein's method for (symmetric) Laplace approximation. We provide general bounds for asymmetric Laplace approximation in the Kolmogorov and Wasserstein distances, and a smooth Wasserstein distance, that involve a distributional transformation that can be viewed as an asymmetric Laplace analogue of the zero bias transformation. As an application, we derive explicit Kolmogorov, Wasserstein and smooth Wasserstein distance bounds for the asymmetric Laplace approximation of geometric random sums, and complement these results by providing explicit bounds for the asymmetric Laplace approximation of a deterministic sum of random variables with a random normalisation sequence.
Open AccessStein's method for asymmetric Laplace approximation
Motivated by its appearance as a limiting distribution for random and non-random sums of independent random variables, in this paper we develop Stein's method for approximation by the asymmetric Laplace distribution. Our results generalise and offer technical refinements on existing results concerning Stein's method for (symmetric) Laplace approximation. We provide general bounds for asymmetric Laplace approximation in the Kolmogorov and Wasserstein distances, and a smooth Wasserstein distance, that involve a distributional transformation that can be viewed as an asymmetric Laplace analogue of the zero bias transformation. As an application, we derive explicit Kolmogorov, Wasserstein and smooth Wasserstein distance bounds for the asymmetric Laplace approximation of geometric random sums, and complement these results by providing explicit bounds for the asymmetric Laplace approximation of a deterministic sum of random variables with a random normalisation sequence.
- Open Access
- 7 December 2024
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 27 (1) , 1-16
On Geometric-type Approximations with Applications
We explore two aspects of geometric approximation via a coupling approach to Stein’s method. Firstly, we refine precision and increase scope for applications by convoluting the approximating geometric distribution with a simple translation selected based on the problem at hand. Secondly, we give applications to several stochastic processes, including the approximation of Poisson processes with random time horizons and Markov chain hitting times. Particular attention is given to geometric approximation of random sums, for which explicit bounds are established. These are applied to give simple approximations, including error bounds, for the infinite-horizon ruin probability in the compound binomial risk process.
- 7 December 2024
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 27 (1) , 1-16
Open AccessOn Geometric-type Approximations with Applications
We explore two aspects of geometric approximation via a coupling approach to Stein’s method. Firstly, we refine precision and increase scope for applications by convoluting the approximating geometric distribution with a simple translation selected based on the problem at hand. Secondly, we give applications to several stochastic processes, including the approximation of Poisson processes with random time horizons and Markov chain hitting times. Particular attention is given to geometric approximation of random sums, for which explicit bounds are established. These are applied to give simple approximations, including error bounds, for the infinite-horizon ruin probability in the compound binomial risk process.
- Open Access
- 15 October 2024
- Published by Elsevier in Statistics & Probability Letters
- Vol. 216
Optimal curing rate allocation in the SIS epidemic model
- 15 October 2024
- Published by Elsevier in Statistics & Probability Letters
- Vol. 216
Open AccessOptimal curing rate allocation in the SIS epidemic model
- 1 January 2024
- Published by Institute for Applied and Pure Mathematics (IMPA) in Latin American Journal of Probability and Mathematical Statistics
- Vol. 21 (1) , 25-37
Poisson and Gaussian approximations of the power divergence family of statistics
- 1 January 2024
- Published by Institute for Applied and Pure Mathematics (IMPA) in Latin American Journal of Probability and Mathematical Statistics
- Vol. 21 (1) , 25-37
Poisson and Gaussian approximations of the power divergence family of statistics
- Open Access
- 23 November 2023
- Published by Elsevier in Statistics & Probability Letters
- Vol. 206
On Stein’s method for stochastically monotone single-birth chains
- 23 November 2023
- Published by Elsevier in Statistics & Probability Letters
- Vol. 206
Open AccessOn Stein’s method for stochastically monotone single-birth chains
- Open Access
Poisson and Gaussian approximations of the power divergence family of statistics
Consider the family of power divergence statistics based on $n$ trials, each leading to one of $r$ possible outcomes. This includes the log-likelihood ratio and Pearson's statistic as important special cases. It is known that in certain regimes (e.g., when $r$ is of order $n^2$ and the allocation is asymptotically uniform as $n\to\infty$) the power divergence statistic converges in distribution to a linear transformation of a Poisson random variable. We establish explicit error bounds in the Kolmogorov (or uniform) metric to complement this convergence result, which may be applied for any values of $n$, $r$ and the index parameter $λ$ for which such a finite-sample bound is meaningful. We further use this Poisson approximation result to derive error bounds in Gaussian approximation of the power divergence statistics.Open AccessPoisson and Gaussian approximations of the power divergence family of statistics
Consider the family of power divergence statistics based on $n$ trials, each leading to one of $r$ possible outcomes. This includes the log-likelihood ratio and Pearson's statistic as important special cases. It is known that in certain regimes (e.g., when $r$ is of order $n^2$ and the allocation is asymptotically uniform as $n\to\infty$) the power divergence statistic converges in distribution to a linear transformation of a Poisson random variable. We establish explicit error bounds in the Kolmogorov (or uniform) metric to complement this convergence result, which may be applied for any values of $n$, $r$ and the index parameter $λ$ for which such a finite-sample bound is meaningful. We further use this Poisson approximation result to derive error bounds in Gaussian approximation of the power divergence statistics. - Open Access
On Stein's method for stochastically monotone single-birth chains
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.
Open AccessOn Stein's method for stochastically monotone single-birth chains
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
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 37 (4) , 973-996
A negative binomial approximation in group testing
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.
- 28 October 2022
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 37 (4) , 973-996
A negative binomial approximation in group testing
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.