#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2006

2018

- This year (1)
- Last 5 years (7)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis
- Inf. Process. Lett.
- 2013

In this paper we asymptotically count d-regular k-uniform hypergraphs on n vertices, provided k is fixed and d = d(n) = o(n). In doing so, we extend to hypergraphs a switching technique of McKay andâ€¦ (More)

- Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis
- Combinatorics, Probability & Computing
- 2015

We establish a relation between two uniform models of random k-graphs (for constant k â‰¥ 3) on n labeled vertices: H(k)(n,m), the random k-graph with exactly m edges, and H(k)(n, d), the randomâ€¦ (More)

- Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis
- J. Comb. Theory, Ser. B
- 2017

We establish an inclusion relation between two uniform models of random k-graphs (for constant k â‰¥ 2) on n labeled vertices: G(n,m), the random k-graph with m edges, and R(n, d), the random d-regularâ€¦ (More)

- Cecilia Holmgren, Svante Janson, Matas Sileikis
- Electr. J. Comb.
- 2017

We study fringe subtrees of random m-ary search trees and of preferential attachment trees, by putting them in the context of generalised PÃ³lya urns. In particular we show that for the random m-aryâ€¦ (More)

- D. Dzindzalieta, T. Juskevicius, Matas Sileikis
- SIAM J. Discrete Math.
- 2012

Let Sn = X 1 + Â· Â· Â· + Xn be a sum of independent symmetric random variables such that |X i | â‰¤ 1. Denote by Wn = Îµ 1 + Â· Â· Â· + Îµn a sum of independent random variables such that P {Îµ i = Â±1} = 1/2.â€¦ (More)

- Matas Sileikis
- Electr. J. Comb.
- 2012

Let XG be the number of copies of G in the Erd} os-R enyi binomial random graph G(n; p). Janson, Oleszkiewicz and Ruci nski proved that for every t > 1 expf Ot(M G ln(1=p))g P fXG tEXGg expf t(M G)g;â€¦ (More)

- Cecilia Holmgren, Svante Janson, Matas Sileikis, A BSTRACT
- 2016

We study fringe subtrees of the random m-ary search trees, by putting them in context of generalised PÃ³lya urns. In particular we show that for the random m-ary search trees with m â‰¤ 26, the numberâ€¦ (More)

In this thesis we develop a wrapper for scientific data stored in ROOT files using Amos II, a functional DBMS. ROOT is an object-oriented framework for representing high-energy physics data. Weâ€¦ (More)

An additive functional of a rooted tree is a functional that can be calculated recursively as the sum of the values of the functional over the branches, plus a certain toll function. Janson recentlyâ€¦ (More)

We present results from two papers by the authors on analysis of d-regular k-uniform hypergraphs, when k is fixed and the number n of vertices tends to infinity. The first result is approximateâ€¦ (More)

- â€¹
- 1
- â€º