A
Abraham D. Flaxman
Researcher at Institute for Health Metrics and Evaluation
Publications - 215
Citations - 106137
Abraham D. Flaxman is an academic researcher from Institute for Health Metrics and Evaluation. The author has contributed to research in topics: Population & Verbal autopsy. The author has an hindex of 66, co-authored 195 publications receiving 88582 citations. Previous affiliations of Abraham D. Flaxman include Microsoft & University of Queensland.
Papers
More filters
Proceedings Article
The Diameter of Randomly Perturbed Digraphs and Some Applications..
Abraham D. Flaxman,Alan Frieze +1 more
TL;DR: If ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln n) with high probability, and this is applied to smoothed analysis of algorithms and property testing.
Journal ArticleDOI
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
TL;DR: In this article, it was shown that if k ≥ log 2 logn+ω(1), where ω(1) is any function going to ∞ with n, then the minimum bounded-depth spanning tree still has weight tending to ζ(3) = 1/13 + 1/23+ 1/33 + 1 /33 +… as n → ∞.
Journal ArticleDOI
Impact of data visualization on decision-making and its implications for public health practice: a systematic literature review.
TL;DR: In this article, a review summarizes the science and evidence regarding data visualization and its impact on decision-making behavior as informed by cognitive processes such as understanding, attitude, or perception.
Journal ArticleDOI
Prevalence of Age-Related Macular Degeneration in the US in 2019.
David B. Rein,John S. Wittenborn,Zeb Burke-Conte,Rohit Gulia,Toshana Robalik,Joshua R. Ehrlich,Elizabeth A. Lundeen,Abraham D. Flaxman +7 more
TL;DR: In this paper , a bayesian meta-regression analysis of relevant data sources containing information on the prevalence of age-related macular degeneration (AMD) among different population groups in the US was conducted.
Journal ArticleDOI
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
TL;DR: It is proved that if k ≥ log2 logn+ω(1), where ω(1) is any function going to ∞ with n, then the minimum bounded-depth spanning tree still has weight tending to ζ(3) as n → ∞, and that when the diameter bound is increased from 2k to 2k+1, the minimum Steiner tree weight is reduced by a factor of 2.1.