Finding outbreak trees in networks with limited information

DOI10.1007/s11067-015-9294-6zbMath1365.92130OpenAlexW2046673312MaRDI QIDQ2357924

Yanyan Li

Publication date: 20 June 2017

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-015-9294-6

zbMATH Keywords

integer programmingshortest pathnetwork optimizationcontagion patternssocial contact networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Epidemiology (92D30) Social networks; opinion dynamics (91D30) Integer programming (90C10)

Related Items (3)

Identifying critical components of a public transit system for outbreak control ⋮ Rumor transmission in online social networks under Nash equilibrium of a psychological decision game ⋮ Discovering the hidden community structure of public transportation networks

Uses Software

• NetworkX
• ROSE
• BEAST
• plfit
• gleamviz

Cites Work

• Unnamed Item
• Inferring contagion patterns in social contact networks with limited infection data
• The role of spatial interaction in social networks
• The modeling of global epidemics: stochastic dynamics and predictability
• Pedestrian travel behavior modeling
• Dynamic user equilibrium model for combined activity-travel choices using activity-travel supernetwork representation
• Graph-theoretical analysis of the Swiss road and railway networks over time
• A constrained Steiner tree problem
• The Steiner tree problem with hop constraints
• Mathematical biology. Vol. 1: An introduction.
• A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
• Linearly many faults in Cayley graphs generated by transposition trees
• Using raster-based GIS and graph theory to analyze complex networks
• Emergence of Scaling in Random Networks
• Power-Law Distributions in Empirical Data
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Identifying Infection Sources and Regions in Large Networks
• On the History of the Minimum Spanning Tree Problem
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Finding the K Shortest Loopless Paths in a Network
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• Steiner tree problems

This page was built for publication: Finding outbreak trees in networks with limited information