Araújo, Pedro; Hladký, Jan; Hng, Eng Keat; Šileikis, Matas Prominent examples of flip processes. (English) Zbl 07823354 Random Struct. Algorithms 64, No. 3, 692-740 (2024). MSC: 05C80 05C78 PDFBibTeX XMLCite \textit{P. Araújo} et al., Random Struct. Algorithms 64, No. 3, 692--740 (2024; Zbl 07823354) Full Text: DOI arXiv OA License
Klimošová, Tereza; Reiher, Christian; Ruciński, Andrzej; Šileikis, Matas Sandwiching biregular random graphs. (English) Zbl 1511.05211 Comb. Probab. Comput. 32, No. 1, 1-44 (2023). MSC: 05C80 PDFBibTeX XMLCite \textit{T. Klimošová} et al., Comb. Probab. Comput. 32, No. 1, 1--44 (2023; Zbl 1511.05211) Full Text: DOI arXiv
Araújo, Pedro; Griffiths, Simon; Šileikis, Matas; Warnke, Lutz Extreme local statistics in random graphs: maximum tree extension counts. arXiv:2310.11661 Preprint, arXiv:2310.11661 [math.PR] (2023). MSC: 05C80 60G70 60C05 BibTeX Cite \textit{P. Araújo} et al., ``Extreme local statistics in random graphs: maximum tree extension counts'', Preprint, arXiv:2310.11661 [math.PR] (2023) Full Text: arXiv OA License
Šileikis, Matas; Warnke, Lutz Counting extensions revisited. (English) Zbl 1522.05445 Random Struct. Algorithms 61, No. 1, 3-30 (2022). MSC: 05C80 05C60 05C30 60C05 05D10 PDFBibTeX XMLCite \textit{M. Šileikis} and \textit{L. Warnke}, Random Struct. Algorithms 61, No. 1, 3--30 (2022; Zbl 1522.05445) Full Text: DOI arXiv
Garbe, Frederik; Hladký, Jan; Šileikis, Matas; Skerman, Fiona From flip processes to dynamical systems on graphons. arXiv:2201.12272 Preprint, arXiv:2201.12272 [math.CO] (2022). BibTeX Cite \textit{F. Garbe} et al., ``From flip processes to dynamical systems on graphons'', Preprint, arXiv:2201.12272 [math.CO] (2022) Full Text: arXiv OA License
Hladký, Jan; Pelekis, Christos; Šileikis, Matas A limit theorem for small cliques in inhomogeneous random graphs. (English) Zbl 1522.05430 J. Graph Theory 97, No. 4, 578-599 (2021). MSC: 05C80 05D40 60F05 PDFBibTeX XMLCite \textit{J. Hladký} et al., J. Graph Theory 97, No. 4, 578--599 (2021; Zbl 1522.05430) Full Text: DOI arXiv
Blažej, Václav; Opler, Michal; Šileikis, Matas; Valtr, Pavel On the intersections of non-homotopic loops. (English) Zbl 07497531 Mudgal, Apurva (ed.) et al., Algorithms and discrete applied mathematics. 7th international conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021. Proceedings. Lect. Notes Comput. Sci. 12601, 196-205 (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{V. Blažej} et al., Lect. Notes Comput. Sci. 12601, 196--205 (2021; Zbl 07497531) Full Text: DOI
Šileikis, Matas; Warnke, Lutz Upper tail bounds for stars. (English) Zbl 1435.05183 Electron. J. Comb. 27, No. 1, Research Paper P1.67, 23 p. (2020). MSC: 05C80 60C05 60F10 PDFBibTeX XMLCite \textit{M. Šileikis} and \textit{L. Warnke}, Electron. J. Comb. 27, No. 1, Research Paper P1.67, 23 p. (2020; Zbl 1435.05183) Full Text: DOI arXiv Link
Ralaivaosaona, Dimbinaina; Šileikis, Matas; Wagner, Stephan A central limit theorem for almost local additive tree functionals. (English) Zbl 1446.60011 Algorithmica 82, No. 3, 642-679 (2020). MSC: 60C05 05C05 60F05 60J80 PDFBibTeX XMLCite \textit{D. Ralaivaosaona} et al., Algorithmica 82, No. 3, 642--679 (2020; Zbl 1446.60011) Full Text: DOI arXiv
Blažej, Václav; Opler, Michal; Šileikis, Matas; Valtr, Pavel Non-homotopic loops with a bounded number of pairwise intersections. (English) Zbl 07551744 Purchase, Helen C. (ed.) et al., Graph drawing and network visualization. 29th international symposium, GD 2021, Tübingen, Germany, September 14–17, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12868, 210-222 (2021). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{V. Blažej} et al., Lect. Notes Comput. Sci. 12868, 210--222 (2019; Zbl 07551744) Full Text: DOI arXiv
Šileikis, Matas; Warnke, Lutz A counterexample to the DeMarco-Kahn upper tail conjecture. (English) Zbl 1433.05285 Random Struct. Algorithms 55, No. 4, 775-794 (2019). MSC: 05C80 05C30 PDFBibTeX XMLCite \textit{M. Šileikis} and \textit{L. Warnke}, Random Struct. Algorithms 55, No. 4, 775--794 (2019; Zbl 1433.05285) Full Text: DOI arXiv
Ralaivaosaona, Dimbinaina; Sileikis, Matas; Wagner, Stephan Asymptotic normality of almost local functionals in conditioned Galton-Watson trees. (English) Zbl 1482.05043 Fill, James Allen (ed.) et al., 29th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2018, June 25–29, 2018, Uppsala, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 110, Article 33, 17 p. (2018). MSC: 05C05 60F05 60J80 PDFBibTeX XMLCite \textit{D. Ralaivaosaona} et al., LIPIcs -- Leibniz Int. Proc. Inform. 110, Article 33, 17 p. (2018; Zbl 1482.05043) Full Text: DOI
Łuczak, Tomasz; Mieczkowska, Katarzyna; Šileikis, Matas On maximal tail probability of sums of nonnegative, independent and identically distributed random variables. (English) Zbl 1380.60029 Stat. Probab. Lett. 129, 12-16 (2017). MSC: 60E15 05C35 05C65 60G50 PDFBibTeX XMLCite \textit{T. Łuczak} et al., Stat. Probab. Lett. 129, 12--16 (2017; Zbl 1380.60029) Full Text: DOI arXiv
Holmgren, Cecilia; Janson, Svante; Šileikis, Matas Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees. (English) Zbl 1366.60018 Electron. J. Comb. 24, No. 2, Research Paper P2.51, 49 p. (2017). MSC: 60C05 05C05 05C80 60F05 68P05 68P10 PDFBibTeX XMLCite \textit{C. Holmgren} et al., Electron. J. Comb. 24, No. 2, Research Paper P2.51, 49 p. (2017; Zbl 1366.60018) Full Text: arXiv Link
Dudek, Andrzej; Frieze, Alan; Ruciński, Andrzej; Šileikis, Matas Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. (English) Zbl 1350.05110 J. Comb. Theory, Ser. B 122, 719-740 (2017). MSC: 05C65 05C80 05C60 05C45 PDFBibTeX XMLCite \textit{A. Dudek} et al., J. Comb. Theory, Ser. B 122, 719--740 (2017; Zbl 1350.05110) Full Text: DOI arXiv
Holmgren, Cecilia; Janson, Svante; Šileikis, Matas Using Pólya urns to show normal limit laws for fringe subtrees in \(m\)-ary search trees. (English) Zbl 1411.68037 Neininger, Ralph (ed.) et al., Proceedings of the 27th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms – AofA’16, Kraków, Poland, July 4–8, 2016. Kraków: Jagiellonian University, Department of Theoretical Computer Science. 12 p. (2016). MSC: 68P05 60C05 68W40 PDFBibTeX XMLCite \textit{C. Holmgren} et al., in: Proceedings of the 27th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms -- AofA'16, Kraków, Poland, July 4--8, 2016. Kraków: Jagiellonian University, Department of Theoretical Computer Science. 12 p. (2016; Zbl 1411.68037)
Dudek, Andrzej; Frieze, Alan; Ruciński, Andrzej; Šileikis, Matas Loose Hamilton cycles in regular hypergraphs. (English) Zbl 1371.05201 Comb. Probab. Comput. 24, No. 1, 179-194 (2015). MSC: 05C65 05C80 05C38 PDFBibTeX XMLCite \textit{A. Dudek} et al., Comb. Probab. Comput. 24, No. 1, 179--194 (2015; Zbl 1371.05201) Full Text: DOI arXiv
Dudek, Andrzej; Frieze, Alan; Ruciński, Andrzej; Šileikis, Matas Regular hypergraphs: asymptotic counting and loose Hamilton cycles. (English) Zbl 1291.05139 Nešetřil, Jaroslav (ed.) et al., The seventh European conference on combinatorics, graph theory and applications. Extended abstracts of EuroComb 2013, Pisa, Italy, September 9–13, 2013. Pisa: Edizioni della Normale (ISBN 978-88-7642-474-8/pbk; 978-88-7642-475-5/ebook). Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series 16, 483-486 (2013). MSC: 05C65 05C30 05C45 PDFBibTeX XMLCite \textit{A. Dudek} et al., CRM Ser. 16, 483--486 (2013; Zbl 1291.05139)
Dudek, Andrzej; Frieze, Alan; Ruciński, Andrzej; Šileikis, Matas Approximate counting of regular hypergraphs. (English) Zbl 1285.05092 Inf. Process. Lett. 113, No. 19-21, 785-788 (2013). MSC: 05C30 05C65 PDFBibTeX XMLCite \textit{A. Dudek} et al., Inf. Process. Lett. 113, No. 19--21, 785--788 (2013; Zbl 1285.05092) Full Text: DOI arXiv
Dzindzalieta, D.; Juşkeviçius, T.; Şileikis, M. Optimal probability inequalities for random walks related to problems in extremal combinatorics. (English) Zbl 1251.60018 SIAM J. Discrete Math. 26, No. 2, 828-837 (2012). MSC: 60E15 05D05 PDFBibTeX XMLCite \textit{D. Dzindzalieta} et al., SIAM J. Discrete Math. 26, No. 2, 828--837 (2012; Zbl 1251.60018) Full Text: DOI arXiv
Šileikis, Matas On the upper tail of counts of strictly balanced subgraphs. (English) Zbl 1243.05222 Electron. J. Comb. 19, No. 1, Research Paper P4, 14 p. (2012). MSC: 05C80 PDFBibTeX XMLCite \textit{M. Šileikis}, Electron. J. Comb. 19, No. 1, Research Paper P4, 14 p. (2012; Zbl 1243.05222) Full Text: EMIS
Šileikis, Matas On measure concentration in graph products. (English) Zbl 1339.05344 Liet. Mat. Rink., Liet. Mat. Draugijos Darb. 50, 443-448 (2009). Reviewer: Sudev Naduvath (Thrissur) MSC: 05C76 60C05 05C12 PDFBibTeX XMLCite \textit{M. Šileikis}, Liet. Mat. Rink., Liet. Mat. Draugijos Darb. 50, 443--448 (2009; Zbl 1339.05344)