arXiv subjects

Priodyuti Pradhan

Publications and source records attributed to Priodyuti Pradhan.

16 recordsLinked to original sources

arXiv2025

Predicting Steady-State Behavior in Complex Networks with Graph Neural Networks

In complex systems, information propagation can be defined as diffused or delocalized, weakly localized, and strongly localized. This study investigates the application of graph neural network models to learn the behavior of a linear dynamical system on networks. A graph convolution and attention-based neural network framework has been developed to identify the steady-state behavior of the linear dynamical system. We reveal that our trained model distinguishes the different states with high accuracy. Furthermore, we have evaluated model performance with real-world data. In addition, to understand the explainability of our model, we provide an analytical derivation for the forward and backward propagation of our framework.

cs.LG↗

arXiv2025

Master Stability Functions in Complex Networks

Synchronization is an emergent and fundamental phenomenon in nature and engineered systems. Understanding the stability of a synchronized phenomenon is crucial for ensuring functionality in various complex systems. The stability of the synchronization phenomenon is extensively studied using the Master Stability Function (MSF). This powerful and elegant tool plays a pivotal role in determining the stability of synchronization states, providing deep insights into synchronization in coupled systems. Although MSF analysis has been used for 25 years to study the stability of synchronization states, a systematic investigation of MSF across various networked systems remains missing from the literature. In this article, we present a simplified and unified MSF analysis for diverse undirected and directed networked systems. We begin with the analytical MSF framework for pairwise-coupled identical systems with diffusive and natural coupling schemes and extend our analysis to directed networks and multilayer networks, considering both intra-layer and inter-layer interactions. Furthermore, we revisit the MSF framework to incorporate higher-order interactions alongside pairwise interactions. To enhance understanding, we also provide a numerical analysis of synchronization in coupled Rössler systems under pairwise diffusive coupling and propose algorithms for determining the MSF, identifying stability regimes, and classifying MSF functions. Overall, the primary goal of this review is to present a systematic study of MSF in coupled dynamical networks in a clear and structured manner, making this powerful tool more accessible. Furthermore, we highlight cases where the study of synchronization states using MSF remains underexplored. Additionally, we discuss recent research focusing on MSF analysis using time series data and machine learning approaches.

nlin.AO↗

arXiv2025

Earthquake Response Analysis with AI

A timely and effective response is crucial to minimize damage and save lives during natural disasters like earthquakes. Microblogging platforms, particularly Twitter, have emerged as valuable real-time information sources for such events. This work explores the potential of leveraging Twitter data for earthquake response analysis. We develop a machine learning (ML) framework by incorporating natural language processing (NLP) techniques to extract and analyze relevant information from tweets posted during earthquake events. The approach primarily focuses on extracting location data from tweets to identify affected areas, generating severity maps, and utilizing WebGIS to display valuable information. The insights gained from this analysis can aid emergency responders, government agencies, humanitarian organizations, and NGOs in enhancing their disaster response strategies and facilitating more efficient resource allocation during earthquake events.

cs.SI↗

arXiv2024

Multilevel Digital Contact Tracing

Digital contact tracing plays a crucial role in alleviating an outbreak, and designing multilevel digital contact tracing for a country is an open problem due to the analysis of large volumes of temporal contact data. We develop a multilevel digital contact tracing framework that constructs dynamic contact graphs from the proximity contact data. Prominently, we introduce the edge label of the contact graph as a binary circular contact queue, which holds the temporal social interactions during the incubation period. After that, our algorithm prepares the direct and indirect (multilevel) contact list for a given set of infected persons from the contact graph. Finally, the algorithm constructs the infection pathways for the trace list. We implement the framework and validate the contact tracing process with synthetic and real-world data sets. In addition, analysis reveals that for COVID-19 close contact parameters, the framework takes reasonable space and time to create the infection pathways. Our framework can apply to any epidemic spreading by changing the algorithm's parameters.

cs.DS↗

arXiv2023

