Random Motion on Simple Graphs

Consider a stochastic process that lives on n-semiaxes joined at the origin. On each ray it behaves as one dimensional Brownian Motion and at the origin it chooses a ray uniformly at random (Kirchhoff condition). The principal results are the computation of the exit probabilities and certain other probabilistic quantities regarding exit and occupation times.