Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Gao, Wanting, Hu, Hong, Chen, Xudong
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2604.05138
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866915919307997184
author Gao, Wanting
Hu, Hong
Chen, Xudong
author_facet Gao, Wanting
Hu, Hong
Chen, Xudong
contents A graphon is said to have the $H$-property if a random undirected graph $G_n$ on $n$ nodes sampled from it has a node-wise disjoint cycle cover almost surely as $n\to\infty$. It has been shown in the earlier work that the $H$-property obeys the zero-one law, i.e., the probability that the random graph has a cycle cover tends to either one or zero. In this paper, we sharpen the result by characterizing the convergence rate of the probability. Specifically, we show that there are two different types of rates, with one being exponential and the other being root $n$. We provide a rigorous proof and numerical validation.
format Preprint
id arxiv_https___arxiv_org_abs_2604_05138
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Convergence rate of $H$-property for step-graphons
Gao, Wanting
Hu, Hong
Chen, Xudong
Probability
A graphon is said to have the $H$-property if a random undirected graph $G_n$ on $n$ nodes sampled from it has a node-wise disjoint cycle cover almost surely as $n\to\infty$. It has been shown in the earlier work that the $H$-property obeys the zero-one law, i.e., the probability that the random graph has a cycle cover tends to either one or zero. In this paper, we sharpen the result by characterizing the convergence rate of the probability. Specifically, we show that there are two different types of rates, with one being exponential and the other being root $n$. We provide a rigorous proof and numerical validation.
title Convergence rate of $H$-property for step-graphons
topic Probability
url https://arxiv.org/abs/2604.05138