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:2306.04278

Help | Advanced Search

Mathematics > Probability

arXiv:2306.04278 (math)
[Submitted on 7 Jun 2023 (v1) , last revised 17 Jan 2024 (this version, v2)]

Title: The permuton limit of random recursive separable permutations

Title: 递归可分排列的排列图极限

Authors:Valentin Féray, Kelvin Rivera-Lopez
Abstract: We introduce and study a simple Markovian model of random separable permutations. Our first main result is the almost sure convergence of these permutations towards a random limiting object in the sense of permutons, which we call the recursive separable permuton. We then prove several results on this new limiting object: a characterization of its distribution via a fixed-point equation, a combinatorial formula for its expected pattern densities, an explicit integral formula for its intensity measure, and lastly, we prove that its distribution is absolutely singular with respect to that of the Brownian separable permuton, which is the large size limit of uniform random separable permutations.
Abstract: 我们引入并研究了一个简单的马尔可夫随机可分离排列模型。 我们的第一个主要结果是这些排列在排列子意义下几乎必然收敛到一个随机极限对象,我们称之为递归可分离排列子。 然后我们证明了这个新的极限对象的几个结果:通过一个固定点方程对其分布的描述,其期望模式密度的组合公式,其强度测度的显式积分公式,最后,我们证明了其分布相对于布朗可分离排列子是绝对奇异的,后者是均匀随机可分离排列在大尺寸下的极限。
Comments: 37 pages, 15 figures. v2 incorporates referee's suggestions
Subjects: Probability (math.PR) ; Combinatorics (math.CO)
MSC classes: 60C05, 05A05
Cite as: arXiv:2306.04278 [math.PR]
  (or arXiv:2306.04278v2 [math.PR] for this version)
  https://doi.org/10.48550/arXiv.2306.04278
arXiv-issued DOI via DataCite

Submission history

From: Valentin Féray [view email]
[v1] Wed, 7 Jun 2023 09:29:08 UTC (759 KB)
[v2] Wed, 17 Jan 2024 09:14:55 UTC (862 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2023-06
Change to browse by:
math
math.PR

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号