Anatoly Zhigljavsky
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Anatoly Zhigljavsky has a total of 92 co-authors. Here are the top co-authors by number of shared publications:
- Henry P. Wynn
London School of Economics and Political Science, London, UK
18 shared publications - Andrey Pepelyshev
School of Mathematics, Cardiff University, Cardiff, UK
16 shared publications - Luc Pronzato
CNRS Université Côte d'Azur I3S France
15 shared publications - Jack Noonan
School of Mathematics Cardiff University U.K
13 shared publications - Jonathan Gillard
Cardiff University
13 shared publications Holger Dette
9 shared publications
Latest Publications
- 20 December 2025
- Published by Springer Nature in Acta Mathematica Hungarica
- Vol. 177 (2) , 351-362
Maximum mean discrepancies of Farey sequences
- 20 December 2025
- Published by Springer Nature in Acta Mathematica Hungarica
- Vol. 177 (2) , 351-362
Maximum mean discrepancies of Farey sequences
- 20 June 2025
- Published by Springer Nature
- p. 2672-2675
Stochastic Global Optimization
- 20 June 2025
- Published by Springer Nature
- p. 2533-2536
Statistical Modeling in Market Research
- 23 April 2025
- Published by Springer Nature
- p. 205-211
Statistical Modelling for Improving Efficiency of Online Advertising
- 23 April 2025
- Published by Springer Nature
- p. 205-211
Statistical Modelling for Improving Efficiency of Online Advertising
- Open Access
- 1 April 2025
- Published by Springer Nature in Soft Computing
- Vol. 29 (8) , 4247-4257
An exterior algebra approach to generalised variances and cross-covariances
It has been shown by Pronzato et al. (Bernoulli 23(4A):2617–2642, 2017; J Multivar Anal 168:276–289, 2018) that simplicial volumes formed by independent copies of random variables can be used to extend the definition of generalised variances. It is shown in this paper that exterior algebra is a natural environment in which to study these constructions. This is used to extend the formulation to covariances and correlations. The theory leads naturally to dispersion ordering, that is partial orderings in which one random variable is more disperse than another if one squared simplicial volume stochastically dominates the other.
- 1 April 2025
- Published by Springer Nature in Soft Computing
- Vol. 29 (8) , 4247-4257
Open AccessAn exterior algebra approach to generalised variances and cross-covariances
It has been shown by Pronzato et al. (Bernoulli 23(4A):2617–2642, 2017; J Multivar Anal 168:276–289, 2018) that simplicial volumes formed by independent copies of random variables can be used to extend the definition of generalised variances. It is shown in this paper that exterior algebra is a natural environment in which to study these constructions. This is used to extend the formulation to covariances and correlations. The theory leads naturally to dispersion ordering, that is partial orderings in which one random variable is more disperse than another if one squared simplicial volume stochastically dominates the other.
- Open Access
- 29 August 2023
- Published by Springer Nature in Statistical Papers
- Vol. 65 (4) , 1985-2009
Prediction in regression models with continuous observations
We consider the problem of predicting values of a random process or field satisfying a linear model $$y(x)=\theta ^\top f(x) + \varepsilon (x)$$ , where errors $$\varepsilon (x)$$ are correlated. This is a common problem in kriging, where the case of discrete observations is standard. By focussing on the case of continuous observations, we derive expressions for the best linear unbiased predictors and their mean squared error. Our results are also applicable in the case where the derivatives of the process y are available, and either a response or one of its derivatives need to be predicted. The theoretical results are illustrated by several examples in particular for the popular Matérn 3/2 kernel.- 29 August 2023
- Published by Springer Nature in Statistical Papers
- Vol. 65 (4) , 1985-2009
Open AccessPrediction in regression models with continuous observations
We consider the problem of predicting values of a random process or field satisfying a linear model $$y(x)=\theta ^\top f(x) + \varepsilon (x)$$ , where errors $$\varepsilon (x)$$ are correlated. This is a common problem in kriging, where the case of discrete observations is standard. By focussing on the case of continuous observations, we derive expressions for the best linear unbiased predictors and their mean squared error. Our results are also applicable in the case where the derivatives of the process y are available, and either a response or one of its derivatives need to be predicted. The theoretical results are illustrated by several examples in particular for the popular Matérn 3/2 kernel. - Open Access
- 24 July 2023
- Published by Springer Nature in Journal of Global Optimization
- Vol. 88 (1) , 1-26
Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms
We consider global optimization problems, where the feasible region $${\mathcal {X}}$$ is a compact subset of $$\mathbb {R}^d$$ with $$d \ge 10$$ . For these problems, we demonstrate that the actual convergence of global random search algorithms is much slower than that given by the classical estimates, based on the asymptotic properties of random points, and that the usually recommended space exploration schemes are inefficient in the non-asymptotic regime. Moreover, we show that uniform sampling on entire $${\mathcal {X}}$$ is much less efficient than uniform sampling on a suitable subset of $${\mathcal {X}}$$ , and that the effect of replacement of random points by low-discrepancy sequences can be felt in small dimensions only.- 24 July 2023
- Published by Springer Nature in Journal of Global Optimization
- Vol. 88 (1) , 1-26
Open AccessImproving exploration strategies in large dimensions and rate of convergence of global random search algorithms
We consider global optimization problems, where the feasible region $${\mathcal {X}}$$ is a compact subset of $$\mathbb {R}^d$$ with $$d \ge 10$$ . For these problems, we demonstrate that the actual convergence of global random search algorithms is much slower than that given by the classical estimates, based on the asymptotic properties of random points, and that the usually recommended space exploration schemes are inefficient in the non-asymptotic regime. Moreover, we show that uniform sampling on entire $${\mathcal {X}}$$ is much less efficient than uniform sampling on a suitable subset of $${\mathcal {X}}$$ , and that the effect of replacement of random points by low-discrepancy sequences can be felt in small dimensions only. - Open Access
- 15 June 2023
- Published by Elsevier in Journal of Approximation Theory
- Vol. 294
Quasi-uniform designs with optimal and near-optimal uniformity constant
- 15 June 2023
- Published by Elsevier in Journal of Approximation Theory
- Vol. 294
Open AccessQuasi-uniform designs with optimal and near-optimal uniformity constant
- 30 March 2023
- Published by Springer Nature in Statistical Papers
- Vol. 64 (4) , 1187-1208
BLUE against OLSE in the location model: energy minimization and asymptotic considerations
- 30 March 2023
- Published by Springer Nature in Statistical Papers
- Vol. 64 (4) , 1187-1208
BLUE against OLSE in the location model: energy minimization and asymptotic considerations