E-LIB Suche - Ergebnisse für: Šileikis, Matas

1

Prominent examples of flip processes:

Araújo, Pedro ; Hladký, Jan ; Hng, Eng Keat.
Random Structures & Algorithms. 64 (2023) 3 - p. 692-740 , 2023

2

Sandwiching biregular random graphs:

Klimošová, Tereza ; Reiher, Christian ; Ruciński, Andrzej.
Combinatorics, Probability and Computing. 32 (2022) 1 - p. 1-44 , 2022

Link: https://doi.org/10.1017/..

3

Counting extensions revisited:

Šileikis, Matas ; Warnke, Lutz
Random Structures & Algorithms. 61 (2022) 1 - p. 3-30 , 2022

Link: https://doi.org/10.1002/..

4

A limit theorem for small cliques in inhomogeneous random g..:

Hladký, Jan ; Pelekis, Christos ; Šileikis, Matas
Journal of Graph Theory. 97 (2021) 4 - p. 578-599 , 2021

Link: https://doi.org/10.1002/..

5

On the Intersections of Non-homotopic Loops:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,

Blažej, Václav ; Opler, Michal ; Šileikis, Matas. - p. 196-205 , 2021

Link: https://doi.org/10.1007/..

6

Non-homotopic Loops with a Bounded Number of Pairwise Inter..:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,

Blažej, Václav ; Opler, Michal ; Šileikis, Matas. - p. 210-222 , 2021

Link: https://doi.org/10.1007/..

7

A Central Limit Theorem for Almost Local Additive Tree Func..:

Ralaivaosaona, Dimbinaina ; Šileikis, Matas ; Wagner, Stephan
Algorithmica. 82 (2019) 3 - p. 642-679 , 2019

Link: https://doi.org/10.1007/..

8

A counterexample to the DeMarco‐Kahn upper tail conjecture:

Šileikis, Matas ; Warnke, Lutz
Random Structures & Algorithms. 55 (2019) 4 - p. 775-794 , 2019

Link: https://doi.org/10.1002/..

9

On maximal tail probability of sums of nonnegative, indepen..:

Łuczak, Tomasz ; Mieczkowska, Katarzyna ; Šileikis, Matas
Statistics & Probability Letters. 129 (2017) - p. 12-16 , 2017

Link: https://doi.org/10.1016/..

10

Embedding the Erdős–Rényi hypergraph into the random regula..:

Dudek, Andrzej ; Frieze, Alan ; Ruciński, Andrzej.
Journal of Combinatorial Theory, Series B. 122 (2017) - p. 719-740 , 2017

Link: https://doi.org/10.1016/..

11

Loose Hamilton Cycles in Regular Hypergraphs:

DUDEK, ANDRZEJ ; FRIEZE, ALAN ; RUCIŃSKI, ANDRZEJ.
Combinatorics, Probability and Computing. 24 (2014) 1 - p. 179-194 , 2014

Link: https://doi.org/10.1017/..

12

Approximate counting of regular hypergraphs:

Dudek, Andrzej ; Frieze, Alan ; Ruciński, Andrzej.
Information Processing Letters. 113 (2013) 19-21 - p. 785-788 , 2013

Link: https://doi.org/10.1016/..

13

On measure concentration in graph products:

Šileikis, Matas
Lietuvos matematikos rinkinys. 50 (2009) - p. , 2009

Link: https://doi.org/10.15388..

14

Extreme local statistics in random graphs: maximum tree ext..:

Araújo, Pedro ; Griffiths, Simon ; Šileikis, Matas.
http://arxiv.org/abs/2310.11661. , 2023

Link: http://arxiv.org/abs/231..

15

Prominent examples of flip processes:

Araújo, Pedro ; Hladký, Jan ; Hng, Eng Keat.
http://arxiv.org/abs/2206.03884. , 2022

Link: http://arxiv.org/abs/220..