Searcharxiv⌕ Search

arXiv subjects

Ruodu Wang

Publications and source records attributed to Ruodu Wang.

125 records · Page 7Linked to original sources

Scenario-based Risk Evaluation

Risk measures such as Expected Shortfall (ES) and Value-at-Risk (VaR) have been prominent in banking regulation and financial risk management. Motivated by practical considerations in the assessment and management of risks, including tractability, scenario relevance and robustness, we consider theoretical properties of scenario-based risk evaluation. We propose several novel scenario-based risk measures, including various versions of Max-ES and Max-VaR, and study their properties. We establish axiomatic characterizations of scenario-based risk measures that are comonotonic-additive or coherent and an ES-based representation result is obtained. These results provide a theoretical foundation for the recent Basel III & IV market risk calculation formulas. We illustrate the theory with financial data examples.

q-fin.MF↗

Stochastic decomposition for $\ell_p$-norm symmetric survival functions on the positive orthant

We derive a stochastic representation for the probability distribution on the positive orthant $(0,\infty)^d$ whose association between components is minimal among all probability laws with $\ell_p$-norm symmetric survival functions. It is given by a transformation of a uniform distribution on the standard unit simplex that is multiplied with an independent finite mixture of certain beta distributions and an additional atom at unity. On the one hand, this implies an efficient simulation algorithm for arbitrary probability laws with $\ell_p$-norm symmetric survival function. On the other hand, this result is leveraged to construct an exact simulation algorithm for max-infinitely divisible probability distributions on the positive orthant whose exponent measure has $\ell_p$-norm symmetric survival function. Both applications generalize existing results for the case $p=1$ to the case of arbitrary $p \geq 1$.

math.PR↗

Admissible ways of merging p-values under arbitrary dependence

