Matas Šileikis

Currently I am a postdoctoral research assistant at Institute of Computer Science of the Czech Academy of Sciences in the group of dr Diana Piguet

My Curriculum Vitae


Probability inequalities, random graphs and hypergraphs, extremal combinatorics

PhD thesis

Inequalities for sums of random variables: a combinatorial perspective, Adam Mickiewicz University (2012).  PDF file (corrected version from 12.07.2012).

Journal papers

  1. D. Dzindzalieta, T. Juškevičius, M. Šileikis. Optimal Probability Inequalities for Random Walks Related to Problems in Extremal Combinatorics , SIAM J. Discrete Math26-2 (2012), pp. 828-837 preprint
  2. M. Šileikis. On the Upper Tail of Counts of Strictly Balanced Subgraphs, Electron. J. Combin. 19-1 (2012), P4 PDF
  3. A. Dudek, A. Frieze, A. Ruciński, M. Šileikis. Approximate counting of regular hypergraphs via switchings, Inform. process. lett. 113 (2013), pp. 785-788 preprint
  4. A. Dudek, A. Frieze, A. Ruciński, M Šileikis. Loose Hamilton Cycles in Regular Hypergraphs, Combin. Probab. Comput., 24 (2015) Special Issue 01, pp. 179-194.  preprint
  5. A. Dudek, A. Frieze, A. Ruciński, M Šileikis. Embedding the Erdős-Rényi Hypergraph into the Random Regular Hypergraph and Hamiltonicity, J. Comb. Theory B, 122 (2017), pp. 719-740, paperpreprint
  6. T. Łuczak, K. Mieczkowska. M. Šileikis. On maximal tail probability of sums of nonnegative, independent and identically distributed random variables, Statistics & Probability Letters, 129 (2017), pp. 12–16
    paper preprint
  7. C. Holmgren, S. Janson, M. Šileikis. Multivariate normal limit laws for the numbers of fringe subtrees in m-ary search trees and preferential attachment trees, Electron. J. Combin. 24-2 (2017). PDF, extended abstract from AofA 2016 conference


  1. V. Bentkus, M. Šileikis. Bounds for Tail Probabilities of Unbounded Unimodal Random Variables. preprint
  2. D. Ralaivaosaona, M. Šileikis, S. Wagner. Asymptotic normality of almost local functionals in conditioned Galton-Watson trees: extended abstract. PDF
  3. M. Šileikis, L. Warnke. A counterexample to the DeMarco-Kahn Upper Tail Conjecture. preprint
Upcoming and recent talks
  1. Limit Distribution of Clique Counts in Dense Inhomogeneous Graphs, 12th International Vilnius Conference on Probability Theory and Mathematical Statistics, Vilnius, Lithuania, 2-6 July 2018
  2. Embedding the Uniform Random Graph into the Bipartite Regular Random Graph, minisymposium Discrete Random Processes at 2018 SIAM Conference on Discrete Mathematics, University of Colorado, Denver, 4-8 June 2018
    Selected talks
    1. "Counterexamples to the Demarco-Kahn conjecture on the upper tail of subgraph counts", STAR Workshop in Random Graphs, Radboud University Nijmegen, The Netherlands, 12-13 April 2018, slides
    2. Limit distribution of clique counts in dense inhomogeneous graphs, Workshop Graph limits in Bohemian Switzerland, Czech Republic, 26-30 March 2018
    3. Small subgraph counts in random graphs: a survey, Georgia Tech Combinatorics Seminar, Atlanta, USA, 2017
    4. Embedding G(n,p) into the random regular graph, Atlanta Lecture Series, Georgia Tech, Atlanta, USA, 2017
    5. Embedding the Erd\H{o}s-R\'enyi graph into the random regular graph, Random Structures & Algorithms, Gniezno, Poland, 2017
    6. Embedding G(n,p) into the random regular graph, special session Graphs, Hypergraphs and Set Systems of the Meeting of the Catalan, Spanish, Swedish Math Societies, Umea university, Sweden, 2017
    7. Concentration of Extension Counts in G(n,p), SIAM Conference on Discrete Mathematics, Atlanta 2016
    8. Random graphs: sandwiching, subgraph counts, extension statements, Seminar of Discrete Mathematics and Optimization, Graz University of Technology, 2015
    9. Embedding the binomial random graph in the regular random graph, Random Structures & Algorithms, Pittsburgh, USA, 2015. Abstract
    10. Embedding the Binomial Hypergraph into the Random Regular Hypergraph, Combinatorial Theory seminar, University of Oxford, June 2015.
    11. Embedding the Erdos-Renyi random graph in the d-regular random graph, 11th International Vilnius Conference on Probability Theory and Mathematical StatisticsJuly 2014.
    12. Half-sandwich of random graphs, Scientific program Graphs, Hypergraphs and Computing, Institut Mittag-Leffler, Djursholm, May 2014.
    13. Regular Hypergraphs: Asymptotic Counting and Loose Hamilton Cycles, Eurocomb, Pisa, September 2013. SlideshowExtended Abstract
    14. On the upper tail of strictly balanced subgraph counts, Poznań-Berlin Seminar, Będlewo, June 2011. Slideshow
    15. The last two papers by V. Bentkus on inequalities for sums of independent random variables (with D. Dzindzalieta), 10th International Vilnius Conference on Probability Theory and Mathematical Statistics, July 2010. Program

    Mailing address:

    Department of Theoretical Computer Science
    Institute of Computer Science of the Czech Academy of Sciences

    Pod Vodárenskou věží 2
    182 07 Praha 8
    Czech Republic

    Email: matas.sileikis at