Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Robustness of Information Diffusion Algorithms to Locally Bounded
  Adversaries   We consider the problem of diffusing information in networks that contain
malicious nodes. We assume that each normal node in the network has no
knowledge of the network topology other than an upper bound on the number of
malicious nodes in its neighborhood. We introduce a topological property known
as r-robustness of a graph, and show that this property provides improved
bounds on tolerating malicious behavior, in comparison to traditional concepts
such as connectivity and minimum degree. We use this topological property to
analyze the canonical problems of distributed consensus and broadcasting, and
provide sufficient conditions for these operations to succeed. Finally, we
provide a construction for r-robust graphs and show that the common
preferential-attachment model for scale-free networks produces a robust graph.

27
The categories of this paper are: comp-gas
11
The categories of this paper are: hep-lat
14
The categories of this paper are: math-ph
5
The categories of this paper are: gr-qc
23
The categories of this paper are: solv-int
26
The categories of this paper are: bayes-an
22
The categories of this paper are: chao-dyn
17
The categories of this paper are: q-fin
34
The categories of this paper are: chem-ph
4
The categories of this paper are: cond-mat
7
The categories of this paper are: hep-th
16
The categories of this paper are: stat
33
The categories of this paper are: plasm-ph
15
The categories of this paper are: nucl-ex
8
The categories of this paper are: hep-ex
20
The categories of this paper are: acc-phys