arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2306.11596math.PRmath.CO
收藏

拼接随机匹配

Concatenating Random Matchings

Fabian Burghart, Paul Thévenin

AI总结:

本文研究由t个均匀随机完美匹配拼接而成的随机弦图Br_n(t),利用更新理论和顶点探索过程刻画巨分支及环结构的渐近性质。

摘要:

我们考虑在2n个顶点上拼接t个均匀随机完美匹配,其中拼接操作受到Brauer代数 B_n(δ) 生成元乘法的启发。对于所得随机弦图 Br_n(t),我们观察到一个巨连通分支,当且仅当n为奇数;并且当t→∞时,我们得到关于环的数量、巨分支大小以及给定形状环的数量的渐近结果。此外,我们给出了巨分支的局部描述。这些结果主要依赖更新理论,以及通过随机顶点探索过程对 Br_n(t) 连通分支进行编码。

英文摘要:

We consider the concatenation of $t$ uniformly random perfect matchings on $2n$ vertices, where the operation of concatenation is inspired by the multiplication of generators of the Brauer algebra $\mathfrak{B}_n(δ)$. For the resulting random string diagram $\mathsf{Br}_n(t)$, we observe a giant component if and only if $n$ is odd, and as $t\to\infty$ we obtain asymptotic results concerning the number of loops, the size of the giant component, and the number of loops of a given shape. Moreover, we give a local description of the giant component. These results mainly rely on the use of renewal theory and the coding of connected components of $\mathsf{Br}_n(t)$ by random vertex-exploration processes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