The following pages link to M. Şileikis (Q345118):
Displaying 23 items.
- Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity (Q345119) (← links)
- On the upper tail of counts of strictly balanced subgraphs (Q426748) (← links)
- On the intersections of non-homotopic loops (Q831716) (← links)
- On maximal tail probability of sums of nonnegative, independent and identically distributed random variables (Q1687185) (← links)
- Non-homotopic loops with a bounded number of pairwise intersections (Q2151444) (← links)
- A central limit theorem for almost local additive tree functionals (Q2292863) (← links)
- Upper tail bounds for stars (Q2309238) (← links)
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees (Q2363114) (← links)
- Approximate counting of regular hypergraphs (Q2445249) (← links)
- On measure concentration in graph products (Q2809697) (← links)
- Optimal probability inequalities for random walks related to problems in extremal combinatorics (Q2910952) (← links)
- (Q4632487) (← links)
- (Q4993555) (← links)
- A counterexample to the DeMarco‐Kahn upper tail conjecture (Q5216176) (← links)
- Loose Hamilton Cycles in Regular Hypergraphs (Q5364219) (← links)
- (Q5420010) (← links)
- Sandwiching biregular random graphs (Q5885183) (← links)
- Counting extensions revisited (Q6074702) (← links)
- A limit theorem for small cliques in inhomogeneous random graphs (Q6080866) (← links)
- Prominent examples of flip processes (Q6201039) (← links)
- Non-homotopic Loops with a Bounded Number of Pairwise Intersections (Q6376487) (← links)
- From flip processes to dynamical systems on graphons (Q6663958) (← links)
- On the upper tail of star counts in random graphs (Q6761232) (← links)
