Intersections of Randomly Embedded Sparse Graphs are Poisson [PDF]
Suppose that t 2 is an integer, and randomly label t graphs with the integers 1 : : : n. We give sufficient conditions for the number of edges common to all t of the labelings to be asymptotically Poisson as n ! 1. We show by example that our theorem is,
Edward A. Bender, E. Rodney Canfield
core
Inhomogeneous Continuum Random Trees and the Entrance Boundary of the Additive Coalescent [PDF]
Regard an element of the set of ranked discrete distributions \Delta := f(x 1 ; x 2 ; : : :) : x 1 x 2 : : : 0; P i x i = 1g as a fragmentation of unit mass into clusters of masses x i .
Jim Pitman, David Aldous
core
Some bounds on the coupon collector problem with universal coupon
We consider a generalization of the coupon collector problem with unequal probabilities, such that there are two additional coupons in the coupon set: one that speeds up the coupon collection process, and the one that slows it down.
Jocković Jelena, Todić Bojana
doaj +1 more source
Accessibility percolation on Cartesian power graphs. [PDF]
Schmiegelt B, Krug J.
europepmc +1 more source
Solving the migration-recombination equation from a genealogical point of view. [PDF]
Alberti F +3 more
europepmc +1 more source
Staircase patterns in words: subsequences, subwords, and separation number. [PDF]
Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations. [PDF]
Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Limit theorem for the Robin Hood game. [PDF]
Angel O, Matzavinos A, Roitershtein A.
europepmc +1 more source
Compositions of n as alternating sequences of weakly increasing and strictly decreasing partitions
Blecher Aubrey +2 more
doaj +1 more source
On ballistic deposition process on a strip. [PDF]
Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source

