Vineeth Satheeskumar Varma

Anthony Couthures, Athira Varma Jayakumar, Vineeth Satheeskumar Varma et al.

Conventional community detection requires centralized network data, making it unsuitable for distributed or privacy-preserving systems. In this paper, we demonstrate that macroscopic graph partitioning can emerge purely from strictly local, privacy preserving interactions driven by social learning. By reframing clustering as a symmetry-breaking process within nonlinear opinion dynamics, we show that exchanging saturated state dependent signal (like public actions) forces a network to naturally fracture along its sparsest cuts. We mathematically establish the spectral conditions under which dense core communities lock into stable, polarized states, robustly resisting external influence. To apply this mechanism, we propose three decentralized algorithms, leading up to the Score-based Edge Reliability (SER) framework. By evaluating network ties across multiple independent discussion topics, SER statistically bypasses the errors of traditional greedy bisections and naturally isolates structurally ambiguous frontier nodes. Validations on the ABCD benchmark and the real-world Ngogo chimpanzee network confirm that our fully decentralized approach matches the accuracy of globally optimized heuristics (e.g., Louvain, Leiden) up to a theoretical limit of detectable graphs.

Gal Barkai, J Ér Émie Kreiss, Vineeth S Varma et al.

Managing autonomous vehicle platoons requires a delicate balance between string stability and rigorous safety. This challenge is intensified by aggressive transients, such as highway merging. Although Constant Time Headway (CTH) spacing is the industry standard for Cooperative Adaptive Cruise Control, it lacks formal safety guarantees during significant velocity deviations. This letter proposes a computationally efficient control framework that considers a linear time-invariant model for the dynamics of each vehicle, while ensuring formal transient safety and stability. By introducing a spacing policy that naturally converges to CTH at steady state, we establish platoon safety as an inductive property. We derive a non-linear and saturated control law for the lead follower and provide sufficient initial conditions to guarantee velocity non-negativity and safety throughout the platoon for any CTH-based followers' control law. Numerical examples indicate the proposed methodology may be applicable even under non-nominal setups.

Hassan Munif, Vineeth Satheeskumar Varma, Samson Lasaulce

We analyze Stackelberg Gaussian signaling games where the encoder and decoder have a linear sensitivity mismatch. Unlike the standard additive-bias model, a sensitivity mismatch means the encoder prefers the decoder to track a linear transformation of the state rather than a shifted one. We derive the equilibrium structure for both noiseless (cheap-talk) and noisy signaling channels. In the noiseless case, the equilibrium admits a spectral characterization: the encoder transmits information only along eigenspaces associated with the negative eigenvalues of a mismatch matrix. In the noisy regime, we derive analytical thresholds for informative signaling, showing that communication collapses if the sensitivity mismatch or transmission cost exceeds a channel-dependent threshold.