Split Digraphs and Their Applications

I will first present a generalization of split graphs to the directed case and show how these split digraphs can be identified solely by their degree sequences. I will then show how their structure appears in the uniform sampling of directed graphs from a fixed degree sequence, and conclude with a discussion of threshold digraphs and their relation to split digraphs via a partial ordering on the space of directed degree sequences.

Speaker Bio: M. Drew LaMar is an Assistant Professor in the Department of Biology at the The College of William and Mary. He holds a PhD degree in Mathematics from The University of Texas at Austin. His research interests are in mathematical biology, scientific computation, dynamical systems, stochastic processes and graph theory, with an emphasis in coupled oscillators, complex networks, directed graphs, Markov chains, neurobiology, cellular physiology and ecology. His email address is mdlama@wm.edu.

Presentation Slides: PDF

Note: Visitors from outside NIST must contact Cathy Graham; (301) 975-3668; at least 24 hours in advance.