Jan van Waaij
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
Jan van Waaij has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Gabriel Renaud
Department of Health Technology, Section for Bioinformatics, Technical University of Denmark, Kongens Lyngby, Denmark
3 shared publications - B. J. K. Kleijn
Korteweg-de Vries Institute for Mathematics, University of Amsterdam, Science Park 105–107, 1098 XG Amsterdam, The Netherlands
2 shared publications - Peter Wad Sackett
Department of Health Technology, Section for Bioinformatics, Technical University of Denmark
2 shared publications B. J. K. Kleijn
1 shared publicationB.J.K. Kleijn
1 shared publicationHarry van Zanten
1 shared publication
Latest Publications
- Open Access
- 12 May 2026
- Published by Oxford University Press (OUP) in G3: Genes, Genomes, Genetics
- Vol. 16 (7)
CHARON: estimating the drift time and the number of individuals in environmental DNA with diploid individuals
Environmental DNA (eDNA) offers a promising avenue for reconstructing the genetic diversity and demographic history of ancient populations. However, the analysis of eDNA from humans or forensic DNA, presents significant challenges, including low coverage, DNA degradation, and the uncertainty of the number of individuals contributing to a sample. This study introduces CHARON, a novel statistical method for jointly estimating the number of individuals and drift times between a human eDNA or forensic sample and a given population with known allele frequencies. We validate our method through simulations and synthetic empirical data and show that we can reliably estimate the number of individuals up to 8 at a coverage between 2X and 4X. Our method can also pinpoint the most likely population of origin for eDNA or forensic samples. This work provides a tool for the application of human eDNA in evolutionary and forensic studies and an implementation is available here: https://github.com/Jan-van-Waaij/Charon.
- 12 May 2026
- Published by Oxford University Press (OUP) in G3: Genes, Genomes, Genetics
- Vol. 16 (7)
Open AccessCHARON: estimating the drift time and the number of individuals in environmental DNA with diploid individuals
Environmental DNA (eDNA) offers a promising avenue for reconstructing the genetic diversity and demographic history of ancient populations. However, the analysis of eDNA from humans or forensic DNA, presents significant challenges, including low coverage, DNA degradation, and the uncertainty of the number of individuals contributing to a sample. This study introduces CHARON, a novel statistical method for jointly estimating the number of individuals and drift times between a human eDNA or forensic sample and a given population with known allele frequencies. We validate our method through simulations and synthetic empirical data and show that we can reliably estimate the number of individuals up to 8 at a coverage between 2X and 4X. Our method can also pinpoint the most likely population of origin for eDNA or forensic samples. This work provides a tool for the application of human eDNA in evolutionary and forensic studies and an implementation is available here: https://github.com/Jan-van-Waaij/Charon.
- Open Access
CHARON: Estimating the drift time and the number of individuals in environmental DNA with diploid individuals
Environmental DNA (eDNA) offers a promising avenue for reconstructing the genetic diversity and demographic history of ancient populations. However, the analysis of eDNA from humans or forensic DNA, presents significant challenges, including low coverage, DNA degradation, and the uncertainty of the number of individuals contributing to a sample. This study introduces CHARON, a novel statistical method for jointly estimating the number of individuals and drift times between a human eDNA or forensic sample and a given population with known allele frequencies. We validate our method through simulations and synthetic empirical data and show that we can reliably estimate the number of individuals up to 8 at a coverage between 2X and 4X. Our method can also pinpoint the most likely population of origin for eDNA or forensic samples. This work provides a tool for the application of human eDNA in evolutionary and forensic studies and an implementation is available here: https://github.com/Jan-van-Waaij/Charon.
Open AccessCHARON: Estimating the drift time and the number of individuals in environmental DNA with diploid individuals
Environmental DNA (eDNA) offers a promising avenue for reconstructing the genetic diversity and demographic history of ancient populations. However, the analysis of eDNA from humans or forensic DNA, presents significant challenges, including low coverage, DNA degradation, and the uncertainty of the number of individuals contributing to a sample. This study introduces CHARON, a novel statistical method for jointly estimating the number of individuals and drift times between a human eDNA or forensic sample and a given population with known allele frequencies. We validate our method through simulations and synthetic empirical data and show that we can reliably estimate the number of individuals up to 8 at a coverage between 2X and 4X. Our method can also pinpoint the most likely population of origin for eDNA or forensic samples. This work provides a tool for the application of human eDNA in evolutionary and forensic studies and an implementation is available here: https://github.com/Jan-van-Waaij/Charon.
- Open Access
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Journal of Statistics
- Vol. 19 (2) , 5147-5170
Confidence sets in a sparse stochastic block model with two communities of unknown sizes
In a sparse stochastic block model with two communities of unequal sizes we derive two posterior concentration inequalities, that imply (1) posterior (almost-)exact recovery of the community structure under sparsity bounds comparable to well-known sharp bounds in the planted bi-section model; (2) a construction of confidence sets for the community assignment from credible sets, with finite graph sizes. The latter enables exact frequentist uncertainty quantification with Bayesian credible sets at non-asymptotic graph sizes, where posteriors can be simulated well. There turns out to be no proportionality between credible and confidence levels: for given edge probabilities and a desired confidence level, there exists a critical graph size where the required credible level drops sharply from close-to-one to close-to-zero. At such graph sizes the frequentist decides to include not most of the posterior support for the construction of his confidence set, but only a small subset of community assignments containing the highest amounts of posterior probability (like the maximum-a-posteriori estimator). It is argued that for the proposed construction of confidence sets, a form of early stopping applies to MCMC sampling of the posterior, which would enable the computation of confidence sets at larger graph sizes.
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Journal of Statistics
- Vol. 19 (2) , 5147-5170
Open AccessConfidence sets in a sparse stochastic block model with two communities of unknown sizes
In a sparse stochastic block model with two communities of unequal sizes we derive two posterior concentration inequalities, that imply (1) posterior (almost-)exact recovery of the community structure under sparsity bounds comparable to well-known sharp bounds in the planted bi-section model; (2) a construction of confidence sets for the community assignment from credible sets, with finite graph sizes. The latter enables exact frequentist uncertainty quantification with Bayesian credible sets at non-asymptotic graph sizes, where posteriors can be simulated well. There turns out to be no proportionality between credible and confidence levels: for given edge probabilities and a desired confidence level, there exists a critical graph size where the required credible level drops sharply from close-to-one to close-to-zero. At such graph sizes the frequentist decides to include not most of the posterior support for the construction of his confidence set, but only a small subset of community assignments containing the highest amounts of posterior probability (like the maximum-a-posteriori estimator). It is argued that for the proposed construction of confidence sets, a form of early stopping applies to MCMC sampling of the posterior, which would enable the computation of confidence sets at larger graph sizes.
- Open Access
SAFARI: Pangenome Alignment of Ancient DNA Using Purine/Pyrimidine Encodings
Aligning DNA sequences retrieved from fossils or other paleontological artifacts, referred to as ancient DNA, is particularly challenging due to the short sequence length and chemical damage which creates a specific pattern of substitution (C→T and G→A) in addition to the heightened divergence between the sample and the reference genome thus exacerbating reference bias. This bias can be mitigated by aligning to pangenome graphs to incorporate documented organismic variation, but this approach still suffers from substitution patterns due to chemical damage. We introduce a novel methodology introducing the RYmer index, a variant of the commonly-used minimizer index which represents purines (A,G) and pyrimidines (C,T) as R and Y respectively. This creates an indexing scheme robust to the aforementioned chemical damage. We implemented SAFARI , an ancient DNA damage-aware version of the pangenome aligner vg giraffe which uses RYmers to rescue alignments containing deaminated seeds. We show that our approach produces more correct alignments from ancient DNA sequences than current approaches while maintaining a tolerable rate of spurious alignments. In addition, we demonstrate that our algorithm improves the estimate of the rate of ancient DNA damage, especially for highly damaged samples. Crucially, we show that this improved alignment can directly translate into better insights gained from the data by showcasing its integration with a number of extant pangenome tools.
Open AccessSAFARI: Pangenome Alignment of Ancient DNA Using Purine/Pyrimidine Encodings
Aligning DNA sequences retrieved from fossils or other paleontological artifacts, referred to as ancient DNA, is particularly challenging due to the short sequence length and chemical damage which creates a specific pattern of substitution (C→T and G→A) in addition to the heightened divergence between the sample and the reference genome thus exacerbating reference bias. This bias can be mitigated by aligning to pangenome graphs to incorporate documented organismic variation, but this approach still suffers from substitution patterns due to chemical damage. We introduce a novel methodology introducing the RYmer index, a variant of the commonly-used minimizer index which represents purines (A,G) and pyrimidines (C,T) as R and Y respectively. This creates an indexing scheme robust to the aforementioned chemical damage. We implemented SAFARI , an ancient DNA damage-aware version of the pangenome aligner vg giraffe which uses RYmers to rescue alignments containing deaminated seeds. We show that our approach produces more correct alignments from ancient DNA sequences than current approaches while maintaining a tolerable rate of spurious alignments. In addition, we demonstrate that our algorithm improves the estimate of the rate of ancient DNA damage, especially for highly damaged samples. Crucially, we show that this improved alignment can directly translate into better insights gained from the data by showcasing its integration with a number of extant pangenome tools.
- Open Access
- 29 April 2023
- Published by Elsevier in Journal of Statistical Planning and Inference
- Vol. 227, 112-128
Asymptotic uncertainty quantification for communities in sparse planted bi-section models
- 29 April 2023
- Published by Elsevier in Journal of Statistical Planning and Inference
- Vol. 227, 112-128
Open AccessAsymptotic uncertainty quantification for communities in sparse planted bi-section models
- Open Access
Asymptotic uncertainty quantification for communities in sparse planted bi-section models
Posterior distributions for community structure in sparse planted bi-section models are shown to achieve exact (resp. almost-exact) recovery, with sharp bounds for the sparsity regimes where edge probabilities decrease as $O(\log(n)/n)$ (resp. $O(1/n)$). Assuming posterior recovery, one may interpret credible sets (resp. enlarged credible sets) as asymptotically consistent confidence sets; the diameters of those credible sets are controlled by the rate of posterior concentration. If credible levels are chosen to grow to one quickly enough, corresponding credible sets can be interpreted as frequentist confidence sets without conditions on posterior concentration. In the regimes with $O(1/n)$ edge sparsity, or when within-community and between-community edge probabilities are very close, credible sets may be enlarged to achieve frequentist asymptotic coverage, also without conditions on posterior concentration.Open AccessAsymptotic uncertainty quantification for communities in sparse planted bi-section models
Posterior distributions for community structure in sparse planted bi-section models are shown to achieve exact (resp. almost-exact) recovery, with sharp bounds for the sparsity regimes where edge probabilities decrease as $O(\log(n)/n)$ (resp. $O(1/n)$). Assuming posterior recovery, one may interpret credible sets (resp. enlarged credible sets) as asymptotically consistent confidence sets; the diameters of those credible sets are controlled by the rate of posterior concentration. If credible levels are chosen to grow to one quickly enough, corresponding credible sets can be interpreted as frequentist confidence sets without conditions on posterior concentration. In the regimes with $O(1/n)$ edge sparsity, or when within-community and between-community edge probabilities are very close, credible sets may be enlarged to achieve frequentist asymptotic coverage, also without conditions on posterior concentration. - Open Access
Uncertainty quantification in the stochastic block model with an unknown number of classes
We study the frequentist properties of Bayesian statistical inference for the stochastic block model, with an unknown number of classes of varying sizes. We equip the space of vertex labellings with a prior on the number of classes and, conditionally, a prior on the labels. The number of classes may grow to infinity as a function of the number of vertices, depending on the sparsity of the graph. We derive non-asymptotic posterior contraction rates of the form $P_{\theta_{0,n}}\Pi_n(B_n\mid X^n)\le \epsilon_n$, where $X^n$ is the observed graph, generated according to $P_{\theta_{0,n}}$, $B_n$ is either $\{\theta_{0, n}\}$ or, in the very sparse case, a ball around $\theta_{0,n}$ of known extent, and $\epsilon_n$ is an explicit rate of convergence. These results enable conversion of credible sets to confidence sets. In the sparse case, credible tests are shown to be confidence sets. In the very sparse case, credible sets are enlarged to form confidence sets. Confidence levels are explicit, for each $n$, as a function of the credible level and the rate of convergence. Hypothesis testing between the number of classes is considered with the help of posterior odds, and is shown to be consistent. Explicit upper bounds on errors of the first and second type and an explicit lower bound on the power of the tests are given.Open AccessUncertainty quantification in the stochastic block model with an unknown number of classes
We study the frequentist properties of Bayesian statistical inference for the stochastic block model, with an unknown number of classes of varying sizes. We equip the space of vertex labellings with a prior on the number of classes and, conditionally, a prior on the labels. The number of classes may grow to infinity as a function of the number of vertices, depending on the sparsity of the graph. We derive non-asymptotic posterior contraction rates of the form $P_{\theta_{0,n}}\Pi_n(B_n\mid X^n)\le \epsilon_n$, where $X^n$ is the observed graph, generated according to $P_{\theta_{0,n}}$, $B_n$ is either $\{\theta_{0, n}\}$ or, in the very sparse case, a ball around $\theta_{0,n}$ of known extent, and $\epsilon_n$ is an explicit rate of convergence. These results enable conversion of credible sets to confidence sets. In the sparse case, credible tests are shown to be confidence sets. In the very sparse case, credible sets are enlarged to form confidence sets. Confidence levels are explicit, for each $n$, as a function of the credible level and the rate of convergence. Hypothesis testing between the number of classes is considered with the help of posterior odds, and is shown to be consistent. Explicit upper bounds on errors of the first and second type and an explicit lower bound on the power of the tests are given. - Open Access
Adaptive posterior contraction rates for empirical Bayesian drift estimation of a diffusion
Due to their conjugate posteriors, Gaussian process priors are attractive for estimating the drift of stochastic differential equations with continuous time observations. However, their performance strongly depends on the choice of the hyper-parameters. We employ the marginal maximum likelihood estimator to estimate the scaling and/or smoothness parameter(s) of the prior and show that the corresponding posterior has optimal rates of convergence. General theorems do not apply directly to this model as the usual test functions are with respect to a random Hellinger-type metric. We allow for continuous and discrete, one- and two-dimensional sets of hyper-parameters, where optimising over the two-dimensional set of smoothness and scaling hyper-parameters is shown to be beneficial in terms of the adaptive range.
Open AccessAdaptive posterior contraction rates for empirical Bayesian drift estimation of a diffusion
Due to their conjugate posteriors, Gaussian process priors are attractive for estimating the drift of stochastic differential equations with continuous time observations. However, their performance strongly depends on the choice of the hyper-parameters. We employ the marginal maximum likelihood estimator to estimate the scaling and/or smoothness parameter(s) of the prior and show that the corresponding posterior has optimal rates of convergence. General theorems do not apply directly to this model as the usual test functions are with respect to a random Hellinger-type metric. We allow for continuous and discrete, one- and two-dimensional sets of hyper-parameters, where optimising over the two-dimensional set of smoothness and scaling hyper-parameters is shown to be beneficial in terms of the adaptive range.
- 1 April 2017
- Published by Elsevier in Statistics & Probability Letters
- Vol. 123, 93-99
Full adaptation to smoothness using randomly truncated series priors with Gaussian coefficients and inverse gamma scaling
- 1 April 2017
- Published by Elsevier in Statistics & Probability Letters
- Vol. 123, 93-99
Full adaptation to smoothness using randomly truncated series priors with Gaussian coefficients and inverse gamma scaling