Arborescences of Random Covering Graphs
Muchen Ju, Junjie Ni, Kaixin Wang, Yihan Xiao

TL;DR
This paper derives a formula for the expected weighted sum of arborescences in a random covering graph, advancing understanding of their structure and confirming a conjecture by Chepuri et al.
Contribution
It provides a closed-form expression for the expected arborescences in random covering graphs, linking them to the original graph's arborescences and resolving a prior conjecture.
Findings
Derived a formula for the expected weighted sum of arborescences
Confirmed the conjecture of Chepuri et al. regarding covering graphs
Established a connection between arborescences of covering graphs and original graphs
Abstract
A rooted arborescence of a directed graph is a spanning tree directed towards a particular vertex. A recent work of Chepuri et al. showed that the arborescences of a covering graph of a directed graph G are closely related to the arborescences of G. In this paper, we study the weighted sum of arborescences of a random covering graph and give a formula for the expected value, resolving a conjecture of Chepuri et al.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Stochastic processes and statistical mechanics · Limits and Structures in Graph Theory
