Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion
, 1999 An asymptotic estimate is given for the coefficients of products of large powers of generating functions. This theorem and another local limit theorem which is useful for conditioning are applied to various combinatorial enumeration problems that involve
Edward A. Bender, L. Bruce Richmond
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
Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes. [PDF]
J Math Biol, 2021 Gross E +5 more
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
An efficient characterization of submodular spanning tree games. [PDF]
Math Program, 2020 Koh ZK, Sanità L.
europepmc +1 more source
A Greedy Algorithm Estimating The Height Of Random Trees
, 2007 . The behaviour of a greedy algorithm which estimates the height of a random labelled rooted tree is studied. A self-similarity argument is used to characterize the limit distribution of the length H of the path found by such an algorithm in a random ...
Tomasz Luczaky
core
The rigid hybrid number for two phylogenetic trees. [PDF]
J Math Biol, 2021 Huber KT, Linz S, Moulton V.
europepmc +1 more source
Some Results on the Structure of Multipoles in the Study of Snarks ∗
, 2014 AMS classification: 05C15, 05C05, 05C38. Multipoles are the pieces we obtain by cutting some edges of a cubic graph. As a result of the cut, a multipole M has dangling edges with one free end, which we call semiedges.
J. Vilaltella, M. A. Fiol
core
Symplectic Runge-Kutta Schemes II: Classification Of Symmetric Methods
. A complete classification of all symplectic self-adjoint Runge-Kutta methods with up to 6 stages is given and the derivation process used is outlined.
M. Sofroniou, W. Oevel
core
Mathematisches Forschungsinstitut Oberwolfach Report No. 52/2006 Mini-Workshop:
, 2006 . This is a collection of extended abstracts of a mini-workshop “Logic, Combinatorics and Independence results ” that took place on November 25 – December 2, 2006 in Oberwolfach.
Andrey Bovykin (liverpool +2 more
core