Chandrakala Meena
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Chandrakala Meena has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Sudeshna Sinha
Indian Institute of Science Education and Research Mohali
6 shared publications Pranay Deep Rungta
Indian Institute of Science Education and Research Mohali, SAS Nagar, Sector 81, Mohali 140 306, Punjab, India
3 shared publications- Adithya L. J.
Indian Institute of Science Education and Research Pune
2 shared publications - Baruch Barzel
Department of Mathematics, Bar-Ilan University, Ramat-Gan, Israel
2 shared publications Sudeshna Sinha
2 shared publicationsAkansha Sharma
1 shared publication
Latest Publications
- 9 October 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (4)
Postselection-induced localization and coherence in quantum walks on heterogeneous networks
- 9 October 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (4)
Postselection-induced localization and coherence in quantum walks on heterogeneous networks
- Open Access
- 1 July 2026
- Published by IOP Publishing in Reports on Progress in Physics
- Vol. 89 (7) , 073901
A comprehensive review on master stability functions in complex network dynamics
Synchronization is a fundamental emergent phenomenon observed across a wide range of natural and engineered systems. Understanding the stability of a synchronization phenomenon is crucial for ensuring functionality in various complex systems. The Master Stability Function (MSF) framework has emerged as a powerful and elegant tool for analyzing the stability of synchronization in coupled dynamical systems. By separating the effects of the node dynamics from the network structure, the MSF offers deep insights into synchronization behavior. However, a major challenge lies in determining the MSF for complex dynamical networks driven by nonlinear interaction mechanisms. These mechanisms introduce additional complexity due to the intricate connectivity of the interacting elements and the complex dynamics governed by nonlinear processes, diverse parameters, and the higher dimensionality of the system. Although MSF analysis has been widely used for more than past 25 years, a comprehensive and systematic investigation of MSF across various networked systems is still lacking. In this article, we present a simplified and unified analysis for the MSF in various undirected and directed networked systems. We begin by formulating the MSF framework in pairwise coupled identical systems and extend our analysis to directed networks and multilayer networks, considering both intralayer and interlayer interactions. Furthermore, we analyze the MSF formalism for higher-order networks. To facilitate understanding, we complement the theoretical developments with numerical analysis of synchronization stability in coupled systems. We also propose algorithms for computing the MSF, identifying stability regimes, and classifying the MSF behaviors. Overall, the primary goal of this review is to present a systematic study of the MSF in various coupled dynamical networks in a clear and structured manner, making this powerful tool more accessible. Furthermore, we highlight underexplored areas in the application of the MSF and discuss emerging directions, such as estimating the MSF using machine learning approaches.
- 1 July 2026
- Published by IOP Publishing in Reports on Progress in Physics
- Vol. 89 (7) , 073901
Open AccessA comprehensive review on master stability functions in complex network dynamics
Synchronization is a fundamental emergent phenomenon observed across a wide range of natural and engineered systems. Understanding the stability of a synchronization phenomenon is crucial for ensuring functionality in various complex systems. The Master Stability Function (MSF) framework has emerged as a powerful and elegant tool for analyzing the stability of synchronization in coupled dynamical systems. By separating the effects of the node dynamics from the network structure, the MSF offers deep insights into synchronization behavior. However, a major challenge lies in determining the MSF for complex dynamical networks driven by nonlinear interaction mechanisms. These mechanisms introduce additional complexity due to the intricate connectivity of the interacting elements and the complex dynamics governed by nonlinear processes, diverse parameters, and the higher dimensionality of the system. Although MSF analysis has been widely used for more than past 25 years, a comprehensive and systematic investigation of MSF across various networked systems is still lacking. In this article, we present a simplified and unified analysis for the MSF in various undirected and directed networked systems. We begin by formulating the MSF framework in pairwise coupled identical systems and extend our analysis to directed networks and multilayer networks, considering both intralayer and interlayer interactions. Furthermore, we analyze the MSF formalism for higher-order networks. To facilitate understanding, we complement the theoretical developments with numerical analysis of synchronization stability in coupled systems. We also propose algorithms for computing the MSF, identifying stability regimes, and classifying the MSF behaviors. Overall, the primary goal of this review is to present a systematic study of the MSF in various coupled dynamical networks in a clear and structured manner, making this powerful tool more accessible. Furthermore, we highlight underexplored areas in the application of the MSF and discuss emerging directions, such as estimating the MSF using machine learning approaches.
- 30 April 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (19)
Stability of continuous time quantum walks in complex networks
Understanding how decoherence disrupts quantum walks is vital for developing robust quantum technologies, as environmental interactions often degrade quantum properties or induce transitions to classical random walks. We investigate the stability of continuous-time quantum walks across different network topologies subjected to three distinct decoherence mechanisms: energy-based intrinsic decoherence, node-based Haken–Strobl noise, and edge-based quantum stochastic walk. By defining stability as the preservation of quantum properties, we find that densely connected networks, such as the complete network, and hub dominated networks, such as scale-free and star topologies, are stable under Haken–Strobl noise but become uniquely vulnerable under quantum stochastic walk. However, these same networks exhibit lower coherence in the noiseless regime due to their inherent localization, highlighting a fundamental trade-off between localization and coherence. Furthermore, the centrality of the initialization node has a pronounced impact on relaxation time, underscoring the critical role of local topological features in quantum dynamics.
- 30 April 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (19)
Stability of continuous time quantum walks in complex networks
Understanding how decoherence disrupts quantum walks is vital for developing robust quantum technologies, as environmental interactions often degrade quantum properties or induce transitions to classical random walks. We investigate the stability of continuous-time quantum walks across different network topologies subjected to three distinct decoherence mechanisms: energy-based intrinsic decoherence, node-based Haken–Strobl noise, and edge-based quantum stochastic walk. By defining stability as the preservation of quantum properties, we find that densely connected networks, such as the complete network, and hub dominated networks, such as scale-free and star topologies, are stable under Haken–Strobl noise but become uniquely vulnerable under quantum stochastic walk. However, these same networks exhibit lower coherence in the noiseless regime due to their inherent localization, highlighting a fundamental trade-off between localization and coherence. Furthermore, the centrality of the initialization node has a pronounced impact on relaxation time, underscoring the critical role of local topological features in quantum dynamics.
- 1 April 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (4)
Machine learning approach to detect dynamical states from recurrence measures
We integrate machine learning approaches with nonlinear time series analysis, specifically utilizing recurrence measures to classify various dynamical states emerging from time series. We implement three machine learning algorithms: Logistic Regression, Random Forest, and Support Vector Machine for this study. The input features are derived from the recurrence quantification of nonlinear time series and characteristic measures of the corresponding recurrence networks. For training and testing, we generate synthetic data from standard nonlinear dynamical systems and evaluate the efficiency and performance of the machine learning algorithms in classifying time series into periodic, chaotic, hyperchaotic, or noisy categories. Additionally, we explore the significance of input features in the classification scheme and find that the features quantifying the density of recurrence points are the most relevant. Furthermore, we illustrate how the trained algorithms can successfully predict the dynamical states of two variable stars, SX Her and AC Her, from the data of their light curves. We also indicate how the algorithms can be trained to classify data from discrete systems.
- 1 April 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (4)
Machine learning approach to detect dynamical states from recurrence measures
We integrate machine learning approaches with nonlinear time series analysis, specifically utilizing recurrence measures to classify various dynamical states emerging from time series. We implement three machine learning algorithms: Logistic Regression, Random Forest, and Support Vector Machine for this study. The input features are derived from the recurrence quantification of nonlinear time series and characteristic measures of the corresponding recurrence networks. For training and testing, we generate synthetic data from standard nonlinear dynamical systems and evaluate the efficiency and performance of the machine learning algorithms in classifying time series into periodic, chaotic, hyperchaotic, or noisy categories. Additionally, we explore the significance of input features in the classification scheme and find that the features quantifying the density of recurrence points are the most relevant. Furthermore, we illustrate how the trained algorithms can successfully predict the dynamical states of two variable stars, SX Her and AC Her, from the data of their light curves. We also indicate how the algorithms can be trained to classify data from discrete systems.
- Open Access
Emergent stability in complex network dynamics
The stable functionality of networked systems is a hallmark of their natural ability to coordinate between their multiple interacting components. Yet, strikingly, real-world networks seem random and highly irregular, apparently lacking any design for stability. What then are the naturally emerging organizing principles of complex-system stability? Encoded within the system's stability matrix, the Jacobian, the answer is obscured by the scale and diversity of the relevant systems, their broad parameter space, and their nonlinear interaction mechanisms. To make advances, here we uncover emergent patterns in the structure of the Jacobian, rooted in the interplay between the network topology and the system's intrinsic nonlinear dynamics. These patterns help us analytically identify the few relevant control parameters that determine a system's dynamic stability. Complex systems, we find, exhibit discrete stability classes, from asymptotically unstable, where stability is unattainable, to sensitive, in which stability abides within a bounded range of the system's parameters. Most crucially, alongside these two classes, we uncover a third class, asymptotically stable, in which a sufficiently large and heterogeneous network acquires a guaranteed stability, independent of parameters, and therefore insensitive to external perturbation. Hence, two of the most ubiquitous characteristics of real-world networks - scale and heterogeneity - emerge as natural organizing principles to ensure stability in the face of changing environmental conditions.
Open AccessEmergent stability in complex network dynamics
The stable functionality of networked systems is a hallmark of their natural ability to coordinate between their multiple interacting components. Yet, strikingly, real-world networks seem random and highly irregular, apparently lacking any design for stability. What then are the naturally emerging organizing principles of complex-system stability? Encoded within the system's stability matrix, the Jacobian, the answer is obscured by the scale and diversity of the relevant systems, their broad parameter space, and their nonlinear interaction mechanisms. To make advances, here we uncover emergent patterns in the structure of the Jacobian, rooted in the interplay between the network topology and the system's intrinsic nonlinear dynamics. These patterns help us analytically identify the few relevant control parameters that determine a system's dynamic stability. Complex systems, we find, exhibit discrete stability classes, from asymptotically unstable, where stability is unattainable, to sensitive, in which stability abides within a bounded range of the system's parameters. Most crucially, alongside these two classes, we uncover a third class, asymptotically stable, in which a sufficiently large and heterogeneous network acquires a guaranteed stability, independent of parameters, and therefore insensitive to external perturbation. Hence, two of the most ubiquitous characteristics of real-world networks - scale and heterogeneity - emerge as natural organizing principles to ensure stability in the face of changing environmental conditions.
- Top Cited Papers
- 20 April 2023
- Published by Springer Nature in Nature Physics
- Vol. 19 (7) , 1033-1042
Emergent stability in complex network dynamics
- 20 April 2023
- Published by Springer Nature in Nature Physics
- Vol. 19 (7) , 1033-1042
Top Cited PapersEmergent stability in complex network dynamics
- 29 October 2021
- Published by Royal Society of Chemistry (RSC) in Nanoscale
- Vol. 13 (46) , 19549-19560
The implication of adsorption preferences of ions and surfactants on the shape control of gold nanoparticles: a microscopic, atomistic perspective
Shape modulation of nanoparticles is crucial for their tailored applications; however, it depends on surfactants, ions, reactants, and other additives present in the growth solution. Here we dissect the role of surfactants, their counterions (halide ions), silver ions, and gold reactant in gold nanoparticle anisotropic growth using polarizable surfaces and nanoseed molecular dynamics simulation models. Our planar surface models predict a 14%–16% increment in cetyltrimethylammonium bromide (CTAB) coverage on Au(111) and Au(100) due to the surface polarization effect. The CTAB micelle adsorbs compactly similar to that observed on non-polarizable surfaces. The cetyltrimethylammonium chloride (CTAC) micelle remains in solution leaving the polarizable gold surfaces unprotected, similar to that observed with the non-polarizable surfaces, which favors isotropic growth. The cetyltrimethylammonium iodide (CTAI) micelle adsorbs with higher surface densities than CTAB on all the surfaces. The surface polarizable penta-twinned nanoseed model predicts the total surface coverage of the cetyltrimethylammonium cation (CTA+), Br− and Ag+ to be around two times higher on the side as compared to the tip of the nanoseed, leading to a 2.6 times higher initial rate of adsorption of AuCl2 − on the tip than on the side. Predicted CTA+ surface densities on the tip and the side of the nanoseed are consistent with experimental results. Our simulations explain the growth mechanism of anisotropic nanoparticles and the microscopic origin of their controlled shapes.
- 29 October 2021
- Published by Royal Society of Chemistry (RSC) in Nanoscale
- Vol. 13 (46) , 19549-19560
The implication of adsorption preferences of ions and surfactants on the shape control of gold nanoparticles: a microscopic, atomistic perspective
Shape modulation of nanoparticles is crucial for their tailored applications; however, it depends on surfactants, ions, reactants, and other additives present in the growth solution. Here we dissect the role of surfactants, their counterions (halide ions), silver ions, and gold reactant in gold nanoparticle anisotropic growth using polarizable surfaces and nanoseed molecular dynamics simulation models. Our planar surface models predict a 14%–16% increment in cetyltrimethylammonium bromide (CTAB) coverage on Au(111) and Au(100) due to the surface polarization effect. The CTAB micelle adsorbs compactly similar to that observed on non-polarizable surfaces. The cetyltrimethylammonium chloride (CTAC) micelle remains in solution leaving the polarizable gold surfaces unprotected, similar to that observed with the non-polarizable surfaces, which favors isotropic growth. The cetyltrimethylammonium iodide (CTAI) micelle adsorbs with higher surface densities than CTAB on all the surfaces. The surface polarizable penta-twinned nanoseed model predicts the total surface coverage of the cetyltrimethylammonium cation (CTA+), Br− and Ag+ to be around two times higher on the side as compared to the tip of the nanoseed, leading to a 2.6 times higher initial rate of adsorption of AuCl2 − on the tip than on the side. Predicted CTA+ surface densities on the tip and the side of the nanoseed are consistent with experimental results. Our simulations explain the growth mechanism of anisotropic nanoparticles and the microscopic origin of their controlled shapes.
- 17 August 2018
- Published by American Physical Society (APS) in Physical Review E
- Vol. 98 (2) , 022314
Identifying nodal properties that are crucial for the dynamical robustness of multistable networks
We investigate the collective dynamics of bistable elements connected in different network topologies and estimate the network response to localized perturbations on different classes of nodes by introducing a variant of the concept of multinode basin stability. We show that perturbations on nodes with high closeness and betweeness centrality drastically reduces the capacity of the system to return to the original state. This effect is most pronounced for a star network, where perturbation of the single hub node can destroy the collective state, while the system manages to recover even when a majority of the peripheral nodes are strongly perturbed. This demonstrates the extreme effect of the centrality of the perturbed node on the stability of the network. Further, we exploit the difference in centrality distributions in random scale-free networks with and to probe which property most influences the collective dynamics in heterogeneous networks. Significantly, we find clear evidence that the betweeness centrality of the perturbed node is more crucial for dynamical robustness than closeness centrality or degree of the node. This allows us to decide which nodes to safeguard in order to maintain the collective state of a network against targeted localized attacks.- 17 August 2018
- Published by American Physical Society (APS) in Physical Review E
- Vol. 98 (2) , 022314
Identifying nodal properties that are crucial for the dynamical robustness of multistable networks
We investigate the collective dynamics of bistable elements connected in different network topologies and estimate the network response to localized perturbations on different classes of nodes by introducing a variant of the concept of multinode basin stability. We show that perturbations on nodes with high closeness and betweeness centrality drastically reduces the capacity of the system to return to the original state. This effect is most pronounced for a star network, where perturbation of the single hub node can destroy the collective state, while the system manages to recover even when a majority of the peripheral nodes are strongly perturbed. This demonstrates the extreme effect of the centrality of the perturbed node on the stability of the network. Further, we exploit the difference in centrality distributions in random scale-free networks with and to probe which property most influences the collective dynamics in heterogeneous networks. Significantly, we find clear evidence that the betweeness centrality of the perturbed node is more crucial for dynamical robustness than closeness centrality or degree of the node. This allows us to decide which nodes to safeguard in order to maintain the collective state of a network against targeted localized attacks.- 18 December 2017
- Published by Indian Academy of Sciences
- Vol. 1 (1) , 171-186
Coexistence of attractors in a coupled nonlinear delayed system modelling El Niño Southern Oscillations
- 18 December 2017
- Published by Indian Academy of Sciences
- Vol. 1 (1) , 171-186
Coexistence of attractors in a coupled nonlinear delayed system modelling El Niño Southern Oscillations
- 1 November 2017
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 104, 668-679
Effect of heterogeneity in a model of El Niño Southern Oscillations
- 1 November 2017
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 104, 668-679
Effect of heterogeneity in a model of El Niño Southern Oscillations