Henning S. Mortveit

Henning S. Mortveit

Auto-generated profile, based on publicly available information

Henning S. Mortveit

University of Virginia

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2000 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
CBC.L. Barrett
C.L. Barrett
HMH.S. Mortveit
H.S. Mortveit
CRC.M. Reidys
C.M. Reidys

1 January 2008
Verified
Book
Closed access
HMHenning S Mortveit
Henning S Mortveit
CRChristian M Reidys
Christian M Reidys

1 August 2001 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
CBC.L. Barrett
C.L. Barrett
HMH.S. Mortveit
H.S. Mortveit
CRC.M. Reidys
C.M. Reidys

1 January 2001 in Discrete Mathematics
Verified
Journal Article
Closed access
HMH.S. Mortveit
H.S. Mortveit
CRC.M. Reidys
C.M. Reidys

16 September 2019 in PLOS Computational Biology
Verified
Journal Article
Open access
PDF file
SVSrinivasan Venkatramanan
Srinivasan Venkatramanan
JCJiangzhuo Chen
Jiangzhuo Chen
AFArindam Fadikar
Arindam Fadikar
SGSandeep Gupta
Sandeep Gupta
DHDave Higdon
Dave Higdon
AVAnil Vullikanti
Anil Vullikanti
Prophylactic interventions such as vaccine allocation are some of the most effective public health policy planning tools. The supply of vaccines, however, is limited and an important challenge is to optimally allocate the vaccines to minimize epidemic impact. This resource allocation question (which we refer to as VaccIntDesign) has multiple dimensions: when, where, to whom, etc. Most of the existing literature in this topic deals with the latter (to whom), proposing policies that prioritize individuals by age and disease risk. However, since seasonal influenza spread has a typical spatial trend, and due to the temporal constraints enforced by the availability schedule, the when and where problems become equally, if not more, relevant. In this paper, we study the VaccIntDesign problem in the context of seasonal influenza spread in the United States. We develop a national scale metapopulation model for influenza that integrates both short and long distance human mobility, along with realistic data on vaccine uptake. We also design GreedyAlloc, a greedy algorithm for allocating the vaccine supply at the state level under temporal constraints and show that such a strategy improves over the current baseline of pro-rata allocation, and the improvement is more pronounced for higher vaccine efficacy and moderate flu season intensity. Further, the resulting strategy resembles a ring vaccination applied spatiallyacross the US. Annual vaccination campaigns continue to be one of the prime measures which help alleviate the burden of seasonal influenza. Due to production and logistic constraints, there is a need for prioritization policies associated with vaccine deployment. While there is general consensus on age-based or risk-based prioritization, spatial optimization of vaccine allocation has not yet been explored in sufficient detail. In order to do this, we develop a mechanistic model of influenza spread across the United States, and propose a greedy mechanism for spatial optimization. We test the methodology on different realistic scenarios with temporal constraints on vaccine production.

20 January 2009 in Nonlinearity
Verified
Journal Article
Closed access
MMMatthew Macauley
Matthew Macauley
HMHenning S Mortveit
Henning S Mortveit
Graph dynamical systems (GDSs) can be used to describe a wide range of dis- tributed, nonlinear phenomena. In this paper we characterize cycle equivalence of a class of finite GDSs called sequential dynamical systems (SDSs). In general, two finite GDSs are cycle equivalent if their periodic orbits are isomorphic as directed graphs. Sequential dynamical systems may be thought of as generalized cellular automata, and use an update order to construct the dynamical system map. The main result of this paper is a charac- terization of cycle equivalence in terms of shifts and reflections of the SDS update order. We construct two graphs C(Y ) and D(Y ) whose components describe update orders that give rise to cycle equivalent SDSs. The number of components in C(Y ) and D(Y ) is an upper bound for the number of cycle equivalence classes one can obtain, and we enumerate these quantities through a recursion relation for several graph classes. The components of these graphs encode dynamical neutrality, the component sizes represent periodic orbit structural stability, and the number of components can be viewed as a system complexity measure.