21 citations · 26 across the 6 of their papers we have counts for
5 papers · 1 filter
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…
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…
Approximating fractionally isomorphic graphons
Jan Hladký, Eng Keat Hng
Grebík and Rocha [Fractional Isomorphism of Graphons, Combinatorica 42, pp 365-404 (2022)] extended the well studied notion of fractional isomorphism of graphs to graphons. We prov…
On pattern-avoiding permutons
Frederik Garbe, Jan Hladký, Gábor Kun +1
The theory of limits of permutations leads to limit objects called permutons, which are certain Borel measures on the unit square. We prove that permutons avoiding a given permutat…
Prominent examples of flip processes
Pedro Araújo, Jan Hladký, Eng Keat Hng +1
Flip processes, introduced in [Garbe, Hladký, Šileikis, Skerman: From flip processes to dynamical systems on graphons], are a class of random graph processes defined using a rule w…