Saxena, AditiTripathy, TwinkleAnguluri, Rajasekhar2024-12-112024-12-112024-11-14https://doi.org/10.48550/arXiv.2411.09254http://hdl.handle.net/11603/37010Laplacian flows model the rate of change of each node's state as being proportional to the difference between its value and that of its neighbors. Typically, these flows capture diffusion or synchronization dynamics and are well-studied. Expanding on these classical flows, we introduce a pseudoinverse Laplacian flow system, substituting the Laplacian with its pseudoinverse within complex-valued networks. Interestingly, for undirected graphs and unsigned weight-balanced digraphs, Laplacian and the pseudoinverse Laplacian flows exhibit an interdependence in terms of consensus. To show this relation, we first present the conditions for achieving consensus in the pseudoinverse Laplacian flow system using the property of real eventually exponentially positivity. Thereafter, we show that the pseudoinverse Laplacian flow system converges to consensus if and only if the Laplacian flow system achieves consensus in the above-mentioned networks. However, these are only the sufficient conditions for digraphs. Further, we illustrate the efficacy of the proposed approach through examples, focusing primarily on power networks.6 pagesen-USAttribution 4.0 International CC BY 4.0https://creativecommons.org/licenses/by/4.0/Electrical Engineering and Systems Science - Systems and ControlComputer Science - Systems and ControlText