7 citations · 8 across the 2 of their papers we have counts for
7 papers
Algorithm and Complexity for a Network Assortativity Measure
Sarah J. Kunkler, M. Drew LaMar, Rex K. Kincaid +1
We show that finding a graph realization with the minimum Randić index for a given degree sequence is solvable in polynomial time by formulating the problem as a minimum weight per…
Threshold Digraphs
Brian Cloteaux, M. Drew LaMar, Elizabeth Moseman +1
A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degr…
Split digraphs
M. Drew LaMar
We generalize the class of split graphs to the directed case and show that these split digraphs can be identified from their degree sequences. The first degree sequence characteriz…
On uniform sampling simple directed graph realizations of degree sequences
M. Drew Lamar
Choosing a uniformly sampled simple directed graph realization of a degree sequence has many applications, in particular in social networks where self-loops are commonly not allowe…
Algorithms for realizing degree sequences of directed graphs
M. Drew LaMar
The Havel-Hakimi algorithm for constructing realizations of degree sequences for undirected graphs has been used extensively in the literature. A result by Kleitman and Wang extend…
Signal processing of acoustic signals in the time domain with an active nonlinear nonlocal cochlear model
M. Drew LaMar, J. Xin, Y. Qi
A two space dimensional active nonlinear nonlocal cochlear model is formulated in the time domain to capture nonlinear hearing effects such as compression, multi-tone suppression a…