Abstract A Coalescing-Branching Random Walk (CoBra) is a natural extension to the
standard random walk on a graph. The process starts with one pebble at an arbitrary node …

Detecting the source of a gossip is a critical issue, related to identifying patient zero in an
epidemic, or the origin of a rumor in a social network. Although it is widely acknowledged …

Coalescing-branching random walks, or cobra walks for short, are a natural variant of
random walks on graphs that can model the spread of disease through contacts or the …

Information propagation on graphs is a fundamental topic in distributed computing. One of
the simplest models of information propagation is the push protocol in which at each round …

Various graph algorithms have been developed with multiple random walks, the movement
of several independent random walkers on a graph. Designing an efficient graph algorithm …

In this article, we consider a branching random walk on the real-line where displacements
coming from the same parent have jointly regularly varying tails. The genealogical structure …

We present improved bounds on the cover time of the coalescing-branching random walk
process COBRA. The COBRA process, introduced in Dutta et al., SPAA 2013, can be viewed …

Several popular problems in information networking and social networking such as search,
distribution, and dissemination can be modeled by random walk of single or multiple agents …

This dissertation is an exploration of phase transition behavior and clustering of populations
of organisms in an agent-based model of evolutionary dynamics. The agents in the model …

In this work, a two dimensional (2D) wavelength/time code is developed. The 64 bit 2D code
is constructed by a technique based on folding of Golomb rulers referred in this work as …