5 problems

Let $n$ be odd, and let $P_n$ be a path graph with Laplacian matrix $L_n$. For 1-port selection, perturb $L_n$ to … where $p^*=(n+1)/2$, and denote the resulting optimal perturbed…

SSCS dimension conjecture. The principles used to determine the dimension of the SSCS for HDAGs should also hold for general directed acyclic graphs.

Let $\mathbf{x}_s$ be the state variable, and let … denote the diagonal and coupled Jacobian matrices, respectively. Eigenvector approximation conjecture. If $\|\mathbf{x}_s\|$ is…

Consider a network divided into an “upper” and a “lower” region, with storage placed at nodes located at the end or middle of crucial transmission lines linking the regions. The co…

The network has renewable-generation sites whose fluctuating power flows can cause congestion, and storage may instead be placed at nodes at critical junctions between major networ…