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:

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

Permanents, alpha-permanents and Sinkhorn balancing

June 28, 2014
Author(s)
F Sullivan, Isabel M. Beichl
The method of Sinkhorn balancing that starts with a non-negative square matrix and iterates to produce a related doubly stochastic matrix has been used with some success to estimate the values of the permanent in some cases of physical interest, However it

A Binomial Approximation Method for the Ising Model

May 21, 2014
Author(s)
Isabel M. Beichl, Amanda A. Streib, Noah S. Streib, Francis Sullivan
A large portion of the complexity inherent to the Ising model can be captures with a trivial amount of computation. in this work, we support this claim by defining an approximation to the partition function and other thermodynamic quantities of the Ising

Stratified Sampling for the Ising Model: A Graph-Theoretic Approach

June 19, 2013
Author(s)
Amanda A. Streib, Noah S. Streib, Isabel M. Beichl, Francis Sullivan
We present a new approach to a classical problem in statistical physics: estimating the partition function and other thermodynamic quantities of the ferromagnetic Ising model. Markov chain Monte Carlo methods for this problem have been well-studied

Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial

November 8, 2012
Author(s)
David G. Harris, Francis Sullivan, Isabel M. Beichl
The reliability polynomial of a graph measures the number of its connected subgraphs of various sizes. Algortihms based on sequential importance sampling (SIS) have been proposed to estimate a graph's reliahbility polynomial. We develop an improved SIS

Linear Algebra and Sequential Importance Ssampling for Network Reliability

December 11, 2011
Author(s)
David G. Harris, Francis Sullivan, Isabel M. Beichl
The reliability polynomial of a graph gives the probability that a graph is connected as a function of the probability that each edge is connected. The coefficients of the reliability polynomial count the number of connected subgraphs of various sizes

Computing Network Reliability Coefficients

December 1, 2011
Author(s)
Elizabeth R. Moseman, Isabel M. Beichl, Francis Sullivan
When a network is modeled by a graph and edges of the graph remain reliable with a given probability p, the probability of the graph remaining connected is called the reliability of the network. One form of the reliability polynomial has as coefficients

"Just Try"

November 1, 2011
Author(s)
Isabel M. Beichl

Just Try

November 1, 2011
Author(s)
Isabel M. Beichl

Changes

January 3, 2011
Author(s)
Isabel M. Beichl

Dystopia

November 1, 2010
Author(s)
Isabel M. Beichl
This is an editorial for Computing in Science & Engineering on the subject of undergraduate education.

An Approximation Algorithm for the Coefficients of the Reliability Polynomial

March 15, 2010
Author(s)
Brian D. Cloteaux, Isabel M. Beichl, F Sullivan
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 randomized

Ephemera

January 11, 2010
Author(s)
Isabel M. Beichl
An editorial on the growing importance of soft errors in software.

A Structural Approach to the Temporal Modeling of Networks

December 14, 2009
Author(s)
Brian D. Cloteaux, Isabel M. Beichl
Simulation of many dynamic real world systems such as the Internet and social networks requires developing dynamic models for the underlying networks in these systems. Currently, there is a large body of work devoted towards determining the underlying

Cut it out!

May 1, 2009
Author(s)
Isabel M. Beichl, Francis Sullivan
This is a tutorial article on a probabilistic method for finding minimum cut sets of a connected graph.