(176b) Community Detection Based on Dynamic Attributes of Complex Networks | AIChE

(176b) Community Detection Based on Dynamic Attributes of Complex Networks

Authors 

Soroush, M. - Presenter, Near-Miss Management LLC
Arbogast, J. E., Process Control & Logistics, Air Liquide
Oktem, U., Near-Miss Management LLC
Seider, W., University of Pennsylvania
Real-world networks are complex and large scale, represent very interacting entities, and generate diverse types of data. Biological networks [1], power networks [2], internet networks, and chemical plants [3, 4] are examples of complex networks. Moreover, modern manufacturing plants are increasingly integrated [4], leading to structural and computational complexities. In recent years, the problem of decomposing a complex network into a set of interacting small networks that adequately capture the interactions of the original large network has received great attention, as the decomposition has applications in many engineering and science fields. Community detection has been used to decompose large networks into a set of small interacting networks [1]. Generally, it exploits this structure via optimization to find sub-networks that have the least inter-connections and the most intra-connections. Recently, several methods and algorithms have been proposed [5]; among them, modularity optimization is the most popular one [6].

In this work, we present and compare community detection methods that decompose a system into smaller subsystems based on different dynamic and steady-state attributes of the system. The dynamic attributes include response times and time delays of one variable with respect to another, and the steady-state ones include sensitivity of one variable to another at steady-state conditions. The application and performance of the methods are shown and compared by applying them to the Tennessee Eastman process. A multi-objective whale optimization algorithm is used to solve the community detection problems. The algorithm uses a nondominated sorting approach to calculate all non-dominated solutions.

REFERENCES

[1] Girvan, M. and M.E. Newman, Community structure in social and biological networks. Proceedings of the national academy of sciences, 2002. 99(12): p. 7821-7826

[2] Quirós-Tortós, J. and V. Terzija. A graph theory based new approach for power system restoration. in 2013 IEEE Grenoble Conference. 2013. IEEE

[3] Baldea, M. and P. Daoutidis, Dynamics and nonlinear control of integrated process systems. 2012: Cambridge University Press.

[4] Soroush, M., et al., Model‐predictive safety optimal actions to detect and handle process operation hazards. AIChE Journal, 2020: p. e16932.

[5] Javed, M.A., et al., Community detection in networks: A multidisciplinary review. Journal of Network and Computer Applications, 2018. 108: p. 87-111.

[6] Newman, M.E. and M. Girvan, Finding and evaluating community structure in networks. Physical review E, 2004. 69(2): p. 026113.