U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Search Publications by: Brian D. Cloteaux (Fed)

Search Title, Abstract, Conference, Citation, Keyword or Author
Displaying 1 - 25 of 46

Graphic Approximation of Integer Sequences

November 25, 2024
Author(s)
Brian D. Cloteaux
A variety of network modeling problems begin by generating a degree sequence drawn from a given probability distribution. If the randomly generated sequence is not graphic, we give two new approaches for generating a graphic approximation of the sequence

Simulating Job Replication Versus its Energy Usage

December 10, 2023
Author(s)
Brian D. Cloteaux, Vladimir Marbukh
Due to the proliferation of computers in all aspects of our lives, the energy and ecological impacts of computing are becoming increasing important. Some of the transformative algorithms of recent years generate huge amounts of carbon dioxide, potentially

Impact of Using Soft Exposure Thresholds in Automatic Contact Tracing

December 21, 2022
Author(s)
Kamran Sayrafian, Brian D. Cloteaux, Vladimir Marbukh
Current automatic exposure notification apps primarily operate based on hard distance/time threshold guidelines (e.g., 2 m/15 min in the United States) to determine exposures due to close contacts. However, the possibility of virus transmission through

Forced Edges and Graph Structure

November 19, 2019
Author(s)
Brian D. Cloteaux
For a degree sequence, its set of forced edges are the edges that appear in every realization of that sequence, while its forbidden edges appear in no realization. We examine sequences with forced or forbidden edges, showing relationships between these

SIS Contagion Avoidance on a Network Growing by Preferential Attachment

June 30, 2019
Author(s)
Brian D. Cloteaux, Vladimir V. Marbukh
The economic and convenience benefits of interconnectivity drive the current explosive growth in networked systems. However, as recent catastrophic contagious failures in numerous large-scale networked infrastructures have demonstrated, interconnectivity

One-Pass Graphic Approximation of Integer Sequences

December 18, 2017
Author(s)
Brian D. Cloteaux
A variety of network modeling problems begin by generating a degree sequence drawn from a given probability distribution. If the randomly generated sequence is not graphic, we give a new approach for generating a graphic approximation of the sequence. This

Fast Sequential Creation of Random Realizations of Degree Sequences

March 24, 2016
Author(s)
Brian D. Cloteaux
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

Is This for Real?: Fast Graphicality Testing

November 1, 2015
Author(s)
Brian D. Cloteaux
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 (because this

Limits in Modeling Power Grid Topology

April 29, 2013
Author(s)
Brian D. Cloteaux
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 by

Threshold Digraphs

December 5, 2012
Author(s)
Brian D. Cloteaux, Michael D. LaMar, Elizabeth R. Moseman, James Shook
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 allows for a

Counting the Leaves of Trees

December 19, 2011
Author(s)
Brian D. Cloteaux, Luis A. Valentin
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 algorithm