Bhaskar DasGupta
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
Research Subjects
Bhaskar DasGupta has a total of 94 co-authors. Here are the top co-authors by number of shared publications:
- Eduardo D. Sontag
Northeastern University
10 shared publications - Réka Albert
Department of Physics, Pennsylvania State University, University Park, USA
9 shared publications - Piotr Berman
Pennsylvania State University
7 shared publications - Marek Karpinski
Univ Bonn, Dept Comp Sci, Bonn, Germany
6 shared publications - Nasim Mobasheri
Univ Illinois, Dept Comp Sci, Chicago, IL 60607 USA
6 shared publications - Lakshmi Kaligounder
University of Illinois at Chicago
4 shared publications
Latest Publications
- Open Access
On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
In recent years extensions of manifold Ricci curvature to discrete combinatorial objects such as graphs and hypergraphs (popularly called as "network shapes"), have found a plethora of applications in a wide spectrum of research areas ranging over metabolic systems, transcriptional regulatory networks, protein-protein-interaction networks, social networks and brain networks to deep learning models and quantum computing but, in contrast, they have been looked at by relatively fewer researchers in the algorithms and computational complexity community. As an attempt to bring these network Ricci-curvature related problems under the lens of computational complexity and foster further inter-disciplinary interactions, we provide a formal framework for studying algorithmic and computational complexity issues for detecting critical edges in an undirected graph using Ollivier-Ricci curvatures and provide several algorithmic and inapproximability results for problems in this framework. Our results show some interesting connections between the exact perfect matching and perfect matching blocker problems for bipartite graphs and our problems.
Open AccessOn Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
In recent years extensions of manifold Ricci curvature to discrete combinatorial objects such as graphs and hypergraphs (popularly called as "network shapes"), have found a plethora of applications in a wide spectrum of research areas ranging over metabolic systems, transcriptional regulatory networks, protein-protein-interaction networks, social networks and brain networks to deep learning models and quantum computing but, in contrast, they have been looked at by relatively fewer researchers in the algorithms and computational complexity community. As an attempt to bring these network Ricci-curvature related problems under the lens of computational complexity and foster further inter-disciplinary interactions, we provide a formal framework for studying algorithmic and computational complexity issues for detecting critical edges in an undirected graph using Ollivier-Ricci curvatures and provide several algorithmic and inapproximability results for problems in this framework. Our results show some interesting connections between the exact perfect matching and perfect matching blocker problems for bipartite graphs and our problems.
- 23 April 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (4) , 044316
Finding influential cores via normalized Ricci flows in directed and undirected hypergraphs with applications
Many biological and social systems are naturally represented as edge-weighted directed or undirected hypergraphs since they exhibit group interactions involving three or more system units as opposed to pairwise interactions that can be incorporated in graph-theoretic representations. However, finding influential cores in hypergraphs is still not as extensively studied as their graph-theoretic counterparts. To this end, we develop and implement a hypergraph-curvature guided discrete time diffusion process with suitable topological surgeries and edge-weight renormalization procedures for both undirected and directed weighted hypergraphs to find influential cores. We successfully apply our framework for directed hypergraphs to seven metabolic hypergraphs and our framework for undirected hypergraphs to two social (coauthorship) hypergraphs to find influential cores, thereby demonstrating the practical feasibility of our approach. In addition, we prove a theorem showing that a certain edge weight renormalization procedure in a prior research work for Ricci flows for edge-weighted graphs has the undesirable outcome of modifying the edge weights to negative numbers, thereby rendering the procedure impossible to use. This paper formulates algorithmic approaches for finding core(s) of (weighted or unweighted) directed hypergraphs.
- 23 April 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (4) , 044316
Finding influential cores via normalized Ricci flows in directed and undirected hypergraphs with applications
Many biological and social systems are naturally represented as edge-weighted directed or undirected hypergraphs since they exhibit group interactions involving three or more system units as opposed to pairwise interactions that can be incorporated in graph-theoretic representations. However, finding influential cores in hypergraphs is still not as extensively studied as their graph-theoretic counterparts. To this end, we develop and implement a hypergraph-curvature guided discrete time diffusion process with suitable topological surgeries and edge-weight renormalization procedures for both undirected and directed weighted hypergraphs to find influential cores. We successfully apply our framework for directed hypergraphs to seven metabolic hypergraphs and our framework for undirected hypergraphs to two social (coauthorship) hypergraphs to find influential cores, thereby demonstrating the practical feasibility of our approach. In addition, we prove a theorem showing that a certain edge weight renormalization procedure in a prior research work for Ricci flows for edge-weighted graphs has the undesirable outcome of modifying the edge weights to negative numbers, thereby rendering the procedure impossible to use. This paper formulates algorithmic approaches for finding core(s) of (weighted or unweighted) directed hypergraphs.
- Open Access
Finding Influential Cores via Normalized Ricci Flows in Directed and Undirected Hypergraphs with Applications
Many biological and social systems are naturally represented as edge-weighted directed or undirected hypergraphs since they exhibit group interactions involving three or more system units as opposed to pairwise interactions that can be incorporated in graph-theoretic representations. However, finding influential cores in hypergraphs is still not as extensively studied as their graph-theoretic counter-parts. To this end, we develop and implement a hypergraph-curvature guided discrete time diffusion process with suitable topological surgeries and edge-weight re-normalization procedures for both undirected and directed weighted hypergraphs to find influential cores. We successfully apply our framework for directed hypergraphs to seven metabolic hypergraphs and our framework for undirected hypergraphs to two social (co-authorship) hypergraphs to find influential cores, thereby demonstrating the practical feasibility of our approach. In addition, we prove a theorem showing that a certain edge weight re-normalization procedure in a prior research work for Ricci flows for edge-weighted graphs has the undesirable outcome of modifying the edge-weights to negative numbers, thereby rendering the procedure impossible to use. To the best of our knowledge, this seems to be one of the first articles that formulates algorithmic approaches for finding core(s) of (weighted or unweighted) directed hypergraphs.
Open AccessFinding Influential Cores via Normalized Ricci Flows in Directed and Undirected Hypergraphs with Applications
Many biological and social systems are naturally represented as edge-weighted directed or undirected hypergraphs since they exhibit group interactions involving three or more system units as opposed to pairwise interactions that can be incorporated in graph-theoretic representations. However, finding influential cores in hypergraphs is still not as extensively studied as their graph-theoretic counter-parts. To this end, we develop and implement a hypergraph-curvature guided discrete time diffusion process with suitable topological surgeries and edge-weight re-normalization procedures for both undirected and directed weighted hypergraphs to find influential cores. We successfully apply our framework for directed hypergraphs to seven metabolic hypergraphs and our framework for undirected hypergraphs to two social (co-authorship) hypergraphs to find influential cores, thereby demonstrating the practical feasibility of our approach. In addition, we prove a theorem showing that a certain edge weight re-normalization procedure in a prior research work for Ricci flows for edge-weighted graphs has the undesirable outcome of modifying the edge-weights to negative numbers, thereby rendering the procedure impossible to use. To the best of our knowledge, this seems to be one of the first articles that formulates algorithmic approaches for finding core(s) of (weighted or unweighted) directed hypergraphs.
- 1 November 2024
- Published by The Journal of Rheumatology in The Journal of Rheumatology
Symptom Severity and Glucocorticoid Dosing in Patients With Polymyalgia Rheumatica and Obesity
Objective: Polymyalgia rheumatica (PMR) is an inflammatory disorder of the elderly characterized by girdle pain and stiffness. Obesity has an influence on disease activity and outcome in rheumatic diseases like osteoarthritis and rheumatoid arthritis. We aimed to investigate the relationship between high BMI and the severity and outcome of PMR, which is incompletely understood.Methods: In a post hoc analysis, 83 patients with recent-onset PMR were studied over 6 months using clinical examination, laboratory evaluation, and girdle ultrasound (US). The modified Health Assessment Questionnaire (mHAQ), 36-item Short Form Health Survey (SF-36), and PMR visual analog scale (VAS) scores, as well as prednisone therapy data, were recorded. Patients were grouped according to their BMI.Results: At baseline, the 12 patients with obesity had significantly more shoulder pain (P= 0.03), global pain (P= 0.03), PMR VAS (P< 0.01), and fatigue (P= 0.03); higher mHAQ (P= 0.01); and lower SF-36 physical component summary (P= 0.048) and SF-36 pain index (P< 0.001). The mean initial prednisone dose was similar among groups, but patients with obesity received a lower dose/kg (1.9 [SD 0.7] mg vs 2.2 [SD 0.7] mg;P< 0.01). At 6 months, patients with obesity were being treated with higher mean daily prednisone doses (8.5 [SD 3.2] mg/d vs 6.2 [SD 5.2] mg/d;P= 0.02), and 40% of them were receiving higher daily prednisone doses than the standard protocol compared with 14% patients without obesity (P= 0.048). Clinical features, laboratory results, and US results were similar between patients with and without obesity.Conclusion: Obesity affects both symptom severity and prednisone utilization in patients with PMR. The reason for this may relate to different subjective pain perception rather than increased inflammation in patients with obesity. BMI should be considered when interpreting symptoms in patients with PMR and deciding their prednisone doses.
- 1 November 2024
- Published by The Journal of Rheumatology in The Journal of Rheumatology
Symptom Severity and Glucocorticoid Dosing in Patients With Polymyalgia Rheumatica and Obesity
Objective: Polymyalgia rheumatica (PMR) is an inflammatory disorder of the elderly characterized by girdle pain and stiffness. Obesity has an influence on disease activity and outcome in rheumatic diseases like osteoarthritis and rheumatoid arthritis. We aimed to investigate the relationship between high BMI and the severity and outcome of PMR, which is incompletely understood.Methods: In a post hoc analysis, 83 patients with recent-onset PMR were studied over 6 months using clinical examination, laboratory evaluation, and girdle ultrasound (US). The modified Health Assessment Questionnaire (mHAQ), 36-item Short Form Health Survey (SF-36), and PMR visual analog scale (VAS) scores, as well as prednisone therapy data, were recorded. Patients were grouped according to their BMI.Results: At baseline, the 12 patients with obesity had significantly more shoulder pain (P= 0.03), global pain (P= 0.03), PMR VAS (P< 0.01), and fatigue (P= 0.03); higher mHAQ (P= 0.01); and lower SF-36 physical component summary (P= 0.048) and SF-36 pain index (P< 0.001). The mean initial prednisone dose was similar among groups, but patients with obesity received a lower dose/kg (1.9 [SD 0.7] mg vs 2.2 [SD 0.7] mg;P< 0.01). At 6 months, patients with obesity were being treated with higher mean daily prednisone doses (8.5 [SD 3.2] mg/d vs 6.2 [SD 5.2] mg/d;P= 0.02), and 40% of them were receiving higher daily prednisone doses than the standard protocol compared with 14% patients without obesity (P= 0.048). Clinical features, laboratory results, and US results were similar between patients with and without obesity.Conclusion: Obesity affects both symptom severity and prednisone utilization in patients with PMR. The reason for this may relate to different subjective pain perception rather than increased inflammation in patients with obesity. BMI should be considered when interpreting symptoms in patients with PMR and deciding their prednisone doses.
- 7 December 2022
- Published by Springer Nature in Algorithmica
- Vol. 85 (5) , 1287-1331
Maximizing Coverage While Ensuring Fairness: A Tale of Conflicting Objectives
- 7 December 2022
- Published by Springer Nature in Algorithmica
- Vol. 85 (5) , 1287-1331
Maximizing Coverage While Ensuring Fairness: A Tale of Conflicting Objectives
- Open Access
- 14 April 2021
- Published by Springer Nature in Scientific Reports
- Vol. 11 (1) , 1-14
Detecting network anomalies using Forman–Ricci curvature and a case study for human brain networks
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.
- 14 April 2021
- Published by Springer Nature in Scientific Reports
- Vol. 11 (1) , 1-14
Open AccessDetecting network anomalies using Forman–Ricci curvature and a case study for human brain networks
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.
- Open Access
- 9 September 2020
- Published by IntechOpen
A Review of Several Privacy Violation Measures for Large Networks under Active Attacks
It is by now a standard practice to use the concepts and terminologies of network science to analyze social networks of interconnections between people such as Facebook, Twitter and LinkedIn. The powers and implications of such social network analysis are indeed indisputable; for example, such analysis may uncover previously unknown knowledge on community-based involvements, media usages and individual engagements. However, all these benefits are not necessarily cost-free since a malicious individual could compromise privacy of users of these social networks for harmful purposes that may result in the disclosure of sensitive data that may be linked to its users. A natural way to avoid this consists of an “anonymization process” of the relevant social network. However, since such anonymization processes may not always succeed, an important research goal is to quantify and measure how much privacy a given social network can achieve. Toward this goal, some recent research works have aimed at evaluating the resistance of a social network against active privacy-violating attacks by introducing and studying a new and meaningful privacy measure for social networks. In this chapter, we review both theoretical and empirical aspects of such privacy violation measures of large networks under active attacks.
- 9 September 2020
- Published by IntechOpen
Open AccessA Review of Several Privacy Violation Measures for Large Networks under Active Attacks
It is by now a standard practice to use the concepts and terminologies of network science to analyze social networks of interconnections between people such as Facebook, Twitter and LinkedIn. The powers and implications of such social network analysis are indeed indisputable; for example, such analysis may uncover previously unknown knowledge on community-based involvements, media usages and individual engagements. However, all these benefits are not necessarily cost-free since a malicious individual could compromise privacy of users of these social networks for harmful purposes that may result in the disclosure of sensitive data that may be linked to its users. A natural way to avoid this consists of an “anonymization process” of the relevant social network. However, since such anonymization processes may not always succeed, an important research goal is to quantify and measure how much privacy a given social network can achieve. Toward this goal, some recent research works have aimed at evaluating the resistance of a social network against active privacy-violating attacks by introducing and studying a new and meaningful privacy measure for social networks. In this chapter, we review both theoretical and empirical aspects of such privacy violation measures of large networks under active attacks.
- Open Access
- 24 August 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (9) , 1416
A Review of and Some Results for Ollivier–Ricci Network Curvature
Characterizing topological properties and anomalous behaviors of higher-dimensional topological spaces via notions of curvatures is by now quite common in mainstream physics and mathematics, and it is therefore natural to try to extend these notions from the non-network domains in a suitable way to the network science domain. In this article we discuss one such extension, namely Ollivier’s discretization of Ricci curvature. We first motivate, define and illustrate the Ollivier–Ricci Curvature. In the next section we provide some “not-previously-published” bounds on the exact and approximate computation of the curvature measure. In the penultimate section we review a method based on the linear sketching technique for efficient approximate computation of the Ollivier–Ricci network curvature. Finally in the last section we provide concluding remarks with pointers for further reading.
- 24 August 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (9) , 1416
Open AccessA Review of and Some Results for Ollivier–Ricci Network Curvature
Characterizing topological properties and anomalous behaviors of higher-dimensional topological spaces via notions of curvatures is by now quite common in mainstream physics and mathematics, and it is therefore natural to try to extend these notions from the non-network domains in a suitable way to the network science domain. In this article we discuss one such extension, namely Ollivier’s discretization of Ricci curvature. We first motivate, define and illustrate the Ollivier–Ricci Curvature. In the next section we provide some “not-previously-published” bounds on the exact and approximate computation of the curvature measure. In the penultimate section we review a method based on the linear sketching technique for efficient approximate computation of the Ollivier–Ricci network curvature. Finally in the last section we provide concluding remarks with pointers for further reading.