activity
20182021
most citedData-Driven Control of the COVID-19 Outbreak via Non-Pharmaceutical Interventions: A Geometric Programming Approach

15 citations · 20 across the 5 of their papers we have counts for

collaborators

6 papers

eess.SY2021

AutoEKF: Scalable System Identification for COVID-19 Forecasting from Large-Scale GPS Data

Francisco Barreras, Mikhail Hayhoe, Hamed Hassani +1

We present an Extended Kalman Filter framework for system identification and control of a stochastic high-dimensional epidemic model. The scale and severity of the COVID-19 emergen…

math.OC2020★ 15 cited

Data-Driven Control of the COVID-19 Outbreak via Non-Pharmaceutical Interventions: A Geometric Programming Approach

Mikhail Hayhoe, Francisco Barreras, Victor M. Preciado

In this paper we propose a data-driven model for the spread of SARS-CoV-2 and use it to design optimal control strategies of human-mobility restrictions that both curb the epidemic…

math.OC2020

A Dynamical Approach to Efficient Eigenvalue Estimation in General Multiagent Networks

Mikhail Hayhoe, Francisco Barreras, Victor M. Preciado

We propose a method to efficiently estimate the eigenvalues of any arbitrary (potentially weighted and/or directed) network of interacting dynamical agents from dynamical observati…

math.SP2019

Sparse estimation of Laplacian eigenvalues in multiagent networks

Mikhail Hayhoe, Francisco Barreras, Victor M. Preciado

We propose a method to efficiently estimate the Laplacian eigenvalues of an arbitrary, unknown network of interacting dynamical agents. The inputs to our estimation algorithm are m…

math.CO2019★ 1 cited

New bounds on the spectral radius of graphs based on the moment problem

Francisco Barreras, Mikhail Hayhoe, Hamed Hassani +1

Let be an undirected graph with adjacency matrix and spectral radius . Let and be, respectively, the number walks of length , closed…

cs.SI2018★ 4 cited

SPECTRE: Seedless Network Alignment via Spectral Centralities

Mikhail Hayhoe, Francisco Barreras, Hamed Hassani +1

Network alignment consists of finding a structure-preserving correspondence between the nodes of two correlated, but not necessarily identical, networks. This problem finds applica…