A combinatorial identity on Galton-Watson process

Abstract

Let f(m,c)=Σk=0∞ (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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…