pith. sign in

arxiv: 1506.08382 · v1 · pith:RJDNGSNCnew · submitted 2015-06-28 · 🧮 math.CO

A combinatorial identity on Galton-Watson process

classification 🧮 math.CO
keywords identitypositivecombinatorialproofariseselementarygalton-watsongraph
0
0 comments X
read the original abstract

Let $f(m,c)=\sum_{k=0}^{\infty} (km+1)^{k-1} c^k e^{-c(km+1)/m} / (m^kk!)$. 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$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.