(176b) Community Detection Based on Dynamic Attributes of Complex Networks
AIChE Annual Meeting
2021
2021 Annual Meeting
Computing and Systems Technology Division
Advances in Process Control II
Monday, November 8, 2021 - 3:49pm to 4:08pm
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.