Results 51 to 60 of about 94 (91)
Solving the migration-recombination equation from a genealogical point of view. [PDF]
J Math Biol, 2021 Alberti F +3 more
europepmc +1 more source
Towards a Theory of Negative Dependence
, 1999 : The FKG theorem says that the POSITIVE LATTICE CONDITION, an easily checkable hypothesis which holds for many natural families of events, implies POSITIVE ASSOCIATION, a very useful property.
Robin Pemantle
core
Hydrodynamic Scaling, Convex Duality, and Asymptotic Shapes of Growth Models
, 1996 . We present a technique for simultaneously deriving two related results: Hydrodynamic scaling limits for one-dimensional asymmetric particle systems and asymptotic shapes for growth models.
Timo Seppäläinen
core
Monotonic Subsequences in Dimensions Higher Than One
, 1996 The 1935 result of Erdos and Szekeres that any sequence of n 2 +1 real numbers contains a monotonic subsequence of n + 1 terms has stimulated extensive further research, including a paper of J. B. Kruskal that defined an extension of monotonicity for
A. M. Odlyzko, J. B. Shearer, R. Siders
core
Technical Report: A solution of Sylvester-like problems for convex quadrilaterals
, 2008 The probability pn that n points, uniformly and independently distributed within a con-vex planar body K, have a triangular convex hull is known (at least for some values of n> = 3) when K is either a triangle, an ellipse, a parallelogram or a regular
core
Staircase patterns in words: subsequences, subwords, and separation number. [PDF]
Eur J Comb, 2020 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Inhomogeneous Continuum Random Trees and the Entrance Boundary of the Additive Coalescent
, 1998 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
Intersections of Randomly Embedded Sparse Graphs are Poisson
, 1999 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
Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations. [PDF]
SIAM J Discret Math, 2020 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Limit theorem for the Robin Hood game. [PDF]
Stat Probab Lett, 2019 Angel O, Matzavinos A, Roitershtein A.
europepmc +1 more source