2020
DOI: 10.48550/arxiv.2005.07350
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Spanning trees in random regular uniform hypergraphs

Abstract: Let G n,r,s denote a uniformly random r-regular s-uniform hypergraph on the vertex set {1, 2, . . . , n}. We analyse the asymptotic distribution of Y G , the number of spanning trees in G, when r, s 2 are fixed constants, (r, s) = (2, 2), and the necessary divisibility conditions hold. Greenhill, Kwan and Wind (2014) investigated the graph case (s = 2), providing an asymptotic formula for the expected value of Y G for any fixed r 3, which was previously only known up to a constant factor. They also found the a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 28 publications
0
2
0
Order By: Relevance
“…The argument is then tuned to produce the distribution result of Z by Janson [14]. Recently, Greenhill, Isaev and Liang [11] proved that the number of spanning trees in (n, 𝑑) has the same type of distribution as (1). On the other hand, Garmo [10] studied the distributional phase transition of the number of 𝓁-cycles in (n, 𝑑) as 𝓁 grows from constant to linear in n. Its limiting distribution changes from a linear combination of independent Poisson variables to the exponential of that form, and the critical phase transition occurs when 𝓁 becomes linear in n.…”
Section: 1mentioning
confidence: 99%
“…The argument is then tuned to produce the distribution result of Z by Janson [14]. Recently, Greenhill, Isaev and Liang [11] proved that the number of spanning trees in (n, 𝑑) has the same type of distribution as (1). On the other hand, Garmo [10] studied the distributional phase transition of the number of 𝓁-cycles in (n, 𝑑) as 𝓁 grows from constant to linear in n. Its limiting distribution changes from a linear combination of independent Poisson variables to the exponential of that form, and the critical phase transition occurs when 𝓁 becomes linear in n.…”
Section: 1mentioning
confidence: 99%
“…The argument is then tuned to produce the distribution result of Z by Janson [13]. Recently, Greenhill, Isaev and Liang [10] proved that the number of spanning trees in G(n, d) has the same type of distribution as (1). On the other hand, Garmo [9] studied the distributional phase transition of the number of -cycles in G(n, d) as grows from constant to linear in n. Its limiting distribution changes from a linear combination of independent Poisson variables to the exponential of that form, and the critical phase transition occurs when becomes linear in n.…”
Section: The Number Of Perfect Matchingsmentioning
confidence: 99%