Bhaskar Dasgupta

Prof. Bhaskar Dasgupta


Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

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

Representative Publications

View All Publications
1 July 2007 in BioSystems
Verified
Journal Article
Closed access
BDBhaskar Dasgupta
Bhaskar Dasgupta
GEGerman Andres Enciso
German Andres Enciso
ESEduardo Sontag
Eduardo Sontag
YZYi Zhang
Yi Zhang

24 March 2014 in Physical Review E
Verified
Journal Article
Closed access
RARéka Albert
Réka Albert
BDBhaskar Dasgupta
Bhaskar Dasgupta
NMNasim Mobasheri
Nasim Mobasheri
Network measures that reflect the most salient properties of complex large-scale networks are in high demand in the network research community. In this paper we adapt a combinatorial measure of negative curvature (also called hyperbolicity) to parametrized finite networks, and show that a variety of biological and social networks are hyperbolic. This hyperbolicity property has strong implications on the higher-order connectivity and other topological properties of these networks. Specifically, we derive and prove bounds on the distance among shortest or approximately shortest paths in hyperbolic networks. We describe two implications of these bounds to crosstalk in biological networks, and to the existence of central, influential neighborhoods in both biological and social networks.

22 November 2007 in Bioinformatics
Verified
Journal Article
Open access
PDF file
SKSema Kachalo
Sema Kachalo
RZRanran Zhang
Ranran Zhang
ESEduardo Sontag
Eduardo Sontag
RARéka Albert
Réka Albert
BDBhaskar Dasgupta
Bhaskar Dasgupta
Summary: We present a software for combined synthesis, inference and simplification of signal transduction networks. The main idea of our method lies in representing observed indirect causal relationships as network paths and using techniques from combinatorial optimization to find the sparsest graph consistent with all experimental observations. We illustrate the biological usability of our software by applying it to a previously published signal transduction network and by using it to synthesize and simplify a novel network corresponding to activation-induced cell death in large granular lymphocyte leukemia. Availability: NET-SYNTHESIS is freely downloadable from http://www.cs.uic.edu/~dasgupta/network-synthesis/ Contact:dasgupta@cs.uic.edu Supplementary information: Supplementary data are available at Bioinformatics online.

29 September 2011 in Physical Review E
Verified
Journal Article
Closed access
PDF file
RARéka Albert
Réka Albert
BDBhaskar Dasgupta
Bhaskar Dasgupta
RHRashmi Hegde
Rashmi Hegde
GSGowri Sangeetha Sivanathan
Gowri Sangeetha Sivanathan
AGAnthony Gitter
Anthony Gitter
ESEduardo Sontag
Eduardo Sontag
It is well known that biological and social interaction networks have a varying degree of redundancy, though a consensus of the precise cause of this is so far lacking. In this paper, we introduce a topological redundancy measure for labeled directed networks that is formal, computationally efficient, and applicable to a variety of directed networks such as cellular signaling, and metabolic and social interaction networks. We demonstrate the computational efficiency of our measure by computing its value and statistical significance on a number of biological and social networks with up to several thousands of nodes and edges. Our results suggest a number of interesting observations: (1) Social networks are more redundant that their biological counterparts, (2) transcriptional networks are less redundant than signaling networks, (3) the topological redundancy of the C. elegans metabolic network is largely due to its inclusion of currency metabolites, and (4) the redundancy of signaling networks is highly (negatively) correlated with the monotonicity of their dynamics.

14 April 2021 in Scientific Reports
Verified
Journal Article
Open access
PDF file
TCTanima Chatterjee
Tanima Chatterjee
RARéka Albert
Réka Albert
STStuti Thapliyal
Stuti Thapliyal
NANazanin Azarhooshang
Nazanin Azarhooshang
BDBhaskar Dasgupta
Bhaskar Dasgupta
We analyze networks of functional correlations between brain regions to identify changes in their structure caused by Attention Deficit Hyperactivity Disorder (adhd). We express the task for finding changes as a network anomaly detection problem on temporal networks. We propose the use of a curvature measure based on the Forman–Ricci curvature, which expresses higher-order correlations among two connected nodes. Our theoretical result on comparing this Forman–Ricci curvature with another well-known notion of network curvature, namely the Ollivier–Ricci curvature, lends further justification to the assertions that these two notions of network curvatures are not well correlated and therefore one of these curvature measures cannot be used as an universal substitute for the other measure. Our experimental results indicate nine critical edges whose curvature differs dramatically in brains of adhd patients compared to healthy brains. The importance of these edges is supported by existing neuroscience evidence. We demonstrate that comparative analysis of curvature identifies changes that more traditional approaches, for example analysis of edge weights, would not be able to identify.

24 March 2006 in Nonlinear Analysis
Verified
Journal Article
Closed access
BDBhaskar Dasgupta
Bhaskar Dasgupta
JHJoao Hespanha
Joao Hespanha
JRJames Riehl
James Riehl
ESEduardo Sontag
Eduardo Sontag