Take a sneak peek at the new NIST.gov and let us know what you think!
(Please note: some content may not be complete on the beta site.).

View the beta site
NIST logo

Publications Portal

You searched on: Author: brian cloteaux Sorted by: date

Displaying records 1 to 10 of 15 records.
Resort by: Date / Title

1. Fast Sequential Creation of Random Realizations of Degree Sequences
Published: 3/24/2016
Author: Brian Dale Cloteaux
Abstract: We examine the problem of creating a random realizations of very large degree sequences. While fast in practice, the Markov chain Monte Carlo (MCMC) method for selecting a realization has limited usefulness for creating large graphs because of memory ...

2. Is This for Real?: Fast Graphicality Testing
Published: 11/1/2015
Author: Brian Dale Cloteaux
Abstract: When we have an integer sequence that can be realized as the degree sequence of some graph, we say that the sequence is graphic. While almost any graph theory book describes how a sequence can be tested to see if it‰s graphic, surprisingly (becaus ...

3. Limits in Modeling Power Grid Topology
Published: 4/29/2013
Author: Brian Dale Cloteaux
Abstract: Because of their importance to infrastructure, a number of studies have examined the structural properties of power grids and have proposed random topological models of them. We examine the ability to create generalized models of power grid structure ...

4. Threshold Digraphs
Published: 12/5/2012
Authors: Brian Dale Cloteaux, Michael Drew LaMar, Elizabeth R. Moseman, James Shook
Abstract: A digraph whose degree sequences have a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and show them to be equivalent. One of the characterizations is new, and allow ...

5. Counting the Leaves of Trees
Published: 12/19/2011
Authors: Brian Dale Cloteaux, Luis A. Valentin
Abstract: A number of important combinatorial counting problems can be reformulated into the problem of counting the number of leaf nodes on a tree. Since the basic leaf-counting problem is #P-complete, there is strong evidence that no polynomial time algorith ...

6. Extracting Hierarchies With Overlapping Structure From Network Data
Published: 12/11/2011
Author: Brian Dale Cloteaux
Abstract: Relationships between entities in many complex systems, such as the Internet and social networks, have a natural hierarchical organization. Understanding these inherent hierarchies is essential for creating models of these systems. Thus, there is a r ...

7. Approximating the Number of Bases for Almost All Matroids
Published: 2/1/2011
Author: Brian Dale Cloteaux
Abstract: We define a class of matroids A for which a fully polynomial randomized approximation scheme (fpras) exists for counting the number of bases of the matroids. We then show that as the number of elements in a matroid increases, the probability that a m ...

8. Modeling Affiliations in Networks
Published: 12/6/2010
Author: Brian Dale Cloteaux
Abstract: One way to help understand the structure of certain networks is to examine what common group memberships the actors in the network share. Linking actors to their common affiliations gives an alternative type of network commonly called an affiliation ...

9. Matching Observed Alpha Helix Lengths to Predicted Secondary Structure
Published: 10/11/2010
Author: Brian Dale Cloteaux
Abstract: Because of the complexity in determining the 3D structure of a protein, the use of partial information determined from experimental techniques can greatly reduce the overall computational expense. We investigate the problem of matching experimentally ...

10. An Approximation Algorithm for the Coefficients of the Reliability Polynomial
Published: 3/15/2010
Authors: Brian Dale Cloteaux, Isabel M Beichl, F Sullivan
Abstract: The reliability polynomial gives the probability that a graph remains connected given that each edge in it can fail independently with a probability p. While in general determining the coefficients of this polynomial is #P-complete, we give a randomi ...

Search NIST-wide:

(Search abstract and keywords)

Last Name:
First Name:

Special Publications:

Looking for a NIST Special Publication (NIST SP Series)? Place the series number and dash in the report number field (Example: 800-) and begin your search.

  • SP 250-XX: Calibration Services
  • SP 260-XX: Standard Reference Materials
  • SP 300-XX: Precision Measurement and Calibration
  • SP 400-XX: Semiconductor Measurement Technology
  • SP 480-XX: Law Enforcement Technology
  • SP 500-XX: Computer Systems Technology
  • SP 700-XX: Industrial Measurement Series
  • SP 800-XX: Computer Security Series
  • SP 823-XX: Integrated Services Digital Network Series