Publication

Causal analysis of extreme risk in a network of industry portfolios

2026

Abstract

We provide a detailed review of causal dependence within the framework of max‐linear structural models. Such models express each node variable as a max‐linear function of its parental node variables in a directed acyclic graph (DAG) and some exogenous innovation. We reformulate results on structure learning and estimation, which we apply to a network of financial data. A new method, based on hard‐thresholding and on the Hamming distance, estimates a sparse DAG for extreme risk propagation.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2026

Abstract

Official source

Related concepts (32)

Causal model

In the philosophy of science, a causal model (or structural causal model) is a conceptual model that describes the causal mechanisms of a system. Several types of causal notation may be used in the development of a causal model. Causal models can improve study designs by providing clear rules for deciding which independent variables need to be included/controlled for. They can allow some questions to be answered from existing observational data without the need for an interventional study such as a randomized controlled trial.

Directed acyclic graph

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it consists of vertices and edges (also called arcs), with each edge directed from one vertex to another, such that following those directions will never form a closed loop. A directed graph is a DAG if and only if it can be topologically ordered, by arranging the vertices as a linear ordering that is consistent with all edge directions.

Directed graph

In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs. In formal terms, a directed graph is an ordered pair where V is a set whose elements are called vertices, nodes, or points; A is a set of ordered pairs of vertices, called arcs, directed edges (sometimes simply edges with the corresponding set named E instead of A), arrows, or directed lines.

Related publications (4)

Causal analysis of extreme risk in a network of industry portfolios

Chat with Graph Search

Subsidence of Modular Fluted Tapered Stems After Femoral Revision Surgery: Risk Factors and a Novel Classification System

Stop adjusting for anything: How the backdoor and adjustment criteria empower causal human-centric research

Avoiding biases when estimating effects of COVID-19 vaccination during immune checkpoint inhibitor therapy