Christopher M. van Bommel
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
Christopher M. van Bommel has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Stephen Finbow
Department of Mathematics and Statistics St. Francis Xavier University Antigonish NS Canada
2 shared publications - Benjamin Benteke Longaou
University of Guelph, Guelph, Ontario, Canada
1 shared publication Christina M. Mynhardt
1 shared publication- David Lyver
University of Guelph
1 shared publication - Edward Wolfgang Thommes
Sanofi
1 shared publication - Gabriel Coutinho
Department of Computer Science, Federal University of Minas Gerais, Belo Horizonte, Minas Gerais 31270-901, Brazil
1 shared publication
Latest Publications
- Open Access
- 1 December 2026
- Published by KEAI Publishing in Infectious Disease Modelling
- Vol. 11 (4) , 1504-1516
Expanding optimization ensemble model methods for forecasting seasonal influenza in the U.S.
Each year, the seasonal influenza epidemic sees significant variability in its evolution. Accurate forecasts of future influenza cases are important for planning public health responses. The United States Centers for Disease Control and Prevention (CDC) has annually organized the FluSight competition (https://github.com/cdcepi/FluSight-forecast-hub) to solicit forecasts from participating teams over horizons of 0, 1, 2, and 3 weeks ahead. Using these data, the CDC produces an ensemble forecast of all submitted forecasts. In this paper, we introduce a new weight-based ensemble forecasting method to consider predicting laboratory-confirmed influenza hospital admissions for the 2024-2025 season. The method consists of determining optimal weights that are updated week-by-week throughout the FluSight competition to minimize the mean squared error (MSE) of a blend of teams’ previous forecasts compared to the truth data. Using these weights over an expanding time window starting at the beginning of the season (late Fall), we produce our own future forecasts; we call our method the expanding window optimization (EWO). The results indicate that EWO achieves superior average performance compared to the CDC ensemble, exhibiting lower mean absolute error (MAE) and weighted interval score (WIS) across all forecast horizons. To further improve performance, the adjusted weighted-EWO (Adw-EWO) is introduced, which augments EWO with a correction term governed by a parameter π ∈ (0, 1) derived from horizon-0 forecast errors and applied uniformly across horizons. Adw-EWO yields additional improvements, particularly at horizon 0. Phase-based analysis reveals that Adw-EWO performs optimally during epidemic growth and peak periods, whereas EWO is effective in early growth but less robust under abrupt changes. In contrast, the CDC ensemble performs better during the decay phase.
- 1 December 2026
- Published by KEAI Publishing in Infectious Disease Modelling
- Vol. 11 (4) , 1504-1516
Open AccessExpanding optimization ensemble model methods for forecasting seasonal influenza in the U.S.
Each year, the seasonal influenza epidemic sees significant variability in its evolution. Accurate forecasts of future influenza cases are important for planning public health responses. The United States Centers for Disease Control and Prevention (CDC) has annually organized the FluSight competition (https://github.com/cdcepi/FluSight-forecast-hub) to solicit forecasts from participating teams over horizons of 0, 1, 2, and 3 weeks ahead. Using these data, the CDC produces an ensemble forecast of all submitted forecasts. In this paper, we introduce a new weight-based ensemble forecasting method to consider predicting laboratory-confirmed influenza hospital admissions for the 2024-2025 season. The method consists of determining optimal weights that are updated week-by-week throughout the FluSight competition to minimize the mean squared error (MSE) of a blend of teams’ previous forecasts compared to the truth data. Using these weights over an expanding time window starting at the beginning of the season (late Fall), we produce our own future forecasts; we call our method the expanding window optimization (EWO). The results indicate that EWO achieves superior average performance compared to the CDC ensemble, exhibiting lower mean absolute error (MAE) and weighted interval score (WIS) across all forecast horizons. To further improve performance, the adjusted weighted-EWO (Adw-EWO) is introduced, which augments EWO with a correction term governed by a parameter π ∈ (0, 1) derived from horizon-0 forecast errors and applied uniformly across horizons. Adw-EWO yields additional improvements, particularly at horizon 0. Phase-based analysis reveals that Adw-EWO performs optimally during epidemic growth and peak periods, whereas EWO is effective in early growth but less robust under abrupt changes. In contrast, the CDC ensemble performs better during the decay phase.
- 14 June 2022
- Published by Springer Nature in Quantum Information Processing
- Vol. 21 (6) , 1-39
State transfer on paths with weighted loops
- 14 June 2022
- Published by Springer Nature in Quantum Information Processing
- Vol. 21 (6) , 1-39
State transfer on paths with weighted loops
- 1 August 2021
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 299, 82-86
Italian domination of Cartesian products of directed cycles
- 1 August 2021
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 299, 82-86
Italian domination of Cartesian products of directed cycles
- 1 May 2021
- Published by Rinton Press in Quantum Information & Computation
- Vol. 21 (5&6) , 361-376
Pretty good state transfer of multiple qubit states on paths
We discuss pretty good state transfer of multiple qubit states and provide a model for considering state transfer of arbitrary states on unmodulated XX-type spin chains. We then provide families of paths and initial states for which we can determine whether there is pretty good state transfer based on the eigenvalue support of the initial state.
- 1 May 2021
- Published by Rinton Press in Quantum Information & Computation
- Vol. 21 (5&6) , 361-376
Pretty good state transfer of multiple qubit states on paths
We discuss pretty good state transfer of multiple qubit states and provide a model for considering state transfer of arbitrary states on unmodulated XX-type spin chains. We then provide families of paths and initial states for which we can determine whether there is pretty good state transfer based on the eigenvalue support of the initial state.
- Open Access
A Bipartite Graph That Is Not the $γ$-Graph of a Bipartite Graph
For a graph $G = (V, E)$, the $\gamma$-graph of $G$ is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent if they differ by a single vertex and the two different vertices are adjacent in $G$. An open question in $\gamma$-graphs is whether every bipartite graph is the $\gamma$-graph of some bipartite graph. We answer this question in the negative by demonstrating that $K_{2, 3}$ is not the $\gamma$-graph of any bipartite graph.Open AccessA Bipartite Graph That Is Not the $γ$-Graph of a Bipartite Graph
For a graph $G = (V, E)$, the $\gamma$-graph of $G$ is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent if they differ by a single vertex and the two different vertices are adjacent in $G$. An open question in $\gamma$-graphs is whether every bipartite graph is the $\gamma$-graph of some bipartite graph. We answer this question in the negative by demonstrating that $K_{2, 3}$ is not the $\gamma$-graph of any bipartite graph. - Open Access
Italian Domination of Cartesian Products of Directed Cycles
An Italian dominating function on a (di)graph $G$ with vertex set $V(G)$ is a function $f: V(G) \to \{0, 1, 2\}$ such that every vertex $v \in V(G)$ such that $f(v) = 0$ has an (in)neighbour assigned 2 or two (in)neighbours assigned 1. We complete the investigation of the Italian domination numbers of Cartesian products of directed cycles.Open AccessItalian Domination of Cartesian Products of Directed Cycles
An Italian dominating function on a (di)graph $G$ with vertex set $V(G)$ is a function $f: V(G) \to \{0, 1, 2\}$ such that every vertex $v \in V(G)$ such that $f(v) = 0$ has an (in)neighbour assigned 2 or two (in)neighbours assigned 1. We complete the investigation of the Italian domination numbers of Cartesian products of directed cycles. - Open Access
Pretty Good State Transfer and Minimal Polynomials
We examine conditions for a pair of strongly cospectral vertices to have pretty good quantum state transfer in terms of minimal polynomials, and provide cases where pretty good state transfer can be ruled out. We also provide new examples of simple, unweighted graphs exhibiting pretty good state transfer. Finally, we consider modifying paths by adding symmetric weighted edges, and apply these results to this case.
Open AccessPretty Good State Transfer and Minimal Polynomials
We examine conditions for a pair of strongly cospectral vertices to have pretty good quantum state transfer in terms of minimal polynomials, and provide cases where pretty good state transfer can be ruled out. We also provide new examples of simple, unweighted graphs exhibiting pretty good state transfer. Finally, we consider modifying paths by adding symmetric weighted edges, and apply these results to this case.
- 1 October 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 285, 182-187
A short note on the existence of infinite sequences of -graphs of graphs- 1 October 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 285, 182-187
A short note on the existence of infinite sequences of -graphs of graphs- Open Access
Pretty Good State Transfer of Multiple Qubit States on Paths
We discuss pretty good state transfer of multiple qubit states and provide a model for considering state transfer of arbitrary states on unmodulated XX-type spin chains. We then provide families of paths and initial states for which we can determine whether there is pretty good state transfer based on the eigenvalue support of the initial state.
Open AccessPretty Good State Transfer of Multiple Qubit States on Paths
We discuss pretty good state transfer of multiple qubit states and provide a model for considering state transfer of arbitrary states on unmodulated XX-type spin chains. We then provide families of paths and initial states for which we can determine whether there is pretty good state transfer based on the eigenvalue support of the initial state.
- Open Access
- 30 July 2019
- Published by MDPI AG in Algorithms
- Vol. 12 (8) , 153
γ-Graphs of Trees
For a graph , the -graph of G, denoted , is the graph whose vertex set is the collection of minimum dominating sets, or -sets of G, and two -sets are adjacent in if they differ by a single vertex and the two different vertices are adjacent in G. In this paper, we consider -graphs of trees. We develop an algorithm for determining the -graph of a tree, characterize which trees are -graphs of trees, and further comment on the structure of -graphs of trees and its connections with Cartesian product graphs, the set of graphs which can be obtained from the Cartesian product of graphs of order at least two.- 30 July 2019
- Published by MDPI AG in Algorithms
- Vol. 12 (8) , 153
Open Accessγ-Graphs of Trees
For a graph , the -graph of G, denoted , is the graph whose vertex set is the collection of minimum dominating sets, or -sets of G, and two -sets are adjacent in if they differ by a single vertex and the two different vertices are adjacent in G. In this paper, we consider -graphs of trees. We develop an algorithm for determining the -graph of a tree, characterize which trees are -graphs of trees, and further comment on the structure of -graphs of trees and its connections with Cartesian product graphs, the set of graphs which can be obtained from the Cartesian product of graphs of order at least two.