We investigate self-stabilizing rendezvous algorithms for two synchronous mobile agents. The rendezvous algorithms make two mobile agents meet at a single node, starting from arbitrary initial locations and arbitrary initial states. We study deterministic algorithms for two synchronous mobile agents with different labels but without using any whiteboard in the graph. First, we show the existenc...

We investigate a new property of computing systems called weak stabilization. Although this property is strictly weaker than the well-known property of stabilization, weak stabilization is superior to stabilization in several respects. In particular, adding delays to a system preserves the system property of weak stabilization, but does not necessarily preserve its stabilization property. Becau...

Despite the potential for rapid evolution, stasis is commonly observed over geological timescales-the so-called "paradox of stasis." This paradox would be resolved if stabilizing selection were common, but stabilizing selection is infrequently detected in natural populations. We hypothesize a simple solution to this apparent disconnect: stabilizing selection is hard to detect empirically once p...