Discrete-time Quantum Walk on Multilayer Networks

Multilayer network is a potent platform which paves a way to study the interactions among entities in various networks with multiple types of relationships. In this study, the dynamics of discrete-time quantum walk on a multilayer network are explored in detail. We derive recurrence formulae for the coefficients of the wave function of a quantum walker on an undirected graph with finite number of nodes. By extending these formulae to include extra layers, we develop a simulation model to describe the time-evolution of the quantum walker on a multilayer network. The time-averaged probability and the return probability of the quantum walker are studied in relation to Fourier and Grover walks on multilayer networks. Furthermore, we analyze the impact of decoherence on the quantum transport, shedding light on how environmental interactions may impact the behavior of quantum walkers on multilayer network structures.

quant-ph↗

arXiv2023

Impact of Black Swan Events on Ethereum Blockchain ERC20 Token Transaction Networks

The Ethereum blockchain and its ERC20 token standard have revolutionized the landscape of digital assets and decentralized applications. ERC20 tokens developed on the Ethereum blockchain have gained significant attention since their introduction. They are programmable and interoperable tokens, enabling various applications and token economies. Transaction graphs, representing the flow of the value between wallets within the Ethereum network, have played a crucial role in understanding the system's dynamics, such as token transfers and the behavior of traders. Here, we explore the evolution of daily transaction graphs of ERC20 token transactions, which sheds light on the trader's behavior during the Black Swan Events -- 2018 crypto crash and the COVID-19 pandemic. By using the tools from network science and differential geometry, we analyze 0.98 billion of ERC20 token transaction data from November 2015 to January 2023. Our analysis reveals that ERC20 financial ecosystem has evolved from a localized wealth formation period to a more mature financial ecosystem where wealth has dispersed among the traders in the network after the crypto crash and during the pandemic period. Before the crash, most sellers only sell the tokens, and buyers only buy the tokens. However, after the crash and during the pandemic period, sellers and buyers both performed buying and selling activities. In addition, we observe no significant negative impact of the COVID-19 pandemic on user behavior in the financial ecosystem.

nlin.AO↗

arXiv2023

Estimation of Correlation Matrices from Limited time series Data using Machine Learning

Correlation matrices contain a wide variety of spatio-temporal information about a dynamical system. Predicting correlation matrices from partial time series information of a few nodes characterizes the spatio-temporal dynamics of the entire underlying system. This information can help to predict the underlying network structure, e.g., inferring neuronal connections from spiking data, deducing causal dependencies between genes from expression data, and discovering long spatial range influences in climate variations. Traditional methods of predicting correlation matrices utilize time series data of all the nodes of the underlying networks. Here, we use a supervised machine learning technique to predict the correlation matrix of entire systems from finite time series information of a few randomly selected nodes. The accuracy of the prediction validates that only a limited time series of a subset of the entire system is enough to make good correlation matrix predictions. Furthermore, using an unsupervised learning algorithm, we furnish insights into the success of the predictions from our model. Finally, we employ the machine learning model developed here to real-world data sets.

cs.LG↗

arXiv2021

Network construction: A learning framework through localizing principal eigenvector

Information of localization properties of eigenvectors of the complex network has applicability in many different areas which include networks centrality measures, spectral partitioning, development of approximation algorithms, and disease spreading phenomenon. For linear dynamical process localization of principal eigenvector (PEV) of adjacency matrices infers condensation of the information in the smaller section of the network. For a network, an eigenvector is said to be localized when most of its components are near to zero with few taking very high values. Here, we provide three different random-sampling-based algorithms which, by using the edge rewiring method, can evolve a random network having a delocalized PEV to a network having a highly localized PEV. In other words, we develop a learning framework to explore the localization of PEV through a random sampling-based optimization method. We discuss the drawbacks and advantages of these algorithms. Additionally, we show that the construction of such networks corresponding to the highly localized PEV is a non-convex optimization problem when the objective function is the inverse participation ratio. This framework is also relevant to construct a network structure for other lower-order eigenvectors.

