Search results
- 1.0505984 - ÚI 2020 US eng V - Research Report
Hladký, Jan - Pelekis, Christos - Šileikis, Matas
A limit theorem for small cliques in inhomogeneous random graphs.
Cornell University, 2019. 15 s. arXiv.org e-Print archive, arXiv:1903.10570 [math.CO].
R&D Projects: GA ČR GJ16-07822Y; GA ČR(CZ) GJ18-01472Y; GA ČR(CZ) GA19-08740S
Institutional support: RVO:67985840 ; RVO:67985807
OECD category: Pure mathematics
https://arxiv.org/abs/1903.10570
Permanent Link: http://hdl.handle.net/11104/0297301 - 2.0494763 - ÚI 2019 US eng V - Research Report
Doležal, Martin - Grebík, Jan - Hladký, Jan - Rocha, Israel - Rozhoň, Václav
Cut distance identifying graphon parameters over weak* limits.
Cornell University, 2018. 21 s. arXiv.org e-Print archive, arXiv:1809.03797 [math.CO].
R&D Projects: GA ČR GJ16-07822Y; GA ČR GF17-33849L; GA ČR(CZ) GJ18-01472Y
Institutional support: RVO:67985807 ; RVO:67985840
Keywords : graphon * graph limit * cut norm * weak* convergence * norm graphs
OECD category: Pure mathematics
https://arxiv.org/abs/1809.03797
Permanent Link: http://hdl.handle.net/11104/0287832