Birth-death processes on trees

In this paper, we consider birth-death processes on a tree T and we are interested when it is regular, recurrent and ergodic (strongly, exponentially). By constructing two corresponding birth death processes on ?₊, we obtain computable conditions sufficient or necessary for that (in many cases, these two conditions coincide). With the help of these constructions, we give explicit upper and lower bounds for the Dirichlet eigenvalue λ ₀. At last, some examples are investigated to justify our results.