Searcharxiv⌕ Search

arXiv subjects

Aditi Saxena

Publications and source records attributed to Aditi Saxena.

5 recordsLinked to original sources

On Real Eventual Exponential Positive property of complex-valued Laplacians and their pseudoinverses

The property of real eventual exponential positivity guarantees the state trajectories of a linear time-invariant system to evolve asymptotically to right half of the complex-plane [1]. It has applications in the characterization of herdability and reachability of states in networked systems. Networks with complex-valued edge-weights arise in AC power systems and opinion dynamics. Recent work has introduced real eventual exponential positive (rEEP) Laplacians, for which the trajectories of the associated network flow eventually converge to consensus. We establish further properties of rEEP Laplacians and their pseudoinverses. Firstly, we show that the rEEP property for complex-valued matrices exhibits invariance under specific rotational transformations. Secondly, we establish that the property of rEEP is preserved under the MoorePenrose pseudoinverse operation, highlighting its robustness under algebraic manipulations. These results apply to effective impedance computation in AC networks and to consensus in multi-agent systems. Finally, we provide numerical examples to validate our theoretical results.

eess.SY↗

How Do Emotions Spread And Affect Decision-Making In Social Networks? An Opinion Dynamics Perspective

Emotions affect how we think and perceive information. Motivated by this, we present a novel framework for modeling emotions, and study its impact in social networks. We represent emotions on a circle by utilizing the circumplex model. These emotions spread in a group through the process of emotional contagion, and influence the interpersonal relationships therein. We propose a model to explain the process of emotional contagion, and its effect on the decision-making process, using a Laplacian-based flow. Our key finding in this direction shows that agents with similar emotions reach agreement eventually, exhibiting emotional contagion. Through this, the widely observed behaviors of consensus, polarization, and clustering of opinions follow in complex-weighted networks. Our approach relies on the equitable partitions and spectral properties of Laplacians in complex-weighted networks. Lastly, we validate our findings using synthetic and real-world datasets.

cs.SI↗

Laplacian Flows in Complex-valued Directed Networks: Analysis, Design, and Consensus

In the interdisciplinary field of network science, a complex-valued network, with edges assigned complex weights, provides a more nuanced representation of relationships by capturing both the magnitude and phase of interactions. Additionally, an important application of this setting arises in distribution power grids. Motivated by the richer framework, we study the necessary and sufficient conditions for achieving consensus in both strongly and weakly connected digraphs. The paper establishes that complex-valued Laplacian flows converge to consensus subject to an additional constraint termed as real dominance which relies on the phase angles of the edge weights. Our approach builds on the complex Perron-Frobenius properties to study the spectral properties of the Laplacian and its relation to graphical conditions. Finally, we propose modified flows that guarantee consensus even if the original network does not converge to consensus. Additionally, we explore diffusion in complex-valued networks as a dual process of consensus and simulate our results on synthetic and real-world networks.

eess.SY↗

Are the flows of complex-valued Laplacians and their pseudoinverses related?

Laplacian 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.

eess.SY↗

Real Eventual Exponential Positivity of Complex-valued Laplacians: Applications to Consensus in Multi-agent Systems

In this paper, we explore the property of eventual exponential positivity (EEP) in complex matrices. We show that this property holds for the real part of the matrix exponential for a certain class of complex matrices. Next, we present the relation between the spectral properties of the Laplacian matrix of an unsigned digraph with complex edge-weights and the property of real EEP. Finally, we show that the Laplacian flow system of a network is stable when the negated Laplacian admits real EEP. Numerical examples are presented to demonstrate the results.

eess.SY↗