physics.soc-ph↗

arXiv2021

One-dimensional discrete-time quantum walks with general coin

Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the one-dimensional discrete-time QW and discuss basic steps in detail by incorporating the most general coin operator. We investigate the impact of each parameter of the general coin operator on the probability distribution of the quantum walker. We show that by tuning the parameters of the general coin, one can regulate the probability distribution of the walker. We provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study conducted on general coin operator also includes the popular coins -- Hadamard, Grover, and Fourier coins.

quant-ph↗

arXiv2020

From Spectra to Localized Networks: A Reverse Engineering Approach

Understanding the localization properties of eigenvectors of complex networks is important to get insight into various structural and dynamical properties of the corresponding systems. Here, we analytically develop a scheme to construct a highly localized network for a given set of networks parameters that is the number of nodes and the number of interactions. We find that the localization behavior of the principal eigenvector (PEV) of such a network is sensitive against a single edge rewiring. We find evidences for eigenvalue crossing phenomena as a consequence of the single edge rewiring, in turn providing an origin to the sensitive behavior of the PEV localization. These insights were then used to analytically construct the highly localized network for a given set of networks parameters. The analysis provides fundamental insight into relationships between the structural and the spectral properties of networks for PEV localized networks. Further, we substantiate the existence of the eigenvalue crossing phenomenon by considering a linear-dynamical process, namely the ribonucleic acid (RNA) neutral network population dynamical model. The analysis presented here on model networks aids in understanding the steady-state behavior of a broad range of linear-dynamical processes, from epidemic spreading to biochemical dynamics associated with the adjacency matrices.

physics.soc-ph↗

arXiv2020

Distributed Data Verification Protocols in Cloud Computing

Recently, storage of huge volume of data into Cloud has become an effective trend in modern day Computing due to its dynamic nature. After storing, users deletes their original copy of the data files. Therefore users, cannot directly control over that data. This lack of control introduces security issues in Cloud data storage, one of the most important security issue is integrity of the remotely stored data. Here, we propose a Distributed Algorithmic approach to address this problem with publicly probabilistic verifiable scheme. Due to heavy workload at the Third Party Auditor side, we distributes the verification task among various SUBTPAs. We uses Sobol Random Sequences to generates the random block numbers that maintains the uniformity property. In addition, our method provides uniformity for each subtasks also. To makes each subtask uniform, we uses some analytical approach. For this uniformity, our protocols verify the integrity of the data very efficiently and quickly. Also, we provides special care about critical data by using Overlap Task Distribution Keys.

cs.NI↗

arXiv2020

Wheel graph strategy for PEV localization of networks

Investigation of eigenvector localization properties of complex networks is not only important for gaining insight into fundamental network problems such as network centrality measure, spectral partitioning, development of approximation algorithms, but also is crucial for understanding many real-world phenomena such as disease spreading, criticality in brain network dynamics. For a network, an eigenvector is said to be localized when most of its components take value near to zero, with a few components taking very high values. In this article, we devise a methodology to construct a principal eigenvector (PEV) localized network from a given input network. The methodology relies on adding a small component having a wheel graph to the given input network. By extensive numerical simulation and an analytical formulation based on the largest eigenvalue of the input network, we compute the size of the wheel graph required to localize the PEV of the combined network. Using the susceptible-infected-susceptible model, we demonstrate the success of this method for various models and real-world networks consider as input networks. We show that on such PEV localized networks, the disease gets localized within a small region of the network structure before the outbreaks. The study is relevant in controlling spreading processes on complex systems represented by networks.

physics.soc-ph↗

arXiv2020

Principal eigenvector localization and centrality in networks: revisited

