English
Related papers

Related papers: On all Pickands Dependence Functions whose corresp…

200 papers

The Erd\H os Matching Conjecture states that the maximum size $f(n,k,s)$ of a family $\mathcal{F}\subseteq \binom{[n]}{k}$ that does not contain $s$ pairwise disjoint sets is $\max\{|\mathcal{A}_{k,s}|,|\mathcal{B}_{n,k,s}|\}$, where…

Combinatorics · Mathematics 2024-09-16 Ryan R. Martin , Balázs Patkós

For any family of measurable sets in a probability space, we show that either (i) the family has infinite Vapnik-Chervonenkis (VC) dimension or (ii) for every epsilon > 0 there is a finite partition pi such the pi-boundary of each set has…

Probability · Mathematics 2010-10-22 Terrence M. Adams , Andrew B. Nobel

The following classical question in extremal set theory is due to Erd\H os and S\'os: what is the size of the largest family $\mathcal F\subset {[n]\choose k}$ with no two sets $F_1,F_2\in \mathcal F$ such that $|F_1\cap F_2| = t$? In this…

Combinatorics · Mathematics 2026-02-12 Andrey Kupavskii , Yakov Shubin

Many applications in risk analysis, especially in environmental sciences, require the estimation of the dependence among multivariate maxima. A way to do this is by inferring the Pickands dependence function of the underlying extreme-value…

Methodology · Statistics 2016-04-18 G. Marcon , S. A. Padoan , P. Naveau , P. Muliere , J. Segers

In this paper, we study a semiparametric family of bivariate copulas. The family is generated by an univariate function, determining the symmetry (radial symmetry, joint symmetry) and dependence property (quadrant dependence, total…

Statistics Theory · Mathematics 2011-03-31 Cécile Amblard , Stéphane Girard

In the present paper, we study extreme negative dependence focussing on the concordance order for copulas. With the absence of a least element for dimensions $d\ge$ 3, the set of all minimal elements in the collection of all copulas turns…

Statistics Theory · Mathematics 2018-10-22 Jae Youn Ahn , Sebastian Fuchs

Despite the fact that copulas are commonly considered as analytically smooth/regular objects, derivatives of copulas have to be handled with care. Triggered by a recently published result characterizing multivariate copulas via…

Statistics Theory · Mathematics 2024-08-13 Nicolas Dietrich , Wolfgang Trutschnig

We develop a new statistical procedure to test whether the dependence structure is identical between two groups. Rather than relying on a single index such as Pearson's correlation coefficient or Kendall's Tau, we consider the entire…

Econometrics · Economics 2018-11-07 Juwon Seo

We study a simple statistic for benchmarking how well a sample preserves a known bivariate dependence structure. Given a target copula family (Clayton or Gumbel) and parameter $\theta_P$, the Copula Discrepancy (CD) compares the target…

Machine Learning · Statistics 2025-12-30 Agnideep Aich , Ashit Baran Aich

In this paper we study two directions of extending the classical Erd\H os-Ko-Rado theorem which states that any family of $k$-element subsets of the set $[n] = \{1,\ldots,n\}$ in which any two sets intersect, has cardinality at most…

Combinatorics · Mathematics 2019-05-31 Peter Frankl , Andrey Kupavskii

We show how the problem of estimating conditional Kendall's tau can be rewritten as a classification task. Conditional Kendall's tau is a conditional dependence parameter that is a characteristic of a given pair of random variables. The…

Computation · Statistics 2018-11-27 Alexis Derumigny , Jean-David Fermanian

We carry out a systematical study of the size scaling of Liouvillian gap in boundary-dissipated one-dimensional quasiperiodic and disorder systems. By treating the boundary-dissipation operators as a perturbation, we derive an analytical…

Disordered Systems and Neural Networks · Physics 2022-08-12 Bozhen Zhou , Xueliang Wang , Shu Chen

We show that if $T$ is a dependent theory then so is its Keisler randomisation $T^R$. In order to do this we generalise the notion of a Vapnik-Chervonenkis class to families of $[0,1]$-valued functions (a \emph{continuous}…

Logic · Mathematics 2010-04-22 Itaï Ben Yaacov

The maximum correlation of functions of a pair of random variables is an important measure of stochastic dependence. It is known that this maximum nonlinear correlation is identical to the absolute value of the Pearson correlation for a…

Statistics Theory · Mathematics 2020-08-11 Zijian Guo , Cun-Hui Zhang

Liverani-Saussol-Vaienti (L-S-V) maps form a family of piecewise differentiable dynamical systems on $[0,1]$ depending on one parameter $\omega\in\mathbb R^+$. These maps are everywhere expanding apart from a neutral fixed point. It is well…

Dynamical Systems · Mathematics 2021-08-11 Christopher Bose , Anthony Quas , Matteo Tanzi

We propose a semiparametric family of copulas based on a set of orthonormal functions and a matrix. This new copula permits to reach values of Spearman's Rho arbitrarily close to one without introducing a singular component. Moreover, it…

Statistics Theory · Mathematics 2013-10-22 Cécile Amblard , Stephane Girard , Ludovic Menneteau

Kendall's tau and Spearman's rho are widely used tools for measuring dependence. Surprisingly, when it comes to asymptotic inference for these rank correlations, some fundamental results and methods have not yet been developed, in…

Methodology · Statistics 2026-02-11 Marc-Oliver Pohle , Jan-Lukas Wermuth , Christian H. Weiß

Let M be a compact Riemannian manifold with boundary. Let b>0 be the number of connected components of its boundary. For manifolds of dimension at least 3, we prove that it is possible to obtain an arbitrarily large (b+1)-th Steklov…

Spectral Theory · Mathematics 2018-10-16 Bruno Colbois , Ahmad El Soufi , Alexandre Girouard

We propose a variational framework for analyzing dependence structures of convex compact random sets based on their support functions. The approach relies on the canonical even--odd decomposition on the unit sphere, which separates…

Statistics Theory · Mathematics 2026-03-10 Tuyen Luc Tri

Let $X$ be $k$-regular graph on $v$ vertices and let $\tau$ denote the least eigenvalue of its adjacency matrix $A(X)$. If $\alpha(X)$ denotes the maximum size of an independent set in $X$, we have the following well known bound: \[…

Combinatorics · Mathematics 2007-05-23 C. D. Godsil , M. W. Newman