scispace - formally typeset
Search or ask a question
Author

Abraham D. Flaxman

Bio: 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
TL;DR: Performance of all birth history analysis methods is extremely poor when used on very small samples of women, both in terms of magnitude of expected error and bias in the estimates.
Abstract: Estimates of under-5 mortality at the national level for countries without high-quality vital registration systems are routinely derived from birth history data in censuses and surveys. Subnational or stratified analyses of under-5 mortality could also be valuable, but the usefulness of under-5 mortality estimates derived from birth histories from relatively small samples of women is not known. We aim to assess the magnitude and direction of error that can be expected for estimates derived from birth histories with small samples of women using various analysis methods. We perform a data-based simulation study using Demographic and Health Surveys. Surveys are treated as populations with known under-5 mortality, and samples of women are drawn from each population to mimic surveys with small sample sizes. A variety of methods for analyzing complete birth histories and one method for analyzing summary birth histories are used on these samples, and the results are compared to corresponding true under-5 mortality. We quantify the expected magnitude and direction of error by calculating the mean error, mean relative error, mean absolute error, and mean absolute relative error. All methods are prone to high levels of error at the smallest sample size with no method performing better than 73% error on average when the sample contains 10 women. There is a high degree of variation in performance between the methods at each sample size, with methods that contain considerable pooling of information generally performing better overall. Additional stratified analyses suggest that performance varies for most methods according to the true level of mortality and the time prior to survey. This is particularly true of the summary birth history method as well as complete birth history methods that contain considerable pooling of information across time. Performance of all birth history analysis methods is extremely poor when used on very small samples of women, both in terms of magnitude of expected error and bias in the estimates. Even with larger samples there is no clear best method to choose for analyzing birth history data. The methods that perform best overall are the same methods where performance is noticeably different at different levels of mortality and lengths of time prior to survey. At the same time, methods that perform more uniformly across levels of mortality and lengths of time prior to survey also tend to be among the worst performing overall.

8 citations

Journal ArticleDOI
TL;DR: This work model the dynamics of an ad-hoc sensor network as a continuum percolation model, and proves that a simple local-flooding technique yields an efficient communication protocol in that setting.

7 citations

01 Jan 2004
TL;DR: In this article, it was shown that if en random arcs are added to any n-node strongly connected digraph with bounded degree, the resulting graph has diameter O(lnn) with high probability.
Abstract: The central observation of this paper is that if en random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL-complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ Dn,e/n we obtain a “smoothed” instance. We show that, with high probability, a log-space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL n almost-L then no heuristic can recognize similarly perturbed instances of (s,t)-connectivity. Property Testing: A digraph is called k-linked if, for every choice of 2k distinct vertices s1,…,sk,t1,…,tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1,…,k. Recognizing k-linked digraphs is NP-complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k-linked graphs with high probability, and rejects all graphs that are at least en arcs away from being k-linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007

7 citations

Journal ArticleDOI
TL;DR: This paper analyzes the performance of three related approximation algorithms for the uncapacitated facility location problem and finds that, with high probability, these 3 algorithms do not find asymptotically optimal solutions, and a simple plane partitioning heuristic does find an asymptonically optimal solution.
Abstract: In combinatorial optimization, a popular approach toNP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guaranteed to produce a solution which is within a known multiplicative factor of optimal. Unfortunately, the known factor is often known to be large in pathological instances. Conventional wisdom holds that, in practice, approximation algorithms will produce solutions closer to optimal than their proven guarantees. In this paper, we use the rigorous-analysis-of-heuristics framework to investigate this conventional wisdom.We analyze the performance of 3 related approximation algorithms for the uncapacitated facility location problem (from [Jain, Mahdian, Markakis, Saberi, Vazirani, 2003] and [Mahdian, Ye, Zhang, 2002]) when each is applied to an instances created by placing n points uniformly at random in the unit square. We find that, with high probability, these 3 algorithms do not find asymptotically optimal solutions, and, also with high probability, a simple plane partitioning heuristic does find an asymptotically optimal solution.

7 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: Authors/Task Force Members: Piotr Ponikowski* (Chairperson) (Poland), Adriaan A. Voors* (Co-Chair person) (The Netherlands), Stefan D. Anker (Germany), Héctor Bueno (Spain), John G. F. Cleland (UK), Andrew J. S. Coats (UK)

13,400 citations

Journal ArticleDOI
Rafael Lozano1, Mohsen Naghavi1, Kyle J Foreman2, Stephen S Lim1  +192 moreInstitutions (95)
TL;DR: The Global Burden of Diseases, Injuries, and Risk Factors Study 2010 aimed to estimate annual deaths for the world and 21 regions between 1980 and 2010 for 235 causes, with uncertainty intervals (UIs), separately by age and sex, using the Cause of Death Ensemble model.

11,809 citations

Journal ArticleDOI
TL;DR: The Global Burden of Diseases, Injuries, and Risk Factors Study 2016 (GBD 2016) provides a comprehensive assessment of prevalence, incidence, and years lived with disability (YLDs) for 328 causes in 195 countries and territories from 1990 to 2016.

10,401 citations

01 Jan 2014
TL;DR: These standards of care are intended to provide clinicians, patients, researchers, payors, and other interested individuals with the components of diabetes care, treatment goals, and tools to evaluate the quality of care.
Abstract: XI. STRATEGIES FOR IMPROVING DIABETES CARE D iabetes is a chronic illness that requires continuing medical care and patient self-management education to prevent acute complications and to reduce the risk of long-term complications. Diabetes care is complex and requires that many issues, beyond glycemic control, be addressed. A large body of evidence exists that supports a range of interventions to improve diabetes outcomes. These standards of care are intended to provide clinicians, patients, researchers, payors, and other interested individuals with the components of diabetes care, treatment goals, and tools to evaluate the quality of care. While individual preferences, comorbidities, and other patient factors may require modification of goals, targets that are desirable for most patients with diabetes are provided. These standards are not intended to preclude more extensive evaluation and management of the patient by other specialists as needed. For more detailed information, refer to Bode (Ed.): Medical Management of Type 1 Diabetes (1), Burant (Ed): Medical Management of Type 2 Diabetes (2), and Klingensmith (Ed): Intensive Diabetes Management (3). The recommendations included are diagnostic and therapeutic actions that are known or believed to favorably affect health outcomes of patients with diabetes. A grading system (Table 1), developed by the American Diabetes Association (ADA) and modeled after existing methods, was utilized to clarify and codify the evidence that forms the basis for the recommendations. The level of evidence that supports each recommendation is listed after each recommendation using the letters A, B, C, or E.

9,618 citations

Journal ArticleDOI
Stephen S Lim1, Theo Vos, Abraham D. Flaxman1, Goodarz Danaei2  +207 moreInstitutions (92)
TL;DR: In this paper, the authors estimated deaths and disability-adjusted life years (DALYs; sum of years lived with disability [YLD] and years of life lost [YLL]) attributable to the independent effects of 67 risk factors and clusters of risk factors for 21 regions in 1990 and 2010.

9,324 citations