The general method of graph coarsening or graph reduction has been a remarkably useful
and ubiquitous tool in scientific computing and it is now just starting to have a similar impact …

Determining a set of “important” nodes in a network constitutes a basic endeavor in network
science. Inspired by electrical flows in a resistor network, we propose the best conducting …

Abstract How might one``reduce''a graph? That is, generate a smaller graph that preserves
the global structure at the expense of discarding local details? There has been extensive …

Abstract The Moore–Penrose inverse celebrated its 100th birthday in 2020, as the notion
standing behind the term was first defined by Eliakim Hastings Moore in 1920 (Bull Am Math …

Brokerage is crucial for dark networks. In analyzing communications among criminals, which
naturally induce bipartite networks, previous studies have focused on the classic Freeman's …

We propose new insights into the network centrality based not only on the network graph,
but also on a more structured model of network uncertainties. The focus of this paper is on …

Smart grid is a typical cyber-physical system. In order to effectively evaluate the robustness
of the system after cascading failures, combined with complex network theory, a cyber …

Kemeny's constant and its relation to the effective graph resistance has been established for
regular graphs by Palacios et al.[1]. Based on the Moore–Penrose pseudo-inverse of the …

Modern systems are increasingly dependent upon and interacting with each other, and
become interdependent networks. These interdependent networks may exhibit some …

We investigate robustness of interconnected dynamical networks with respect to external
distributed stochastic disturbances. In this paper, we consider networks with linear time …