How quickly do cycle-cover probabilities approach their limits? This work identifies exponential and root-n convergence regimes for graphs sampled from step-graphons.
BibTeX
@inproceedings{gao2026convergence,
title = {Convergence rate of {H}-property for step-graphons},
author = {Gao, Wanting and Hu, Hong and Chen, Xudong},
booktitle = {2026 IEEE Conference on Decision and Control (CDC)},
year = {2026},
note = {To appear},
eprint = {2604.05138},
archivePrefix = {arXiv},
primaryClass = {math.PR},
url = {https://arxiv.org/abs/2604.05138}
}
At the boundary where a zero-one law no longer applies, the limiting probability of a Hamiltonian decomposition still exists. We characterize this limit explicitly and validate it numerically.
BibTeX
@article{gao2025residual,
title = {On the {H}-property for Step-graphons: The Residual Case},
author = {Gao, Wanting and Chen, Xudong},
journal = {IFAC-PapersOnLine},
volume = {59},
number = {4},
pages = {7--12},
year = {2025},
doi = {10.1016/j.ifacol.2025.07.036}
}
Earlier work on multi-turn dialogue agents and their use as assistants in telemarketing conversations.
BibTeX
@inproceedings{gao2023dialogue,
title = {Multi-Turn Dialogue Agent as Sales' Assistant in Telemarketing},
author = {Gao, Wanting and Gao, Xinyi and Tang, Yin},
booktitle = {International Joint Conference on Neural Networks (IJCNN)},
pages = {1--9},
year = {2023},
doi = {10.1109/IJCNN54540.2023.10192042}
}