NKNathan Kirk

Nathan Kirk

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Nathan Kirk has a total of 2 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Partitions for stratified sampling

    by François Clément, Nathan Kirk, Florian Pausinger

    Classical jittered sampling partitions [ 0 , 1 ] d {[0,1]^{d}} into m d {m^{d}} cubes for a positive integer m and randomly places a point inside each of them, providing a point set of size N = m d {N=m^{d}} with small discrepancy. The aim of this note is to provide a construction of partitions that works for arbitrary N and improves straight-forward constructions. We show how to construct equivolume partitions of the d-dimensional unit cube with hyperplanes that are orthogonal to the main diagonal of the cube. We investigate the discrepancy of such point sets and optimise the expected discrepancy numerically by relaxing the equivolume constraint using different black-box optimisation techniques.


  • Open Access

    On the Expected ℒ2–Discrepancy of Jittered Sampling

    by Nathan Kirk, Florian Pausinger

    For m, d ∈ ℕ, a jittered sample of N = md points can be constructed by partitioning [0, 1]d into md axis-aligned equivolume boxes and placing one point independently and uniformly at random inside each box. We utilise a formula for the expected ℒ2−discrepancy of stratified samples stemming from general equivolume partitions of [0, 1]d which recently appeared, to derive a closed form expression for the expected ℒ2−discrepancy of a jittered point set for any m, d ∈ ℕ. As a second main result we derive a similar formula for the expected Hickernell ℒ2−discrepancy of a jittered point set which also takes all projections of the point set to lower dimensional faces of the unit cube into account.


  • Open Access

    Partitions for stratified sampling

    by Francois Clement, Nathan Kirk, Florian Pausinger

    Classical jittered sampling partitions $[0,1]^d$ into $m^d$ cubes for a positive integer $m$ and randomly places a point inside each of them, providing a point set of size $N=m^d$ with small discrepancy. The aim of this note is to provide a construction of partitions that works for arbitrary $N$ and improves straight-forward constructions. We show how to construct equivolume partitions of the $d$-dimensional unit cube with hyperplanes that are orthogonal to the main diagonal of the cube. We investigate the discrepancy of such point sets and optimise the expected discrepancy numerically by relaxing the equivolume constraint using different black-box optimisation techniques.

  • Open Access

    On the expected L2-discrepancy of jittered sampling

    by Nathan Kirk, Florian Pausinger

    For $m, d \in \mathbb{N}$, a jittered sample of $N=m^d$ points can be constructed by partitioning $[0,1]^d$ into $m^d$ axis-aligned equivolume boxes and placing one point independently and uniformly at random inside each box. We utilise a formula for the expected $\mathcal{L}_2-$discrepancy of stratified samples stemming from general equivolume partitions of $[0,1]^d$ which recently appeared, to derive a closed form expression for the expected $\mathcal{L}_2-$discrepancy of a jittered point set for any $m, d \in \mathbb{N}$. As a second main result we derive a similar formula for the expected Hickernell $\mathcal{L}_2-$discrepancy of a jittered point set which also takes all projections of the point set to lower dimensional faces of the unit cube into account.

  • Open Access

    On Proinov's lower bound for the diaphony

    by Nathan Kirk

    In 1986, Proinov published an explicit lower bound for the diaphony of both finite and infinite sequences of points in the d-dimensional unit cube. To the best of our knowledge, the proofs of these results were so far only available in a monograph of Proinov written in Bulgarian. The first contribution of our paper is to give a self contained version of Proinov's proof in English. Along the way, we improve the asymptotic constants using recent and corrected results of Hinrichs and Markhasin. Finally, as a main result, we use the method of Proinov to derive an explicit lower bound for the dyadic diaphony of finite and infinite sequences in a similar fashion.