This paper expands the work on adversarial graph analysis that was introduced recently. Examples include attacks against vertex classification [1]}, [2]} and node embedding [3]}, as well as community detection when an adversary does not want to be grouped with other individuals [4]}. In [5]}, an adversary cut edges to attack shortest path algorithms; here, an adversary adds edge weights.
