scispace - formally typeset
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
Journal ArticleDOI

First-passage percolation on a ladder graph, and the path cost in a VCG auction

TL;DR: The time constant for first‐passage percolation, and the Vickrey‐Clarke‐Groves (VCG) payment, for the shortest path on a ladder graph with random edge costs are studied in a unified way based on recursive distributional equations.
Book ChapterDOI

Bias reduction in traceroute sampling - towards a more accurate map of the internet

TL;DR: In this paper, a new estimator for the degree of a node in a traceroute-sampled graph was developed, and applied to produce a new picture of the degree distribution of the autonomous system graph.
Journal ArticleDOI

On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas

TL;DR: It is shown that for all densities above a density that is slightly above the satisfiability threshold, the diameter is almost surely zero (a very dense satisfiable formula is expected to have only one satisfying assignment).
Journal ArticleDOI

A Statistical Model and Estimation of Disease Rates as Functions of Age and Time

TL;DR: This work proposes a multivariate Gauss--Markov random field model for the healthy population, infected population, and the disease rates, which enables the combination of measurement values that are zero with measurements that are lognormal for large values.
Book ChapterDOI

Embracing the giant component

TL;DR: In this article, a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large as possible.