Mixing time bounds for graphlet random walks
M Agostini, M Bressan, S Haddadan - Information Processing Letters, 2019 - Elsevier
A popular technique to sample fixed-size connected induced subgraphs of a graph, also
known as graphlets, is based on running a certain random walk designed over the space of
all graphlets in the graph. This technique requires knowledge of the mixing time of the walk
but, unfortunately, no satisfying bounds are known. In this paper we provide upper and lower
bounds on such a mixing time, showing how it is intimately tied to the mixing time of the
original graph, and to its maximum and minimum degree.
known as graphlets, is based on running a certain random walk designed over the space of
all graphlets in the graph. This technique requires knowledge of the mixing time of the walk
but, unfortunately, no satisfying bounds are known. In this paper we provide upper and lower
bounds on such a mixing time, showing how it is intimately tied to the mixing time of the
original graph, and to its maximum and minimum degree.
以上显示的是最相近的搜索结果。 查看全部搜索结果