Skip to content
DraconiticResearch
Search Sources API
189,105 studies31 sourcesUpdated 25 min ago
Peer-reviewedLicence not statedThe Annals of Probability

Edge universality of random regular graphs of growing degrees

  1. 1Department of Statistics and Data Science, University of Pennsylvania
  2. 2Department of Mathematics, Harvard University

Related

  1. Bulk universality of random regular graphs
    Yukun He, Jiaoyang Huang, Xiaoyu Wang
    arXivPreprintarXiv licenceFull textMathematical physicsProbabilityarXiv
  2. Central Limit Theorem of Maximum Weight Matching on Random Graphs with Prescribed Degrees
    Shichen Jing, Wai-Kit Lam, Arnab Sen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  3. Uniform duplication-divergence random graphs I: Degrees and Local Limits
    Partha S. Dey, Neeladri Maitra, Jaya M. Manthripragada +1
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
  4. Sharp detection thresholds for random geometric graphs with polynomial average degrees
    Hang Du, Cheng Mao, Nike Sun +2
    arXivPreprintarXiv licenceFull textProbabilityStatisticsarXiv
  5. When are random regular triangle-free graphs bipartite?
    Gregory DeCamillis, Pu Gao
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
BibTeX
@article{huang2026edge,
  title = {{Edge universality of random regular graphs of growing degrees}},
  author = {Jiaoyang Huang and Horng‐Tzer Yau},
  journal = {The Annals of Probability},
  year = {2026},
  month = aug,
  doi = {10.1214/25-aop1807},
  url = {http://arxiv.org/abs/2305.01428},
}
RIS
TY  - JOUR
TI  - Edge universality of random regular graphs of growing degrees
AU  - Jiaoyang Huang
AU  - Horng‐Tzer Yau
PY  - 2026
DA  - 2026/08/28
JO  - The Annals of Probability
DO  - 10.1214/25-aop1807
UR  - http://arxiv.org/abs/2305.01428
SN  - 0091-1798
SN  - 2168-894X
ER  -