Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.14303

COVID on trees and infinite grids

Andrea Barnett·Robert Bond·Anthony Macias·Thomas W. Mattman·Bill Parnell·Ely Schoenfield
View original source ↗Read source document ↗Export metadata ↓

Abstract

We use Hartnell's model for virus spread on a graph, also known as firefighting. For rooted trees, we propose an Unburning Algorithm, a type of greedy algorithm starting from the leaves and working back towards the root. We show that the algorithm saves at least half the vertices of the optimal solution and that this is bound is sharp. We confirm a conjecture of Hartke about integrality gaps when comparing linear and integer program solutions. For general graphs, we propose a Containment Protocol, which looks ahead two time steps to decide where to place vaccinations. We show that the protocol performs near optimally on four well-studied infinite grids. The protocol is available for any graph and we realize this flexibility by investigating an infinite pentagonal graph.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrea Barnett, Robert Bond, Anthony Macias, Thomas W. Mattman, Bill Parnell, Ely Schoenfield. 2024-09-22. COVID on trees and infinite grids. https://arxiv.org/abs/2409.14303

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