Searcharxiv⌕ Search

arXiv · 2611.18225

Causal and conditional tail coefficients: asymptotics, inference and graph recovery

Abstract

The causal tail coefficient (CTC) measures the influence of an extreme value of one variable on another variable and has been proposed as a tool for causal discovery in heavy-tailed models. Despite its popularity, the asymptotic behavior of its empirical counterpart has not been well understood. We develop an asymptotic theory for the rank-based CTC estimator with an intermediate threshold under nonparametric conditions that are satisfied by all standard copula models. A key observation is that the CTC is determined by the mean of a conditional tail limit distribution, which clarifies its interpretation and determines the asymptotic variance of the estimator. We establish joint asymptotic normality for the entire CTC matrix and prove consistency of a multiplier bootstrap for simultaneous inference. For heavy-tailed linear and recursive max-linear structural equation models, we show that the CTC equals one if and only if the first variable is an ancestor of the second, which leads to confidence graphs for the ancestral graph with asymptotic coverage guarantees. All results extend to general conditional tail coefficients, defined as further functionals of the conditional tail limit distribution. A simulation study and an application to dietary intake data illustrate the methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Axel Bücher, Mario Krali. 2026-11-13. Causal and conditional tail coefficients: asymptotics, inference and graph recovery. https://searcharxiv.com/abs/2611.18225

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

On Minimal Observation Time for Recovering Latent Hawkes Networks

Dynamics of interacting systems in engineering, society, and nature often evolve over latent networks that govern which entities can interact. We study the problem of inferring these networks from event-based observations, which arise naturally in finance, seismology, and neuroscience. While there is substantial algorithmic work addressing this important problem, theoretical results are scarce. In this paper we ask the following fundamental question: what is the minimum time that one must observe the dynamics in order to exactly recover the underlying network, as a function of the number $d$ of interacting entities? For a class of stationary Hawkes processes with sparse, weak interactions, we prove that an observation time of order $\log d$ is sufficient and necessary. For the upper bound we construct a two-stage estimator that uses clipped and binned event data for screening, followed by a least-squares refinement, and apply concentration bounds derived from the Poisson cluster representation. For the lower bound we combine Fano's inequality with Jacod's Girsanov formula for point processes on a suitable subclass of networks.

math.ST↗

Bidirectional Random Projections

This paper analyzes bidirectional random projections for ordinary least squares (OLS) regression under the fixed design setting. Let $(X, Y) \in \mathbb{R}^{n\times p}\times\mathbb{R}^{n}$ be a sample and $W \in \mathbb{R}^{n_1\times n}$, $R \in \mathbb{R}^{p\times p_1}$ be two random projections. We develop an expected excess loss bound for the OLS estimator built on $(WXR, WY)$, extending an established bound for the OLS estimator built on $(XR, Y)$. Our analysis shows that our bound is larger and the gap between the two bounds decays at a rate of approximately $O(1/n_1)$. These findings are confirmed by numerical results.

math.ST↗

Asymptotics for Model Selection in Probabilistic Principal Component Analysis

The probabilistic formulation of principal component analysis promises statistically grounded solutions to the problem of selecting the number of principal components. However, developing tractable model selection methods is complicated by the fact that the probabilistic principal component analysis (PPCA) model exhibits non-standard large sample asymptotics at model singularities, where the Fisher information matrix does not have full rank. In this work, tools from singular learning theory are used to provide a complete description of the marginal likelihood asymptotics for PPCA. The singular Bayesian information criterion (sBIC) along with our asymptotic results provides an effective procedure for selecting the number of principal components. In particular, the sBIC corrects for the overpenalization of the standard dimension-based BIC, which leads to too few principal components being selected, while also selecting the smallest true model with probability converging to one. Our framework extends beyond PPCA, where we also provide expressions for the sBIC that can be used to select between PPCA and factor analysis models. In both simulations and on real data the effectiveness of the proposed sBIC methodology is demonstrated.

math.ST↗