2000 character limit reached
A combinatorial identity on Galton-Watson process
Published 28 Jun 2015 in math.CO | (1506.08382v1)
Abstract: Let $f(m,c)=\sum_{k=0}{\infty} (km+1){k-1} ck e{-c(km+1)/m} / (mkk!)$. For any positive integer $m$ and positive real $c$, the identity $f(m,c)=f(1,c){1/m}$ arises in the random graph theory. In this paper, we present two elementary proofs of this identity: a pure combinatorial proof and a power-serial proof. We also proved that this identity holds for any positive reals $m$ and $c$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.