The ongoing rapid expansion of the Word Wide Web (WWW) greatly increases the
information of effective transmission from heterogeneous individuals to various systems …

This paper studies a distributed coordinated control problem for a class of linear multi‐agent
systems subject to two types of attacks. The problem boils down to how to achieve secure …

How much has a network changed since yesterday? How different is the wiring of Bob's
brain (a left-handed male) and Alice's brain (a right-handed female), and how is it different …

Spectral measures have long been used to quantify the robustness of real-world graphs. For
example, spectral radius (or the principal eigenvalue) is related to the effective spreading …

The closeness centrality is a well-known measure of importance of a vertex within a given
complex network. Having high closeness centrality can have positive impact on the vertex …

Minimizing the spread of infections is a challenging problem, and it is the subject matter in
many different fields such as epidemiology and cyber-security. In this paper, we investigate …

Large graphs are prevalent in many applications and enable a variety of information
dissemination processes, eg, meme, virus, and influence propagation. How can we optimize …

Given a network with groups, such as a contact-network grouped by ages, which are the
best groups to immunize to control the epidemic? Equivalently, how to choose best …

Link recommendations are critical for both improving the utility and expediting the growth of
social networks. Most previous approaches focus on suggesting links that are highly likely to …

In this paper, we analyze a large class of dynamic resource allocation (DRA) strategies,
named priority planning, that aim to suppress SIS epidemics taking place in a network. This …