Dynamic large financial networks via conditional expected shortfalls

نویسندگان

چکیده

In this article, we first generalize the Conditional Auto-Regressive Expected Shortfall (CARES) model by introducing loss exceedances of all (other) listed companies in related to each firm, thus proposing CARES-X (where ‘X’, as usual, stands for eXtended case large-dimensional problems). Second, construct a regularized network US financial Least Absolute Shrinkage and Selection Operator estimation step. Third, also propose calibration approach uncovering relevant edges between nodes, finding that estimated structure dynamically evolves through different market risk regimes. We ultimately show knowledge extreme links provides useful information, since intensity these has strong implications on portfolio risk. Indeed, it allows us design effective management mitigation allocation strategies.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expected Duration of Dynamic Markov PERT Networks

Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in ac...

متن کامل

Conditional independence in dynamic networks

Given a longitudinal network observed at time points t1 < · · · < tT , tie changes that happen in the interval (th, th+1) typically depend on the networks at t1, . . . , th. In this article we deal with the question whether changes within one interval mutually depend on each other or whether they are conditionally independent, given the previously observed networks. Answering this question for ...

متن کامل

Expected Duration of Dynamic Markov Pert Networks

In this paper, we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in accordance wit...

متن کامل

Visualization of Large Dynamic Networks

There is a growing number of graph-structured datasets, e.g., social networks, communication networks and biological networks, available for scientific research. Most of them show a dynamic behavior with continuous addition/deletion/modification of nodes and edges. In this directed study project, we aim to build a general framework for showing how to visualize large dynamic networks using Gephi...

متن کامل

Discriminative Learning of Bayesian Networks via Factorized Conditional Log-Likelihood

We propose an efficient and parameter-free scoring criterion, the factorized conditional log-likelihood (f̂CLL), for learning Bayesian network classifiers. The proposed score is an approximation of the conditional log-likelihood criterion. The approximation is devised in order to guarantee decomposability over the network structure, as well as efficient estimation of the optimal parameters, achi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2022

ISSN: ['1872-6860', '0377-2217']

DOI: https://doi.org/10.1016/j.ejor.2021.06.037