We consider a random walker on a d-regular graph. Starting from a fixed vertex, the first step is a unit step in any one of the d directions, with common probability 1/d for each one. At any later ...

This is a preview. Log in through your library . Abstract Let $[X_n, n \geq 0]$ be a Markov chain on a general state space X with transition probability P and stationary probability π. Suppose an ...

Juggling competing demands in a network of feverishly calculating computers drawing on the same memory resources is like trying to avert collisions among blindfolded, randomly zigzagging ice skaters.

This paper presents a novel multi-label and interactive image segmentation algorithm that draws analogies to electric network circuits solutions from electrical engineering. Treating the image as a ...

On February 6th, 2018 SpaceX launched a Tesla Roadster on a Mars crossing orbit. We perform N-body simulations to determine the fate of the object over the next several million years, under the ...