Mark Anthony Cayanan Tolentino
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mark Anthony Cayanan Tolentino has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Timothy Robin Y. Teng
Department of Mathematics, Ateneo de Manila University, Quezon City, Philippines
4 shared publications - Elvira de Lara-Tuprio
Department of Mathematics, Ateneo de Manila University, Quezon City, Philippines
3 shared publications Mari-Jo P. Ruiz
Ateneo de Manila University
3 shared publications- Reginaldo M. Marcelo
Ateneo de Manila University
3 shared publications - Agnes D. Garciano
Ateneo de Manila University
2 shared publications - Christian Pulmano
Department of Information Systems and Computer Science, Ateneo de Manila University, Quezon City, Philippines
2 shared publications
Latest Publications
- 26 May 2026
- Published by Philippine-American Academy of Science and Engineering in SciEnggJ
- Vol. 19 (Supplement) , 108-122
Using machine learning models for near-term forecasting of dengue cases in Quezon City, Philippines
Dengue is a vector-borne illness that has been a long-standing health concern in the Philippines. The disease is endemic in all regions of the country, especially in highly urbanized areas like the National Capital Region (NCR), and particularly in Quezon City (QC). The local government of QC, through the Quezon City Epidemiology and Surveillance Division (QCESD), uses a real-time monitoring system that tracks epidemic levels, reports cases by barangay, and identifies high-risk areas requiring public health interventions. The QCESD continues to enhance its system by finding ways to generate actionable insights from the epidemiological data collected. This study aims to contribute to this effort by supplementing surveillance with dengue forecasting tools. Specifically, machine learning models capable of predicting dengue incidence using epidemiological, meteorological, environmental, and socioeconomic data were implemented. Different machine learning models were explored and their performance assessed in terms of predictive accuracy and robustness. Aside from case forecasts, the factors with the greatest influence on predicted case trajectories were also identified.
- 26 May 2026
- Published by Philippine-American Academy of Science and Engineering in SciEnggJ
- Vol. 19 (Supplement) , 108-122
Using machine learning models for near-term forecasting of dengue cases in Quezon City, Philippines
Dengue is a vector-borne illness that has been a long-standing health concern in the Philippines. The disease is endemic in all regions of the country, especially in highly urbanized areas like the National Capital Region (NCR), and particularly in Quezon City (QC). The local government of QC, through the Quezon City Epidemiology and Surveillance Division (QCESD), uses a real-time monitoring system that tracks epidemic levels, reports cases by barangay, and identifies high-risk areas requiring public health interventions. The QCESD continues to enhance its system by finding ways to generate actionable insights from the epidemiological data collected. This study aims to contribute to this effort by supplementing surveillance with dengue forecasting tools. Specifically, machine learning models capable of predicting dengue incidence using epidemiological, meteorological, environmental, and socioeconomic data were implemented. Different machine learning models were explored and their performance assessed in terms of predictive accuracy and robustness. Aside from case forecasts, the factors with the greatest influence on predicted case trajectories were also identified.
- 9 December 2025
- Published by Universiti Putra Malaysia in Malaysian Journal of Mathematical Sciences
- Vol. 19 (4) , 1553
Identification Number of Antiprism Graphs
Let G be a simple, connected, undirected, nontrivial graph and let c be a coloring of the vertices of G using the colors red and white such that not all the vertices are colored white. For each vertex v of G , we can assign a vector code d⃗ (v)=(a1,a2,…,adiam(G)) , where diam(G) is the diameter of G and, for each i=1,2,…,diam(G) , the component ai is equal to the number of red vertices whose distance to v is i . Then, c is said to be an ID-coloring of G if d⃗ (v)≠d⃗ (w) for any pair of distinct vertices v and w . If G has an identification coloring, it is called an ID-graph and its identification number ID(G) is defined to be the least number of red vertices needed to construct an ID-coloring of G . An ID-coloring of G can be used to distinguish its vertices from each other and this is particularly interesting when G has nontrivial automorphisms. Indeed, identification colorings have been studied for paths, cycles, grids, prisms, and some tree families, including caterpillar and lobster graphs. In this paper, we consider identification colorings for antiprism graphs, which have not been previously studied in relation to this topic. An antiprism graph is a graph that corresponds to the skeleton of an antiprism. Antiprism graphs are known to be vertex-transitive; thus, they possess nontrivial automorphisms. Our results include a characterization of all ID-antiprisms and the determination of the identification number of any ID-antiprism.
- 9 December 2025
- Published by Universiti Putra Malaysia in Malaysian Journal of Mathematical Sciences
- Vol. 19 (4) , 1553
Identification Number of Antiprism Graphs
Let G be a simple, connected, undirected, nontrivial graph and let c be a coloring of the vertices of G using the colors red and white such that not all the vertices are colored white. For each vertex v of G , we can assign a vector code d⃗ (v)=(a1,a2,…,adiam(G)) , where diam(G) is the diameter of G and, for each i=1,2,…,diam(G) , the component ai is equal to the number of red vertices whose distance to v is i . Then, c is said to be an ID-coloring of G if d⃗ (v)≠d⃗ (w) for any pair of distinct vertices v and w . If G has an identification coloring, it is called an ID-graph and its identification number ID(G) is defined to be the least number of red vertices needed to construct an ID-coloring of G . An ID-coloring of G can be used to distinguish its vertices from each other and this is particularly interesting when G has nontrivial automorphisms. Indeed, identification colorings have been studied for paths, cycles, grids, prisms, and some tree families, including caterpillar and lobster graphs. In this paper, we consider identification colorings for antiprism graphs, which have not been previously studied in relation to this topic. An antiprism graph is a graph that corresponds to the skeleton of an antiprism. Antiprism graphs are known to be vertex-transitive; thus, they possess nontrivial automorphisms. Our results include a characterization of all ID-antiprisms and the determination of the identification number of any ID-antiprism.
- Open Access
- 28 October 2025
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 13 (2) , 295-307
On the sigma chromatic number of the ideal-based zero divisor graphs of the ring of integers modulo n
On the sigma chromatic number of the ideal-based zero divisor graphs of the ring of integers modulo n
- 28 October 2025
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 13 (2) , 295-307
Open AccessOn the sigma chromatic number of the ideal-based zero divisor graphs of the ring of integers modulo n
On the sigma chromatic number of the ideal-based zero divisor graphs of the ring of integers modulo n
- Open Access
- 16 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 312-316
Citywide District-Level Weekly Dengue Forecasting: Evaluation of Bayesian Spatiotemporal Models for Routine Surveillance
- 16 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 312-316
Open AccessCitywide District-Level Weekly Dengue Forecasting: Evaluation of Bayesian Spatiotemporal Models for Routine Surveillance
- 3 February 2025
- Published by Springer Nature in The Mathematical Intelligencer
- Vol. 47 (1) , 77-87
The Mathematical Experience Museum: Breathing Life into Theorems and Formulas
- 3 February 2025
- Published by Springer Nature in The Mathematical Intelligencer
- Vol. 47 (1) , 77-87
The Mathematical Experience Museum: Breathing Life into Theorems and Formulas
- Open Access
- 2 October 2024
- Published by Elsevier in Alexandria Engineering Journal
- Vol. 109, 914-924
Enhancing mathematical models for COVID-19 pandemic response: A Philippine study
- 2 October 2024
- Published by Elsevier in Alexandria Engineering Journal
- Vol. 109, 914-924
Open AccessEnhancing mathematical models for COVID-19 pandemic response: A Philippine study
- 28 February 2024
- Published by World Scientific Pub Co Pte Ltd in Journal of Interconnection Networks
- Vol. 25 (01)
On the Vertex Identification Spectra of Grids
Let [ ] be a red–white coloring of the vertices of a nontrivial connected graph [ ] with diameter [ ], where at least one vertex is colored red. Then [ ] is called an identification coloring or simply, an ID-coloring, if and only if for any two vertices [ ] and [ ], [ ], where for any vertex [ ], [ ] and [ ] is the number of red vertices at a distance [ ] from [ ]. A graph is said to be an ID-graph if it possesses an ID-coloring. If [ ] is an ID-graph, then the spectrum of [ ] is the set of all positive integers [ ] for which [ ] has an ID-coloring with [ ] red vertices. The identification number or ID-number of a graph is the smallest element in its spectrum. In this paper, we extend a result of Kono and Zhang on the identification number of grids [ ]. In particular, we give a formulation of strong ID-coloring and use it to give a sufficient condition for an ID-coloring of a graph to be extendable to an ID-coloring of the Cartesian product of a path [ ] with [ ]. Consequently, some elements of the spectrum of grids [ ] for positive integers [ ] and [ ], with [ ], are obtained. The complete spectrum of ladders [ ] is then determined using systematic constructions of ID-colorings of the ladders.
- 28 February 2024
- Published by World Scientific Pub Co Pte Ltd in Journal of Interconnection Networks
- Vol. 25 (01)
On the Vertex Identification Spectra of Grids
Let [ ] be a red–white coloring of the vertices of a nontrivial connected graph [ ] with diameter [ ], where at least one vertex is colored red. Then [ ] is called an identification coloring or simply, an ID-coloring, if and only if for any two vertices [ ] and [ ], [ ], where for any vertex [ ], [ ] and [ ] is the number of red vertices at a distance [ ] from [ ]. A graph is said to be an ID-graph if it possesses an ID-coloring. If [ ] is an ID-graph, then the spectrum of [ ] is the set of all positive integers [ ] for which [ ] has an ID-coloring with [ ] red vertices. The identification number or ID-number of a graph is the smallest element in its spectrum. In this paper, we extend a result of Kono and Zhang on the identification number of grids [ ]. In particular, we give a formulation of strong ID-coloring and use it to give a sufficient condition for an ID-coloring of a graph to be extendable to an ID-coloring of the Cartesian product of a path [ ] with [ ]. Consequently, some elements of the spectrum of grids [ ] for positive integers [ ] and [ ], with [ ], are obtained. The complete spectrum of ladders [ ] is then determined using systematic constructions of ID-colorings of the ladders.
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3080 (1) , 070005
Insights on the hierarchy of letters in scrabble using cosine similarity, minimum spanning tree, and centrality analysis
This study aims to generate insights on the hierarchy and importance of letters in the game Scrabble by employing two operational research frameworks. Both fram
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3080 (1) , 070005
Insights on the hierarchy of letters in scrabble using cosine similarity, minimum spanning tree, and centrality analysis
This study aims to generate insights on the hierarchy and importance of letters in the game Scrabble by employing two operational research frameworks. Both fram
- Open Access
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3016 (1)
Mathematical analysis of a COVID-19 SEIQR model with time-varying transmission
Threshold conditions for a COVID-19 susceptible-exposed-infectious-treated-recovered (SEIQR) model with constant recruitment rate and time-varying transmission rate are studied. Results show that the condition < 1, with as the reproduction number of the average system, is sufficient but not necessary to establish the local asymptotic stability of the disease-free equilibrium of the system (SEIQR). Furthermore, as long as < 1, the disease is eradicated regardless of the number of infectious agents at the beginning.- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3016 (1)
Open AccessMathematical analysis of a COVID-19 SEIQR model with time-varying transmission
Threshold conditions for a COVID-19 susceptible-exposed-infectious-treated-recovered (SEIQR) model with constant recruitment rate and time-varying transmission rate are studied. Results show that the condition < 1, with as the reproduction number of the average system, is sufficient but not necessary to establish the local asymptotic stability of the disease-free equilibrium of the system (SEIQR). Furthermore, as long as < 1, the disease is eradicated regardless of the number of infectious agents at the beginning. - Open Access
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1836 (1) , 012014
The set chromatic numbers of the middle graph of graphs
For a simple connected graphG, letc:V(G) → ℕ be a vertex coloring ofG,where adjacent vertices may be colored the same. The neighborhood color set of a vertexv, denoted byNC(v), is the set of colors of the neighbors ofv. The coloringcis called aset coloringprovided thatNC(u) ≠NC(v) for every pair of adjacent verticesuandvofG. The minimum number of colors needed for a set coloring ofGis referred to as the setchromatic numberofGand is denoted byχs(G).In this work, the set chromatic number of graphs is studied in relation to the graph operation called middle graph. Our results include the exact set chromatic numbers of the middle graph of cycles, paths, star graphs, double-star graphs, and some trees of height 2. Moreover, we establish the sharpness of some bounds on the set chromatic number of general graphs obtained using this operation. Finally, we develop an algorithm for constructing an optimal set coloring of the middle graph of trees of height 2 under some assumptions.
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1836 (1) , 012014
Open AccessThe set chromatic numbers of the middle graph of graphs
For a simple connected graphG, letc:V(G) → ℕ be a vertex coloring ofG,where adjacent vertices may be colored the same. The neighborhood color set of a vertexv, denoted byNC(v), is the set of colors of the neighbors ofv. The coloringcis called aset coloringprovided thatNC(u) ≠NC(v) for every pair of adjacent verticesuandvofG. The minimum number of colors needed for a set coloring ofGis referred to as the setchromatic numberofGand is denoted byχs(G).In this work, the set chromatic number of graphs is studied in relation to the graph operation called middle graph. Our results include the exact set chromatic numbers of the middle graph of cycles, paths, star graphs, double-star graphs, and some trees of height 2. Moreover, we establish the sharpness of some bounds on the set chromatic number of general graphs obtained using this operation. Finally, we develop an algorithm for constructing an optimal set coloring of the middle graph of trees of height 2 under some assumptions.