Various graph algorithms have been developed with multiple random walks, the movement of several independent walkers on a graph. Designing an efficient algorithm based walks requires investigating theoretically to attain deep understanding their characteristics. The first meeting time is one important metrics for walks. defined by it takes meet at same node in This closely related rendezvous pr...