3 citations · 3 across the 2 of their papers we have counts for
4 papers
Graph search via star sampling with and without replacement
Jonathan Stokes, Steven Weber
Star sampling (SS) is a random sampling procedure on a graph wherein each sample consists of a randomly selected vertex (the star center) and its (one-hop) neighbors (the star poin…
Star sampling with and without replacement
Jonathan Stokes, Steven Weber
Star sampling (SS) is a random sampling procedure on a graph wherein each sample consists of a randomly selected vertex (the star center) and its one-hop neighbors (the star endpoi…
Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree
Jonathan Stokes, Steven Weber
We examine two greedy heuristics - wiring and rewiring - for constructing maximum assortative graphs over all simple connected graphs with a target degree sequence. Counterexamples…
A Markov chain model for the search time for max degree nodes in a graph using a biased random walk
Jonathan Stokes, Steven Weber
We consider the problem of estimating the expected time to find a maximum degree node on a graph using a (parameterized) biased random walk. For assortative graphs the positive deg…