Yiguang Zhang

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper introduces a notion of a random threshold directed graph, extending the work of Reilly and Scheinerman in the undirected case and closely related to random Ferrers digraphs. We begin by presenting the main definition: D is a threshold digraph provided we can find a pair of weighting functions f, g : V (D) → R such that for distinct v, w ∈ V (D)(More)
  • 1