Markov chains and sequential importance sampling (SIS) are described as two leading sampling methods for Monte Carlo computations in exact conditional inference on discrete data in contingencyâ€¦ (More)

We present algebraic methods for studying connectivity of Markov moves with margin positivity. The purpose is to develop Markov sampling methods for exact conditional inference in statistical modelsâ€¦ (More)

This paper presents a method for using end-to-end available bandwidth measurements in order to estimate available bandwidth on individual internal links. The basic approach is to use a powerâ€¦ (More)

Parametric models for estimating network link delays with incomplete data that incorporate spatial correlation are formulated. Fast numerical methods for estimation of parameters and confidenceâ€¦ (More)

This paper relates computational commutative algebra to tree classification with binary covariates. With a single classification variable, properties of uniqueness of a tree polynomial areâ€¦ (More)

We consider Boolean dynamics for biological networks where stochasticity is introduced through asynchronous updates. An exact method is given for finding states which can reach a steady state withâ€¦ (More)

We describe methods to identify cylinder sets inside a basin of attraction for Boolean dynamics of biological networks. Such sets are used for designing regulatory interventions that make the systemâ€¦ (More)

An iterative method is given for computing the polynomials tha t vanish on the basin of attraction of a steady state in discrete polynomi al dynamics with finite field coefficients. The algorithm isâ€¦ (More)