Shaunak Sen

SY
4papers
4citations
Novelty52%
AI Score43

4 Papers

23.4SYApr 13
Block Diagram Analysis of a Design Principle for Amplitude-Frequency Profiles in Biological Oscillations

Sidhanta Mohanty, Shaunak Sen

An important design principle for biological oscillators divides the oscillators into two classes: fixed frequency, variable amplitude and fixed amplitude, variable frequency. Because of the interplay of nonlinearity and feedback, both positive and negative, analytical investigations of this design principle are primarily based on numerical simulations of ordinary differential equations. To enhance the qualitative and quantitative characterization, we adapted and developed a block diagram modeling framework. We showed how the observed amplitude-frequency characteristics could be obtained from the block diagram models. We obtained constraints on the positive feedback and negative feedback strengths for the oscillations to exist. These results should contribute to a systems and control perspective on oscillations in biology and related contexts.

MNJun 2, 2018
Non-normality Can Facilitate Pulsing in Biomolecular Circuits

Abhilash Patel, Shaunak Sen

Non-normality can underlie pulse dynamics in many engineering contexts. However, its role in pulses generated in biomolecular contexts is generally unclear. Here, we address this issue using the mathematical tools of linear algebra and systems theory on simple computational models of biomolecular circuits. We find that non-normality is present in standard models of feedforward loops. We used a generalized framework and pseudospectrum analysis to identify non-normality in larger biomolecular circuit models, finding that it correlates well with pulsing dynamics. Finally, we illustrate how these methods can be used to provide analytical support to numerical screens for pulsing dynamics as well as provide guidelines for design.

84.0SYMar 24
A Necessary and Sufficient Condition for Local Synchronization in Nonlinear Oscillator Networks

Sanjeev Kumar Pandey, Shaunak Sen, Indra Narayan Kar

Determining conditions on the coupling strength for the synchronization in networks of interconnected oscillators is a challenging problem in nonlinear dynamics. While sophisticated mathematical methods have been used to derive conditions, these conditions are usually only sufficient and/ or based on numerical methods. We addressed the gap between the sufficient coupling strength and numerically observations using the Lyapunov-Floquet Theory and the Master Stability Function framework. We showed that a positive coupling strength is a necessary and sufficient condition for local synchronization in a network of identical oscillators coupled linearly and in full state fashion. For partial state coupling, we showed that a positive coupling constant results in an asymptotic contraction of the trajectories in the state space, which results in synchronisation for two-dimensional oscillators. We extended the results to networks with non-identical coupling over directed graphs and showed that positive coupling constants is a sufficient condition for synchronisation. These theoretical results are validated using numerical simulations and experimental implementations. Our results contribute to bridging the gap between the theoretically derived sufficient coupling strengths and the numerically observed ones.

15.1DSMar 20
Computational Complexity Analysis of Interval Methods in Solving Uncertain Nonlinear Systems

Rudra Prakash, S. Janardhanan, Shaunak Sen

This paper analyses the computational complexity of validated interval methods for uncertain nonlinear systems. Interval analysis produces guaranteed enclosures that account for uncertainty and round-off, but its adoption is often limited by computational cost in high dimensions. We develop an algorithm-level worst-case framework that makes the dependence on the initial search volume $\mathrm{Vol}(X_0)$, the target tolerance $\varepsilon$, and the costs of validated primitives explicit (inclusion-function evaluation, Jacobian evaluation, and interval linear algebra). Within this framework, we derive worst-case time and space bounds for interval bisection, subdivision$+$filter, interval constraint propagation, interval Newton, and interval Krawczyk. The bounds quantify the scaling with $\mathrm{Vol}(X_0)$ and $\varepsilon$ for validated steady-state enclosure and highlight dominant cost drivers. We also show that determinant and inverse computation for interval matrices via naive Laplace expansion is factorial in the matrix dimension, motivating specialised interval linear algebra. Finally, interval Newton and interval Krawczyk have comparable leading-order costs; Krawczyk is typically cheaper in practice because it inverts a real midpoint matrix rather than an interval matrix. These results support the practical design of solvers for validated steady-state analysis in applications such as biochemical reaction network modelling, robust parameter estimation, and other uncertainty-aware computations in systems and synthetic biology.