Anil Vullikanti, Alexander Rodríguez, Bijaya Adhikari, Andrés González, Charles Nicholson, B Prakash
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Can we infer all the failed components of an infrastructure network, given a sample of reachable nodes from supply nodes? One of the most critical post-disruption processes after a natural disaster is to quickly determine the damage or failure states of critical infrastructure components. However, this is nontrivial, considering that often only a fraction of components may be accessible or observable after a disruptive event. Past work has looked into inferring failed components given point probes, i.e. with a direct sample of failed components. In contrast, we study the harder problem of inferring failed components given partial information of some 'serviceable' reachable nodes and a small sample of point probes, being the first often more practical to obtain. We formulate this novel problem using the Minimum Description Length (MDL) principle, and then present a greedy algorithm that minimizes MDL cost effectively. We evaluate our algorithm on domain-expert simulations of real networks in the aftermath of an earthquake. Our algorithm successfully identifies failed components, especially the critical ones affecting the overall system performance.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2012.03413")
get_code_for_paper("2012.03413")
have("2012.03413")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2012.03413.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2012.03413)
Connect an agent — have() is free.