Searcharxiv⌕ Search

arXiv · 2611.03288

Tail persistence of extremes at finite and asymptotic levels with Bayesian hierarchical inference

Abstract

Tail persistence characterizes the relative escalation of observations beyond an extreme threshold and complements conventional summaries such as return levels and tail indices. Existing literature is mainly distribution-based and does not account for uncertainty, nonstationarity, or covariate effects. We develop a Bayesian framework for modeling tail persistence under generalized extreme value and generalized Pareto models. We first make explicit the connection between tail persistence and the extreme value index under regular variation, which identifies the asymptotic persistence with $1/(1-ξ)$ and links persistence to tail heaviness. We then derive closed-form expressions for persistence at finite quantile levels under both models and show that, for any location--scale extreme value family with a common shape parameter, finite-level persistence depends on the location and scale parameters only through their ratio. Motivated by these results and by the weak identifiability of observation-specific shape parameters, we formulate a Bayesian hierarchical extreme value model in which the shape parameter is constant over time, while the location and scale parameters vary with covariates and latent effects. The asymptotic persistence is then a single, well-identified quantity, whereas finite-level persistence evolves over time through the location--scale structure. The framework provides posterior inference for both quantities, with credible intervals and probabilistic assessment of temporal evolution and covariate effects. Through simulation studies and real-data applications, we show that persistence provides an interpretable characterization of the escalation of extremes beyond high thresholds, complementing classical extreme value summaries with comprehensive uncertainty quantification in nonstationary settings. The methodology is implemented in an open-source \texttt{R} package.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nikita Rawat, Shiv Kumar Yadav, Dreamlee Sharma, Rishikesh Yadav. 2026-11-02. Tail persistence of extremes at finite and asymptotic levels with Bayesian hierarchical inference. https://arxiv.org/abs/2611.03288

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Debiased Estimating Equation Method for Robust and Efficient Mendelian Randomization Using a Large Number of Correlated Weak and Invalid Instruments

Mendelian randomization (MR) is a widely used tool for causal inference in the presence of unmeasured confounders, which uses single nucleotide polymorphisms (SNPs) as instrumental variables to estimate causal effects. However, SNPs often have weak effects on complex traits, leading to bias in existing MR analyses when weak instruments are included. In addition, existing MR methods often restrict analysis to independent SNPs via linkage disequilibrium clumping and result in a loss of efficiency in estimating the causal effect due to discarding correlated SNPs. To address these issues, we propose the Debiased Estimating Equation Method (DEEM), a summary statistics-based MR approach that can incorporate a large number of correlated, weak-effect, and invalid SNPs. DEEM effectively eliminates the weak instrument bias and improves the statistical efficiency of the causal effect estimation by leveraging information from a large number of correlated SNPs. DEEM also allows for pleiotropic effects, adjusts for the winner's curse, and applies to both two-sample and one-sample MR analyses. Asymptotic analyses of the DEEM estimator demonstrate its attractive theoretical properties. Through extensive simulations and two real data examples, we demonstrate that DEEM significantly improves the efficiency and robustness of MR analysis compared with existing methods.

stat.ME↗

Latent Space Graph-fused LASSO for Clustering in Attributed Graphs

This manuscript studies latent space graph-fused LASSO methods for clustering graphs with multivariate nodal attributes. The framework includes node-specific priors of low-dimensional representations coupled with a neural decoder that bridges the observed attributes with the latent variables. Both structural and attribute information are incorporated for the clustering through a graph-fused LASSO regularization on prior nodal means. The optimization problem is solved via the alternating direction method of multipliers with Langevin dynamics for posterior inference. Simulations on grid and block graphs, together with applications to California county temperatures and Los Angeles traffic data, demonstrate the effectiveness of the proposed method.

stat.ME↗

Missing data and cluster graphs: cluster-level missingness vs variable-level missingness

Missing data is pervasive in many scientific domains such as public health, environmental science, and the social sciences. Recoverability from missing data is typically studied using fully specified variable-level missingness models despite that, in many applications, only coarse structural information is available, for instance when variables are grouped into clusters due to limited knowledge or interpretability reasons. In this paper, we investigate recoverability from such abstract representations. We introduce two classes of cluster-based missingness graphs: the m-C-DMG, which retains variable-specific missingness indicators, and the cm-C-DMG, which aggregates missingness mechanisms at the cluster level. We formalize the notion of compatibility between these abstract graphs and underlying variable-level missingness models, and study how this abstraction affects the recoverability of probabilistic and causal queries. In particular, we give graphical conditions of recovering the joint distribution as well as graphical conditions of recovering a macro causal effect.

stat.ME↗