Complex networks or graphs provide a powerful framework to understand importance of individuals and their interactions in real-world complex systems. Several graph theoretical measures have been introduced to access importance of the individual in systems represented by networks. Particularly, eigenvector centrality (EC) measure has been very popular due to its ability in measuring importance of the nodes based on not only number of interactions they acquire but also particular structural positions they have in the networks. Furthermore, the presence of certain structural features, such as the existence of high degree nodes in a network is recognized to induce localization transition of the principal eigenvector (PEV) of the network's adjacency matrix. Localization of PEV has been shown to cause difficulties in assigning centrality weights to the nodes based on the EC. We revisit PEV localization and its relation with failure of EC problem, and by using simple model networks demonstrate that in addition to the localization of the PEV, the delocalization of PEV may also create difficulties for using EC as a measure to rank the nodes. Our investigation while providing fundamental insight to the relation between PEV localization and centrality of nodes in networks, suggests that for the networks having delocalized PEVs, it is better to use degree centrality measure to rank the nodes.

physics.soc-ph↗

arXiv2018

Localization of multilayer networks by the optimized single-layer rewiring

We study localization properties of principal eigenvector (PEV) of multilayer networks. Starting with a multilayer network corresponding to a delocalized PEV, we rewire the network edges using an optimization technique such that the PEV of the rewired multilayer network becomes more localized. The framework allows us to scrutinize structural and spectral properties of the networks at various localization points during the rewiring process. We show that rewiring only one-layer is enough to attain a multilayer network having a highly localized PEV. Our investigation reveals that a single edge rewiring of the optimized multilayer network can lead to the complete delocalization of a highly localized PEV. This sensitivity in the localization behavior of PEV is accompanied by a pair of almost degenerate eigenvalues. This observation opens an avenue to gain a deeper insight into the origin of PEV localization of networks. Furthermore, analysis of multilayer networks constructed using real-world social and biological data show that the localization properties of these real-world multilayer networks are in good agreement with the simulation results for the model multilayer network. The study is relevant to applications that require understanding propagation of perturbation in multilayer networks.

eess.SP↗

arXiv2017

Optimized evolution of networks for principal eigenvector localization

Network science is increasingly being developed to get new insights about behavior and properties of complex systems represented in terms of nodes and interactions. One useful approach is investigating localization properties of eigenvectors having diverse applications including disease-spreading phenomena in underlying networks. In this work, we evolve an initial random network with an edge rewiring optimization technique considering the inverse participation ratio as a fitness function. The evolution process yields a network having localized principal eigenvector. We analyze various properties of the optimized networks and those obtained at the intermediate stage. Our investigations reveal the existence of few special structural features of such optimized networks including the presence of a set of edges which are necessary for the localization, and rewiring only one of them leads to a complete delocalization of the principal eigenvector. Our investigation reveals that PEV localization is not a consequence of a single network property, and preferably requires co-existence of various distinct structural as well as spectral features.

nlin.AO↗

arXiv2017

Understanding cancer complexome using networks, spectral graph theory and multilayer framework

Cancer complexome comprises a heterogeneous and multifactorial milieu that varies in cytology, physiology, signaling mechanisms and response to therapy. The combined framework of network theory and spectral graph theory along with the multilayer anal- ysis provides a comprehensive approach to analyze the proteomic data of seven different cancers, namely, breast, oral, ovarian, cervical, lung, colon and prostate. Our analysis demonstrates that the protein-protein interaction networks of the normal and the cancerous tissues associated with the seven cancers have overall similar structural and spectral properties. However, few of these properties implicate unsystematic changes from the normal to the disease networks depicting difference in the interactions and highlighting changes in the complexity of different cancers. Importantly, analysis of common proteins of all the cancer networks reveals few proteins namely the sensors, which not only occupy significant position in all the layers but also have direct involvement in causing cancer. The prediction and analysis of miRNAs targeting these sensor proteins hint towards the possible role of these proteins in tumorigenesis. This novel approach helps in understanding cancer at the fundamental level and provides a clue to develop promising and nascent concept of single drug therapy for multiple diseases as well as personalized medicine.

q-bio.MN↗