Bikramjit Das
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
Bikramjit Das has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Sidney I. Resnick
School of Operations Research and Information Engineering, Cornell University, Ithaca, USA
8 shared publications - Vicky Fasen-Hartmann
Institute of Stochastics Karlsruhe Institute of Technology Karlsruhe Germany
8 shared publications - Marie Kratz
ESSEC Business School CREAR Cergy-Pontoise France
3 shared publications - Abhimanyu Mitra
Cornell University
2 shared publications Anulekha Dhara
Deep Learning and Artificial Intelligence, TCS Research, New Delhi 201309, India
2 shared publications- Karthik Natarajan
Singapore University of Technology and Design, Singapore 487372
2 shared publications
Latest Publications
- Open Access
- 18 June 2026
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- p. 1-44
Aggregating heavy-tailed random vectors: from finite sums to lévy processes
The tail behavior of aggregates of heavy-tailed random vectors is known to be determined by the so-called principle of ‘one large jump’, be it for finite sums, random sums, or Lévy processes. We establish that, in fact, a more general principle is at play. Assuming that the random vectors are multivariate regularly varying on various subcones of the positive orthant left bracket 0 comma normal infinity right parenthesis Superscript d $[0,\infty)^d$ , first we show that their aggregates are also multivariate regularly varying on these subcones. This allows us to approximate certain tail probabilities rendered asymptotically negligible under classical regular variation. Second, we discover that depending on the structure of a particular tail event, the tail behavior of the aggregates may be characterized by more than a single large jump. Finally, we illustrate a similar phenomenon for regularly varying multivariate Lévy processes, establishing as well a relationship between regular variation of a multivariate Lévy process and multivariate regular variation of its Lévy measure on different subcones. The applicability of these results in financial and insurance risk management is discussed.- 18 June 2026
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- p. 1-44
Open AccessAggregating heavy-tailed random vectors: from finite sums to lévy processes
The tail behavior of aggregates of heavy-tailed random vectors is known to be determined by the so-called principle of ‘one large jump’, be it for finite sums, random sums, or Lévy processes. We establish that, in fact, a more general principle is at play. Assuming that the random vectors are multivariate regularly varying on various subcones of the positive orthant left bracket 0 comma normal infinity right parenthesis Superscript d $[0,\infty)^d$ , first we show that their aggregates are also multivariate regularly varying on these subcones. This allows us to approximate certain tail probabilities rendered asymptotically negligible under classical regular variation. Second, we discover that depending on the structure of a particular tail event, the tail behavior of the aggregates may be characterized by more than a single large jump. Finally, we illustrate a similar phenomenon for regularly varying multivariate Lévy processes, establishing as well a relationship between regular variation of a multivariate Lévy process and multivariate regular variation of its Lévy measure on different subcones. The applicability of these results in financial and insurance risk management is discussed. - Open Access
- 12 December 2025
- Published by Wiley in Canadian Journal of Statistics
- Vol. 54 (1)
Asymptotic independence in more than two dimensions and its implications on risk management
In extreme value theory, the presence of asymptotic independence signifies that joint extreme events across multiple variables are unlikely. Although well understood in a bivariate context, the concept remains relatively unexplored when addressing the nuances of simultaneous occurrence of extremes in higher dimensions. In this article, we propose a notion of mutual asymptotic independence to capture the behaviour of joint extremes in dimensions larger than two and contrast it with the classical notion of (pairwise) asymptotic independence . Additionally, we define ‐ wise asymptotic independence , which captures the tail dependence in between pairwise and mutual asymptotic independence. The concepts are compared using examples of Archimedean, Gaussian, and Marshall–Olkin copulas, among others. Finally, we discuss the implications of these new notions of asymptotic independence on assessing the risk in complex systems under distributional ambiguity.
- 12 December 2025
- Published by Wiley in Canadian Journal of Statistics
- Vol. 54 (1)
Open AccessAsymptotic independence in more than two dimensions and its implications on risk management
In extreme value theory, the presence of asymptotic independence signifies that joint extreme events across multiple variables are unlikely. Although well understood in a bivariate context, the concept remains relatively unexplored when addressing the nuances of simultaneous occurrence of extremes in higher dimensions. In this article, we propose a notion of mutual asymptotic independence to capture the behaviour of joint extremes in dimensions larger than two and contrast it with the classical notion of (pairwise) asymptotic independence . Additionally, we define ‐ wise asymptotic independence , which captures the tail dependence in between pairwise and mutual asymptotic independence. The concepts are compared using examples of Archimedean, Gaussian, and Marshall–Olkin copulas, among others. Finally, we discuss the implications of these new notions of asymptotic independence on assessing the risk in complex systems under distributional ambiguity.
- Open Access
Smart Timing for Mining: A Deep Learning Framework for Bitcoin Hardware ROI Prediction
Bitcoin mining hardware acquisition requires strategic timing due to volatile markets, rapid technological obsolescence, and protocol-driven revenue cycles. Despite mining's evolution into a capital-intensive industry, there is little guidance on when to purchase new Application-Specific Integrated Circuit (ASIC) hardware, and no prior computational frameworks address this decision problem. We address this gap by formulating hardware acquisition as a time series classification task, predicting whether purchasing ASIC machines yields profitable (Return on Investment (ROI) >= 1), marginal (0 < ROI < 1), or unprofitable (ROI <= 0) returns within one year. We propose MineROI-Net, an open source Transformer-based architecture designed to capture multi-scale temporal patterns in mining profitability. Evaluated on data from 20 ASIC miners released between 2015 and 2024 across diverse market regimes, MineROI-Net outperforms LSTM-based and TSLANet baselines, achieving 83.7% accuracy and 83.1% macro F1-score. The model demonstrates strong economic relevance, achieving 93.6% precision in detecting unprofitable periods and 98.5% precision for profitable ones, while avoiding misclassification of profitable scenarios as unprofitable and vice versa. These results indicate that MineROI-Net offers a practical, data-driven tool for timing mining hardware acquisitions, potentially reducing financial risk in capital-intensive mining operations. The model is available through: https://github.com/AMAAI-Lab/MineROI-Net.
Open AccessSmart Timing for Mining: A Deep Learning Framework for Bitcoin Hardware ROI Prediction
Bitcoin mining hardware acquisition requires strategic timing due to volatile markets, rapid technological obsolescence, and protocol-driven revenue cycles. Despite mining's evolution into a capital-intensive industry, there is little guidance on when to purchase new Application-Specific Integrated Circuit (ASIC) hardware, and no prior computational frameworks address this decision problem. We address this gap by formulating hardware acquisition as a time series classification task, predicting whether purchasing ASIC machines yields profitable (Return on Investment (ROI) >= 1), marginal (0 < ROI < 1), or unprofitable (ROI <= 0) returns within one year. We propose MineROI-Net, an open source Transformer-based architecture designed to capture multi-scale temporal patterns in mining profitability. Evaluated on data from 20 ASIC miners released between 2015 and 2024 across diverse market regimes, MineROI-Net outperforms LSTM-based and TSLANet baselines, achieving 83.7% accuracy and 83.1% macro F1-score. The model demonstrates strong economic relevance, achieving 93.6% precision in detecting unprofitable periods and 98.5% precision for profitable ones, while avoiding misclassification of profitable scenarios as unprofitable and vice versa. These results indicate that MineROI-Net offers a practical, data-driven tool for timing mining hardware acquisitions, potentially reducing financial risk in capital-intensive mining operations. The model is available through: https://github.com/AMAAI-Lab/MineROI-Net.
- Open Access
Rethinking Federated Learning Over the Air: The Blessing of Scaling Up
Federated learning facilitates collaborative model training across multiple clients while preserving data privacy. However, its performance is often constrained by limited communication resources, particularly in systems supporting a large number of clients. To address this challenge, integrating over-the-air computations into the training process has emerged as a promising solution to alleviate communication bottlenecks. The system significantly increases the number of clients it can support in each communication round by transmitting intermediate parameters via analog signals rather than digital ones. This improvement, however, comes at the cost of channel-induced distortions, such as fading and noise, which affect the aggregated global parameters. To elucidate these effects, this paper develops a theoretical framework to analyze the performance of over-the-air federated learning in large-scale client scenarios. Our analysis reveals three key advantages of scaling up the number of participating clients: (1) Enhanced Privacy: The mutual information between a client's local gradient and the server's aggregated gradient diminishes, effectively reducing privacy leakage. (2) Mitigation of Channel Fading: The channel hardening effect eliminates the impact of small-scale fading in the noisy global gradient. (3) Improved Convergence: Reduced thermal noise and gradient estimation errors benefit the convergence rate. These findings solidify over-the-air model training as a viable approach for federated learning in networks with a large number of clients. The theoretical insights are further substantiated through extensive experimental evaluations.
Open AccessRethinking Federated Learning Over the Air: The Blessing of Scaling Up
Federated learning facilitates collaborative model training across multiple clients while preserving data privacy. However, its performance is often constrained by limited communication resources, particularly in systems supporting a large number of clients. To address this challenge, integrating over-the-air computations into the training process has emerged as a promising solution to alleviate communication bottlenecks. The system significantly increases the number of clients it can support in each communication round by transmitting intermediate parameters via analog signals rather than digital ones. This improvement, however, comes at the cost of channel-induced distortions, such as fading and noise, which affect the aggregated global parameters. To elucidate these effects, this paper develops a theoretical framework to analyze the performance of over-the-air federated learning in large-scale client scenarios. Our analysis reveals three key advantages of scaling up the number of participating clients: (1) Enhanced Privacy: The mutual information between a client's local gradient and the server's aggregated gradient diminishes, effectively reducing privacy leakage. (2) Mitigation of Channel Fading: The channel hardening effect eliminates the impact of small-scale fading in the noisy global gradient. (3) Improved Convergence: Reduced thermal noise and gradient estimation errors benefit the convergence rate. These findings solidify over-the-air model training as a viable approach for federated learning in networks with a large number of clients. The theoretical insights are further substantiated through extensive experimental evaluations.
- Open Access
- 27 May 2025
- Published by Springer Nature in Finance and Stochastics
- Vol. 29 (3) , 707-755
Measuring risk contagion in financial networks with CoVaR
The stability of a complex financial system may be assessed by measuring risk contagion between various financial institutions with relatively high exposure. We consider a financial network model using a bipartite graph of financial institutions (e.g. banks, investment companies, insurance firms) on one side and financial assets on the other. Following empirical evidence, returns from such risky assets are modelled by heavy-tailed distributions, whereas their joint dependence is characterised by copula models exhibiting a variety of tail-dependence behaviour. We consider CoVaR, a popular measure of risk contagion, and study its asymptotic behaviour under broad model assumptions. We further propose the extreme CoVaR index (ECI) for capturing the strength of risk contagion between risk entities in such networks, which is particularly useful for models exhibiting asymptotic independence. The results are illustrated by providing precise expressions of CoVaR and ECI when the dependence of the assets is modelled using two well-known multivariate dependence structures: the Gaussian copula and the Marshall–Olkin copula.
- 27 May 2025
- Published by Springer Nature in Finance and Stochastics
- Vol. 29 (3) , 707-755
Open AccessMeasuring risk contagion in financial networks with CoVaR
The stability of a complex financial system may be assessed by measuring risk contagion between various financial institutions with relatively high exposure. We consider a financial network model using a bipartite graph of financial institutions (e.g. banks, investment companies, insurance firms) on one side and financial assets on the other. Following empirical evidence, returns from such risky assets are modelled by heavy-tailed distributions, whereas their joint dependence is characterised by copula models exhibiting a variety of tail-dependence behaviour. We consider CoVaR, a popular measure of risk contagion, and study its asymptotic behaviour under broad model assumptions. We further propose the extreme CoVaR index (ECI) for capturing the strength of risk contagion between risk entities in such networks, which is particularly useful for models exhibiting asymptotic independence. The results are illustrated by providing precise expressions of CoVaR and ECI when the dependence of the assets is modelled using two well-known multivariate dependence structures: the Gaussian copula and the Marshall–Olkin copula.
- Open Access
Inference for heavy-tailed data with Gaussian dependence
We consider a model for multivariate data with heavy-tailed marginal distributions and a Gaussian dependence structure. The different marginals in the model are allowed to have non-identical tail behavior in contrast to most popular modeling paradigms for multivariate heavy-tail analysis. Despite being a practical choice, results on parameter estimation and inference under such models remain limited. In this article, consistent estimates for both marginal tail indices and the Gaussian correlation parameters for such models are provided and asymptotic normality of these estimators are established. The efficacy of the estimation methods are exhibited using extensive simulations and then they are applied to real data sets from insurance claims, internet traffic, and, online networks.
Open AccessInference for heavy-tailed data with Gaussian dependence
We consider a model for multivariate data with heavy-tailed marginal distributions and a Gaussian dependence structure. The different marginals in the model are allowed to have non-identical tail behavior in contrast to most popular modeling paradigms for multivariate heavy-tail analysis. Despite being a practical choice, results on parameter estimation and inference under such models remain limited. In this article, consistent estimates for both marginal tail indices and the Gaussian correlation parameters for such models are provided and asymptotic normality of these estimators are established. The efficacy of the estimation methods are exhibited using extensive simulations and then they are applied to real data sets from insurance claims, internet traffic, and, online networks.
- Open Access
On heavy-tailed risks under Gaussian copula: the effects of marginal transformation
In this paper, we compute multivariate tail risk probabilities where the marginal risks are heavy-tailed and the dependence structure is a Gaussian copula. The marginal heavy-tailed risks are modeled using regular variation which leads to a few interesting consequences. First, as the threshold increases, we note that the rate of decay of probabilities of tail sets vary depending on the type of tail sets considered and the Gaussian correlation matrix. Second, we discover that although any multivariate model with a Gaussian copula admits the so called asymptotic tail independence property, the joint tail behavior under heavier tailed marginal variables is structurally distinct from that under Gaussian marginal variables. The results obtained are illustrated using examples and simulations.
Open AccessOn heavy-tailed risks under Gaussian copula: the effects of marginal transformation
In this paper, we compute multivariate tail risk probabilities where the marginal risks are heavy-tailed and the dependence structure is a Gaussian copula. The marginal heavy-tailed risks are modeled using regular variation which leads to a few interesting consequences. First, as the threshold increases, we note that the rate of decay of probabilities of tail sets vary depending on the type of tail sets considered and the Gaussian correlation matrix. Second, we discover that although any multivariate model with a Gaussian copula admits the so called asymptotic tail independence property, the joint tail behavior under heavier tailed marginal variables is structurally distinct from that under Gaussian marginal variables. The results obtained are illustrated using examples and simulations.
- 26 May 2022
- Published by Springer Nature in Extremes
- Vol. 25 (4) , 721-758
Tail probabilities of random linear functions of regularly varying random vectors
- 26 May 2022
- Published by Springer Nature in Extremes
- Vol. 25 (4) , 721-758
Tail probabilities of random linear functions of regularly varying random vectors
- 26 October 2021
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 24 (3) , 2071-2092
Asymptotic Behavior of Common Connections in Sparse Random Networks
- 26 October 2021
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 24 (3) , 2071-2092
Asymptotic Behavior of Common Connections in Sparse Random Networks
- 1 July 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 69 (4) , 1077-1099
On the Heavy-Tail Behavior of the Distributionally Robust Newsvendor
Distributionally robust optimization is increasingly becoming a popular methodology to deal with uncertainty in optimization problems. Although the methodology optimizes for the worst-case distribution, a better understanding of the prescriptions from the models important from a practical perspective. In the paper “On the heavy-tail behavior of the distributionally robust newsvendor,” B. Das, A. Dhara, and K. Natarajan provide a novel analysis for the problem in the newsvendor setting with moment information. They show that the distributionally robust newsvendor by planning for the worst possible demand distribution with moment information will remains optimal if the true demand distribution is heavy-tailed. The prescribed optimal solution has a heavy-tail optimality’ property for free.
- 1 July 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 69 (4) , 1077-1099
On the Heavy-Tail Behavior of the Distributionally Robust Newsvendor
Distributionally robust optimization is increasingly becoming a popular methodology to deal with uncertainty in optimization problems. Although the methodology optimizes for the worst-case distribution, a better understanding of the prescriptions from the models important from a practical perspective. In the paper “On the heavy-tail behavior of the distributionally robust newsvendor,” B. Das, A. Dhara, and K. Natarajan provide a novel analysis for the problem in the newsvendor setting with moment information. They show that the distributionally robust newsvendor by planning for the worst possible demand distribution with moment information will remains optimal if the true demand distribution is heavy-tailed. The prescribed optimal solution has a heavy-tail optimality’ property for free.