2 problems

Let $G$ be a vertex-transitive graph with stationary distribution $\pi$. For $k\;\geqslant\;2$, let $\mathrm{SC}(G,k)$ be the social connectivity time when $k$ walkers independentl…

Let $G$ be a connected graph with $n$ vertices and average degree $d$. Let $\mathrm{SC}(G)$ denote its social connectivity time. General graph conjecture. There exists a universal…