arXiv subjects

Twinkle Tripathy

Publications and source records attributed to Twinkle Tripathy.

24 records · Page 2Linked to original sources

arXiv2024

External Bias and Opinion Clustering in Cooperative Networks

In this work, we consider a group of n agents which interact with each other in a cooperative framework. A Laplacian-based model is proposed to govern the evolution of opinions in the group when the agents are subjected to external biases like agents' traits, news, etc. The objective of the paper is to design a control input which leads to any desired opinion clustering even in the presence of external bias factors. Further, we also determine the conditions which ensure the reachability to any arbitrary opinion states. Note that all of these results hold for any kind of graph structure. Finally, some numerical simulations are discussed to validate these results.

eess.SY↗

arXiv2024

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↗

arXiv2024

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↗

arXiv2024

Trajectory elongation strategies with minimum curvature discontinuities for a Dubins vehicle

In this paper, we present strategies for designing curvature-bounded trajectories of any desired length between any two given oriented points. The proposed trajectory is constructed by the concatenation of three circular arcs of varying radii. Such a trajectory guarantees a complete coverage of the maximum set of reachable lengths while minimising the number of changeover points in the trajectory to a maximum of two under all scenarios. Additionally, by using the notion of internally tangent circles, we expand the set of Circle-Circle-Circle trajectories to eight kinds, consisting of {LLL, LLR, LRR, LRL, RRL, RLL, RLR, RRR} paths. The paper presents a mathematical formulation of the proposed trajectory and the conditions for the existence and classification of each kind of trajectory. We also analyse the variation of the length of the trajectory using suitable elongation strategies and derive the set of reachable lengths for all pairs of oriented points. Finally, the results of this paper are illustrated using numerical simulations.

eess.SY↗

arXiv2024

Absolute centrality in a signed Friedkin-Johnsen based model: a graphical characterisation of influence

This paper studies the evolution of opinions governed by a Friedkin Johnsen (FJ) based model in arbitrary network structures with signed interactions. The agents contributing to the opinion formation are characterised as being influential. Initially, the agents are classified as opinion leaders and followers based on network connectivity and the nature of interactions. However, the addition of stubbornness leads to interesting behaviours wherein a non influential agent can now become influential and vice versa. Thereafter, a signal flow graph (SFG) based method is proposed to quantify the influence of an influential agents' opinions. Additionally, it helps illustrate the role played by network topology in shaping the final opinions of the agents. Based on this analysis, the absolute centrality measure is proposed to determine the overall influence of all the agents in the network. Unlike most of the existing measures, it is applicable to any network structure and considers the effect of stubbornness and antagonism. Examples are presented throughout the paper to illustrate and validate these results.

eess.SY↗

arXiv2024

Designing Laplacian flows for opinion clustering in structurally balanced and unbalanced networks

In this work, we consider a group of n agents whose interactions can be represented using unsigned or signed structurally balanced graphs or a special case of structurally unbalanced graphs. A Laplacian-based model is proposed to govern the evolution of opinions. The objective of the paper is to analyze the proposed opinion model on the opinion evolution of the agents. Further, we also determine the conditions required to apply the proposed Laplacian-based opinion model. Finally, some numerical results are shown to validate these results.

eess.SY↗