Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 260

The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.

Optimal Resource Allocation for Network Protection Against Spreading Processes

Open access
Preciado, Victor M., Zargham, Michael, Enyioha, Chinwendu, Jadbabaie, Ali, Pappas, George J. · 2014 · IEEE Transactions on Control of Network Systems

Abstract

We study the problem of containing spreading processes in arbitrary directed networks by distributing protection resources throughout the nodes of the network. We consider that two types of protection resources are available: 1) preventive resources able to defend nodes against the spreading (such as vaccines in a viral infection process) and 2) corrective resources able to neutralize the spreading after it has reached a node (such as antidotes). We assume that both preventive and corrective resources have an associated cost and study the problem of finding the cost-optimal distribution of resources throughout the nodes of the network. We analyze these questions in the context of viral spreading processes in directed networks. We study the following two problems: 1) given a fixed budget, find the optimal allocation of preventive and corrective resources in the network to achieve the highest level of containment and 2) when a budget is not specified, find the minimum budget required to control the spreading process. We show that both the resource allocation problems can be solved in polynomial time using geometric programming (GP) for arbitrary directed graphs of nonidentical nodes and a wide class of cost functions. We illustrate our approach by designing optimal protection strategies to contain an epidemic outbreak that propagates through an air transportation network.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tcns.2014.2310911

Cites

23 of 23 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 23 references

Metadata

Authors
Preciado, V. M., Zargham, M., Enyioha, C., Jadbabaie, A., & Pappas, G. J.
Venue
IEEE Transactions on Control of Network Systems
Published
2014-03
Volume
1
Issue
1
Pages
99-108
ISSN
2325-5870 (ISSN-L)
OpenAlex
W2110852762
Cited by
260
References
23
FWCI
14.72
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Optimal Resource Allocation for Network Protection Against Spreading Processes. https://app.cochat.ai/papers/10.1109/tcns.2014.2310911
The paper
Preciado, V. M., Zargham, M., Enyioha, C., Jadbabaie, A., & Pappas, G. J. (2014). Optimal Resource Allocation for Network Protection Against Spreading Processes. IEEE Transactions on Control of Network Systems. https://doi.org/10.1109/tcns.2014.2310911

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.