3 papers
math.CO2023
Random minimum spanning tree and dense graph limits
Jan Hladký, Gopal Viswanathan
A theorem of Frieze from 1985 asserts that the total weight of the minimum spanning tree of the complete graph whose edges get independent weights from the distribution $UNIF…
math.CO2023
Connectivity of inhomogeneous random graphs II
Jan Hladký, Gopal Viswanathan
Each graphon yields an inhomogeneous random graph model . We show that is asymptotically almost surely connected if and only if (i) is…
math.DS2019
An analogue of Pillai's theorem for continued fraction normality and an application to subsequences
Satyadev Nandakumar, Subin Pulari, Prateek Vishnoi +1
We show that two notions of continued fraction normality, one where overlapping occurrences of finite patterns are counted as distinct occurrences, and another where only disjoint…