Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2504.07704

Help | Advanced Search

Mathematics > Statistics Theory

arXiv:2504.07704 (math)
[Submitted on 10 Apr 2025 (v1) , last revised 7 Jul 2025 (this version, v2)]

Title: Measures of non-simplifyingness for conditional copulas and vines

Title: 条件Copula和vines的非简化性度量

Authors:Alexis Derumigny
Abstract: In copula modeling, the simplifying assumption has recently been the object of much interest. Although it is very useful to reduce the computational burden, it remains far from obvious whether it is actually satisfied in practice. We propose a theoretical framework which aims at giving a precise meaning to the following question: how non-simplified or close to be simplified is a given conditional copula? For this, we propose a new framework centered at the notion of measure of non-constantness. Then we discuss generalizations of the simplifying assumption to the case where the conditional marginal distributions may not be continuous, and corresponding measures of non-simplifyingness in this case. The simplifying assumption is of particular importance for vine copula models, and we therefore propose a notion of measure of non-simplifyingness of a given copula for a particular vine structure, as well as different scores measuring how non-simplified such a vine decompositions would be for a general vine. Finally, we propose estimators for these measures of non-simplifyingness given an observed dataset. A small simulation study shows the performance of a few estimators of these measures of non-simplifyingness.
Abstract: 在copula建模中,简化的假设最近引起了广泛关注。尽管它非常有助于减少计算负担,但在实践中是否真的满足仍然远非显而易见。我们提出一个理论框架,旨在明确以下问题的含义:给定的条件copula有多不简化或接近简化?为此,我们提出一个以“非恒定性度量”概念为中心的新框架。然后我们讨论了简化假设的推广情况,其中条件边缘分布可能不连续,并讨论了在这种情况下相应的非简化性度量。简化假设对于vine copula模型尤为重要,因此我们提出了针对特定vine结构的给定copula的非简化性度量,以及不同评分指标,用于衡量一般vine结构下这样的vine分解有多不简化。最后,我们提出了在观察到的数据集下这些非简化性度量的估计量。一个小的模拟研究展示了这些非简化性度量的一些估计量的表现。
Comments: 22 pages, 1 figure
Subjects: Statistics Theory (math.ST) ; Other Statistics (stat.OT)
MSC classes: 62H05
Cite as: arXiv:2504.07704 [math.ST]
  (or arXiv:2504.07704v2 [math.ST] for this version)
  https://doi.org/10.48550/arXiv.2504.07704
arXiv-issued DOI via DataCite

Submission history

From: Alexis Derumigny [view email]
[v1] Thu, 10 Apr 2025 12:46:39 UTC (44 KB)
[v2] Mon, 7 Jul 2025 16:32:06 UTC (92 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
math.ST
< prev   |   next >
new | recent | 2025-04
Change to browse by:
math
stat
stat.OT
stat.TH

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号