Skip to content
Quantoros

A random walk chooses a uniformly random neighbor in a connected undirected graph. Is a randomly observed vertex…

Quant ResearchLevel: AdvancedSampling bias on a graph

A random walk chooses a uniformly random neighbor in a connected undirected graph. Is a randomly observed vertex uniform? Give the stationary law and the star-graph example.

Hints
  • Check detailed balance along one edge.
  • The center has n times a leaf degree.

Answer

This answer is part of mentoring

Advanced questions come with a full breakdown and a mock interview with a working quant researcher. The first call is free.

Source and licence: Lehman, Leighton & Meyer — Mathematics for Computer Science (2018-06-06) · CC-BY-SA-3.0 · answer: Quantoros editorial

Related questions