Rinku Jacob

Dr. Rinku Jacob

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2017 in Royal Society Open Science
Verified
Journal Article
Open access
RJRinku Jacob
Rinku Jacob
KHK. P. Harikrishnan
K. P. Harikrishnan
RMR. Misra
R. Misra
GAG. Ambika
G. Ambika
We propose a novel measure of degree heterogeneity, for unweighted and undirected complex networks, which requires only the degree distribution of the network for its computation. We show that the proposed measure can be applied to all types of network topology with ease and increases with the diversity of node degrees in the network. The measure is applied to compute the heterogeneity of synthetic (both random and scale free (SF)) and real-world networks with its value normalized in the interval[0,1]. To define the measure, we introduce a limiting network whose heterogeneity can be expressed analytically with the value tending to 1 as the size of the networkNtends to infinity. We numerically study the variation of heterogeneity for random graphs (as a function ofpandN) and for SF networks withγandNas variables. Finally, as a specific application, we show that the proposed measure can be used to compare the heterogeneity of recurrence networks constructed from the time series of several low-dimensional chaotic attractors, thereby providing a single index to compare the structural complexity of chaotic attractors.

6 January 2016 in Physical Review E
Verified
Journal Article
Closed access
PDF file
RJRinku Jacob
Rinku Jacob
KHK. P. Harikrishnan
K. P. Harikrishnan
RMR. Misra
R. Misra
GAG. Ambika
G. Ambika
We propose a general method for the construction and analysis of unweighted ε-recurrence networks from chaotic time series. The selection of the critical threshold εc in our scheme is done empirically and we show that its value is closely linked to the embedding dimension M. In fact, we are able to identify a small critical range Δε numerically that is approximately the same for the random and several standard chaotic time series for a fixed M. This provides us a uniform framework for the nonsubjective comparison of the statistical measures of the recurrence networks constructed from various chaotic attractors. We explicitly show that the degree distribution of the recurrence network constructed by our scheme is characteristic to the structure of the attractor and display statistical scale invariance with respect to increase in the number of nodes N. We also present two practical applications of the scheme, detection of transition between two dynamical regimes in a time-delayed system and identification of the dimensionality of the underlying system from real-world data with a limited number of points through recurrence network measures. The merits, limitations, and the potential applications of the proposed method are also highlighted.

1 December 2016 in Communications in Nonlinear Science and Numerical Simulation
Verified
Journal Article
Closed access
RJRinku Jacob
Rinku Jacob
KHK.P. Harikrishnan
K.P. Harikrishnan
RMR. Misra
R. Misra
GAG. Ambika
G. Ambika

1 January 2018 in Communications in Nonlinear Science and Numerical Simulation
Verified
Journal Article
Closed access
RJRinku Jacob
Rinku Jacob
KHK.P. Harikrishnan
K.P. Harikrishnan
RMR. Misra
R. Misra
GAG. Ambika
G. Ambika

30 January 2019 in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Verified
Journal Article
Closed access
RJRinku Jacob
Rinku Jacob
KHK. P. Harikrishnan
K. P. Harikrishnan
RMR. Misra
R. Misra
GAG. Ambika
G. Ambika
Recurrence networks (RNs) have become very popular tools for the nonlinear analysis of time-series data. They are unweighted and undirected complex networks constructed with specific criteria from time series. In this work, we propose a method to construct a ‘weighted recurrence network’ from a time series and show that it can reveal useful information regarding the structure of a chaotic attractor which the usual unweighted RN cannot provide. Especially, a network measure, the node strength distribution, from every chaotic attractor follows a power law (with exponential cut off at the tail) with an index characteristic to the fractal structure of the attractor. This provides a new class among complex networks to which networks from all standard chaotic attractors are found to belong. Two other prominent network measures, clustering coefficient and characteristic path length, are generalized and their utility in discriminating chaotic dynamics from noise is highlighted. As an application of the proposed measure, we present an analysis of variable star light curves whose behaviour has been reported to be strange non-chaotic in a recent study. Our numerical results indicate that the weighted recurrence network and the associated measures can become potentially important tools for the analysis of short and noisy time series from the real world.

1 August 2016 in Physics Letters A
Verified
Journal Article
Closed access
RJRinku Jacob
Rinku Jacob
KHK.P. Harikrishnan
K.P. Harikrishnan
RMR. Misra
R. Misra
GAG. Ambika
G. Ambika