Methods of merging several p-values into a single p-value are important in their own right and widely used in multiple hypothesis testing. This paper is the first to systematically study the admissibility (in Wald's sense) of p-merging functions and their domination structure, without any information on the dependence structure of the input p-values. As a technical tool we use the notion of e-values, which are alternatives to p-values recently promoted by several authors. We obtain several results on the representation of admissible p-merging functions via e-values and on (in)admissibility of existing p-merging functions. By introducing new admissible p-merging functions, we show that some classic merging methods can be strictly improved to enhance power without compromising validity under arbitrary dependence.

math.ST↗

Robustness in the Optimization of Risk Measures

We study issues of robustness in the context of Quantitative Risk Management and Optimization. We develop a general methodology for determining whether a given risk measurement related optimization problem is robust, which we call "robustness against optimization". The new notion is studied for various classes of risk measures and expected utility and loss functions. Motivated by practical issues from financial regulation, special attention is given to the two most widely used risk measures in the industry, Value-at-Risk (VaR) and Expected Shortfall (ES). We establish that for a class of general optimization problems, VaR leads to non-robust optimizers whereas convex risk measures generally lead to robust ones. Our results offer extra insight on the ongoing discussion about the comparative advantages of VaR and ES in banking and insurance regulation. Our notion of robustness is conceptually different from the field of robust optimization, to which some interesting links are derived.

q-fin.RM↗

E-values: Calibration, combination, and applications

Multiple testing of a single hypothesis and testing multiple hypotheses are usually done in terms of p-values. In this paper we replace p-values with their natural competitor, e-values, which are closely related to betting, Bayes factors, and likelihood ratios. We demonstrate that e-values are often mathematically more tractable; in particular, in multiple testing of a single hypothesis, e-values can be merged simply by averaging them. This allows us to develop efficient procedures using e-values for testing multiple hypotheses.

math.ST↗

Combining p-values via averaging

This paper proposes general methods for the problem of multiple testing of a single hypothesis, with a standard goal of combining a number of p-values without making any assumptions about their dependence structure. An old result by Rüschendorf and, independently, Meng implies that the p-values can be combined by scaling up their arithmetic mean by a factor of 2 (and no smaller factor is sufficient in general). A similar result about the geometric mean (Mattner) replaces 2 by $e$. Based on more recent developments in mathematical finance, specifically, robust risk aggregation techniques, we extend these results to generalized means; in particular, we show that $K$ p-values can be combined by scaling up their harmonic mean by a factor of $\ln K$ (asymptotically as $K\to\infty$). This leads to a generalized version of the Bonferroni-Holm procedure. We also explore methods using weighted averages of p-values. Finally, we discuss the efficiency of various methods of combining p-values and how to choose a suitable method in light of data and prior information.

math.ST↗

Weak comonotonicity

The classical notion of comonotonicity has played a pivotal role when solving diverse problems in economics, finance, and insurance. In various practical problems, however, this notion of extreme positive dependence structure is overly restrictive and sometimes unrealistic. In the present paper, we put forward a notion of weak comonotonicity, which contains the classical notion of comonotonicity as a special case, and gives rise to necessary and sufficient conditions for a number of optimization problems, such as those arising in portfolio diversification, risk aggregation, and premium calculation. In particular, we show that a combination of weak comonotonicity and weak antimonotonicity with respect to some choices of measures is sufficient for the maximization of Value-at-Risk aggregation, and weak comonotonicity is necessary and sufficient for the Expected Shortfall aggregation. Finally, with the help of weak comonotonicity acting as an intermediate notion of dependence between the extreme cases of no dependence and strong comonotonicity, we give a natural solution to a risk-sharing problem.

q-fin.RM↗

Sums of Standard Uniform Random Variables

In this paper, we analyze the set of all possible aggregate distributions of the sum of standard uniform random variables, a simply stated yet challenging problem in the literature of distributions with given margins. Our main results are obtained for two distinct cases. In the case of dimension two, we obtain four partial characterization results. An analytical result with full generality is not available in this case, and it seems to be out of reach with existing techniques. For dimension greater or equal to three, we obtain a full characterization of the set of aggregate distributions, which is the first complete characterization result of this type in the literature for any choice of continuous marginal distributions.

math.PR↗

Distributional Compatibility for Change of Measures

In this paper, we characterize compatibility of distributions and probability measures on a measurable space. For a set of indices $\mathcal J$, we say that the tuples of probability measures $(Q_i)_{i\in \mathcal J} $ and distributions $(F_i)_{i\in \mathcal J} $ are {compatible} if there exists a random variable having distribution $F_i$ under $Q_i$ for each $i\in \mathcal J$. We first establish an equivalent condition using conditional expectations for general (possibly uncountable) $\mathcal J$. For a finite $n$, it turns out that compatibility of $(Q_1,\dots,Q_n)$ and $(F_1,\dots,F_n)$ depends on the heterogeneity among $Q_1,\dots,Q_n$ compared with that among $F_1,\dots,F_n$. We show that, under an assumption that the measurable space is rich enough, $(Q_1,\dots,Q_n)$ and $(F_1,\dots,F_n)$ are compatible if and only if $(Q_1,\dots,Q_n)$ dominates $(F_1,\dots,F_n)$ in a notion of heterogeneity order, defined via multivariate convex order between the Radon-Nikodym derivatives of $(Q_1,\dots,Q_n)$ and $(F_1,\dots,F_n)$ with respect to some reference measures. We then proceed to generalize our results to stochastic processes, and conclude the paper with an application to portfolio selection problems under multiple constraints.

math.PR↗

Compatible Matrices of Spearman's Rank Correlation

In this paper, we provide a negative answer to a long-standing open problem on the compatibility of Spearman's rho matrices. Following an equivalence of Spearman's rho matrices and linear correlation matrices for dimensions up to 9 in the literature, we show non-equivalence for dimensions 12 or higher. In particular, we connect this problem with the existence of a random vector under some linear projection restrictions in two characterization results.

math.ST↗

Random Locations of Periodic Stationary Processes

We consider a family of random locations, called intrinsic location functionals, of periodic stationary processes. This family includes but is not limited to the location of the path supremum and first/last hitting times. We first show that the set of all possible distributions of intrinsic location functionals for periodic stationary processes is the convex hull generated by a specific group of distributions. We then focus on two special subclasses of these random locations. For the first subclass, the density has a uniform lower bound; for the second subclass, the possible distributions are closely related to the concept of joint mixability.

math.PR↗

Centers of probability measures without the mean

In the recent years, the notion of mixability has been developed with applications to optimal transportation, quantitative finance and operations research. An $n$-tuple of distributions is said to be jointly mixable if there exist $n$ random variables following these distributions and adding up to a constant, called center, with probability one. When the $n$ distributions are identical, we speak of complete mixability. If each distribution has finite mean, the center is obviously the sum of the means. In this paper, we investigate the set of centers of completely and jointly mixable distributions not having a finite mean. In addition to several results, we show the (possibly counterintuitive) fact that, for each $n \geq 2$, there exist $n$ standard Cauchy random variables adding up to a constant $C$ if and only if $$|C|\le\frac{n\,\log (n-1)}π.$$

math.PR↗

Bernoulli and tail-dependence compatibility

The tail-dependence compatibility problem is introduced. It raises the question whether a given $d\times d$-matrix of entries in the unit interval is the matrix of pairwise tail-dependence coefficients of a $d$-dimensional random vector. The problem is studied together with Bernoulli-compatible matrices, that is, matrices which are expectations of outer products of random vectors with Bernoulli margins. We show that a square matrix with diagonal entries being 1 is a tail-dependence matrix if and only if it is a Bernoulli-compatible matrix multiplied by a constant. We introduce new copula models to construct tail-dependence matrices, including commonly used matrices in statistics.

math.PR↗

Current Open Questions in Complete Mixability

Complete and joint mixability has raised considerable interest in recent few years, in both the theory of distributions with given margins, and applications in discrete optimization and quantitative risk management. We list various open questions in the theory of complete and joint mixability, which are mathematically concrete, and yet accessible to a broad range of researchers without specific background knowledge. In addition to the discussions on open questions, some results contained in this paper are new.

math.PR↗

Extreme Negative Dependence and Risk Aggregation

We introduce the concept of an extremely negatively dependent (END) sequence of random variables with a given common marginal distribution. The END structure, as a new benchmark for negative dependence, is comparable to comonotonicity and independence. We show that an END sequence always exists for any given marginal distributions with a finite mean and we provide a probabilistic construction. Through such a construction, the partial sum of identically distributed but dependent random variables is controlled by a random variable that depends only on the marginal distribution of the sequence. The new concept and derived results are used to obtain asymptotic bounds for risk aggregation with dependence uncertainty.

math.PR↗

Distortion Risk Measures and Elicitability

We discuss equivalent axiomatic characterizations of distortion risk measures, and give a novel and concise proof of the characterization of elicitable distortion risk measures. Elicitability has recently been discussed as a desirable criterion for risk measures, motivated by statistical considerations of forecasting. We reveal the mathematical conflict between the requirements of elicitability and comonotonic additivity which intuitively explains why only Value-at-Risk and the mean are elicitable distortion risk measures in a general sense.

q-fin.RM↗

Tests for covariance matrix with fixed or divergent dimension

Testing covariance structure is of importance in many areas of statistical analysis, such as microarray analysis and signal processing. Conventional tests for finite-dimensional covariance cannot be applied to high-dimensional data in general, and tests for high-dimensional covariance in the literature usually depend on some special structure of the matrix. In this paper, we propose some empirical likelihood ratio tests for testing whether a covariance matrix equals a given one or has a banded structure. The asymptotic distributions of the new tests are independent of the dimension.

math.ST↗