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

Help | Advanced Search

Mathematics > Probability

arXiv:2503.04503 (math)
[Submitted on 6 Mar 2025 ]

Title: Reinforced Loop Soup via Wilson's Algorithm

Title: 通过威尔逊算法的强化环汤

Authors:Yinshan Chang, Yichao Huang, Dang-Zheng Liu, Xiaolin Zeng
Abstract: The goal of this note is twofold: first, we explain the relation between the isomorphism theorems in the context of vertex reinforced jump process discovered in [BHS19, BHS21] and the standard Markovian isomorphism theorems for Markovian jump processes; second, we introduce the vertex reinforced counterpart of the standard Poissonian loop soup developed by Le Jan [LJ10]. To this end, we propose an algorithm that can be viewed as a variant of Wilson's algorithm with reinforcement. We establish the isomorphism theorems for the erased loops and the random walk from this algorithm, and in particular provide a concrete construction of the reinforced loop soup via a random process with a reinforcement mechanism.
Abstract: 本注释的目标有两个:首先,我们解释在[ BHS19, BHS21 ]中发现的顶点强化跳跃过程中的同构定理与标准马尔可夫同构定理之间的关系;其次,我们引入由Le Jan [LJ10]开发的标准泊松环汤的顶点强化对应物。为此,我们提出一种算法,可以视为带有强化的Wilson算法的一种变体。我们从该算法中建立了擦除环和随机游走的同构定理,并特别通过具有强化机制的随机过程提供了强化环汤的具体构造。
Comments: This article supersedes arXiv:1911.09036
Subjects: Probability (math.PR) ; Mathematical Physics (math-ph)
Cite as: arXiv:2503.04503 [math.PR]
  (or arXiv:2503.04503v1 [math.PR] for this version)
  https://doi.org/10.48550/arXiv.2503.04503
arXiv-issued DOI via DataCite

Submission history

From: Yichao Huang [view email]
[v1] Thu, 6 Mar 2025 14:51:29 UTC (35 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.PR
< prev   |   next >
new | recent | 2025-03
Change to browse by:
math
math-ph
math.MP

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号