arXiv subjects

Soumya Jyoti Banerjee

Publications and source records attributed to Soumya Jyoti Banerjee.

3 recordsLinked to original sources

arXiv2015

Using complex networks towards information retrieval and diagnostics in multidimensional imaging

We present a fresh and broad yet simple approach towards information retrieval in general and diagnostics in particular by applying the theory of complex networks on multidimensional, dynamic images. We demonstrate a successful use of our method with the time series generated from high content thermal imaging videos of patients suffering from the aqueous deficient dry eye (ADDE) disease. Remarkably, network analyses of thermal imaging time series of contact lens users and patients upon whom Laser-Assisted in situ Keratomileusis (Lasik) surgery has been conducted, exhibit pronounced similarity with results obtained from ADDE patients. We also propose a general framework for the transformation of multidimensional images to networks for futuristic biometry. Our approach is general and scalable to other fluctuation-based devices where network parameters derived from fluctuations, act as effective discriminators and diagnostic markers.

cs.IR↗

arXiv2015

Slow poisoning and destruction of networks: Edge proximity and its implications for biological and infrastructure networks

We propose a network metric, edge proximity, ${\cal P}_e$, which demonstrates the importance of specific edges in a network, hitherto not captured by existing network metrics. The effects of removing edges with high ${\cal P}_e$ might initially seem inconspicuous but are eventually shown to be very harmful for networks. Compared to existing strategies, the removal of edges by ${\cal P}_e$ leads to a remarkable increase in the diameter and average shortest path length in undirected real and random networks till the first disconnection and well beyond. ${\cal P}_e$ can be consistently used to rupture the network into two nearly equal parts, thus presenting a very potent strategy to greatly harm a network. Targeting by ${\cal P}_e$ causes notable efficiency loss in U.S. and European power grid networks. ${\cal P}_e$ identifies proteins with essential cellular functions in protein-protein interaction networks. It pinpoints regulatory neural connections and important portions of the neural and brain networks, respectively. Energy flow interactions identified by ${\cal P}_e$ form the backbone of long food web chains. Finally, we scrutinize the potential of ${\cal P}_e$ in edge controllability dynamics of directed networks.

physics.soc-ph↗

arXiv2012

Key to Network Controllability

Liu et al recently proposed a minimum number of driver nodes needed to obtain full structural controllability over a directed network. Driver nodes are unmatched nodes, from which there are directed paths to all matched nodes. Their most important assertion is that a system's controllability is to a great extent encoded by the underlying network's degree distribution, $P(k_{in}, k_{out})$. Is the controllability of a network decided almost completely by the immediate neighbourhood of a node, while, even slightly distant nodes play no role at all? Motivated by the above question, in this communication, we argue that an effective understanding of controllability in directed networks can be reached using distance based measures of closeness centrality and betweenness centrality and may not require the knowledge of local connectivity measures like in-degree and out-degree.

physics.soc-ph↗