Matas Sileikis

Orcid: 0000-0002-6353-9105

According to our database1, Matas Sileikis authored at least 15 papers between 2012 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Sandwiching biregular random graphs.
Comb. Probab. Comput., January, 2023

2022
Counting extensions revisited.
Random Struct. Algorithms, 2022

2021
A limit theorem for small cliques in inhomogeneous random graphs.
J. Graph Theory, 2021

Non-homotopic Loops with a Bounded Number of Pairwise Intersections.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

On the Intersections of Non-homotopic Loops.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
Upper Tail Bounds for Stars.
Electron. J. Comb., 2020

A Central Limit Theorem for Almost Local Additive Tree Functionals.
Algorithmica, 2020

2019
A counterexample to the DeMarco-Kahn upper tail conjecture.
Random Struct. Algorithms, 2019

2018
Asymptotic Normality of Almost Local Functionals in Conditioned Galton-Watson Trees.
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity.
J. Comb. Theory, Ser. B, 2017

Multivariate Normal Limit Laws for the Numbers of Fringe Subtrees in m-ary Search Trees and Preferential Attachment Trees.
Electron. J. Comb., 2017

2015
Loose Hamilton Cycles in Regular Hypergraphs.
Comb. Probab. Comput., 2015

2013
Approximate counting of regular hypergraphs.
Inf. Process. Lett., 2013

2012
Optimal Probability Inequalities for Random Walks Related to Problems in Extremal Combinatorics.
SIAM J. Discret. Math., 2012

On the Upper Tail of Counts of Strictly Balanced Subgraphs.
Electron. J. Comb., 2012


  Loading...