We study the branching random walk on weighted graphs; site-breeding and
edge-breeding branching random walks on graphs are seen as particular cases. We
describe the strong critical value in terms of a geometrical parameter of the
graph. We characterize the weak critical value and relate it to another
geometrical parameter. We prove that, at the strong critical value, the process
dies out locally almost surely; while, at the weak critical value, global
survival and global extinction are both possible.Comment: 14 pages, corrected some typos and minor mistake