A combinatorial identity on Galton-Watson process

preprint2015arXivOpen access

Abstract

Let f(m,c)=∑k=0∞(km+1)k−1cke−c(km+1)/m/(mkk!)f(m,c)=\sum_{k=0}^{\infty} (km+1)^{k-1} c^k e^{-c(km+1)/m} / (m^kk!). For any positive integer mm and positive real cc, the identity f(m,c)=f(1,c)1/mf(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 mm and cc.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.