435 citations · 2.1k across the 33 of their papers we have counts for
35 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…
Efficiency and detectability of random reactive jamming in carrier sense wireless networks
Ni An, Steven Weber
A natural basis for the detection of a wireless random reactive jammer (RRJ) is the perceived violation by the detector (typically located at the access point (AP)) of the carrier…
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…
On Multi-source Networks: Enumeration, Rate Region Computation, and Hierarchy
Congduan Li, Steven Weber, John MacLaren Walsh
Recent algorithmic developments have enabled computers to automatically determine and prove the capacity regions of small hypergraph networks under network coding. A structural the…
On protocol and physical interference models in Poisson wireless networks
Jeffrey Wildman, Steven Weber
This paper analyzes the connection between the protocol and physical interference models in the setting of Poisson wireless networks. A transmission is successful under the protoco…