#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1986

2016

- This year (0)
- Last 5 years (1)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kyle Siegrist
- IEEE Trans. Software Eng.
- 1988

- Kyle Siegrist
- IEEE Trans. Software Eng.
- 1988

- Kyle Siegrist, Ashok T. Amin, Peter J. Slater
- Discrete Applied Mathematics
- 1993

- Kyle Siegrist
- Combinatorics, Probability & Computing
- 1998

The strategy of bold play in the game of red and black leads to a number of interesting mathematical properties: the player’s fortune follows a deterministic map, before the transition that ends the game; the bold strategy can be “re-scaled” to produce new strategies with the same win probability; the win probability is a continuous function of the initial… (More)

- Ashok T. Amin, Kyle Siegrist, Peter J. Slater
- Networks
- 1991

- Ashok T. Amin, Kyle Siegrist, Peter J. Slater
- Networks
- 1993

Let G be a probabilistic (n,m) graph in which each vertex exists independently with fixed probability p , 0 < p < 1. Pair-connected reliability of G, denoted PC,(G;p), is the expected number of connected pairs of vertices in G. An (n.m) graph G is uniformly optimally reliable i f PC,(G;p) 2 PC,(H;p) for all p, 0 < p < 1, over all (n,m) graphs H. It is shown… (More)

- Kyle Siegrist
- Random Struct. Algorithms
- 2003

Let G (V, ) be a partially ordered set such that V is countable, there exists a minimum element a V, and {u V : u v} is finite for each v V. Suppose that {Xv : v a} is a collection of independent, identically distributed, nonnegative random variables. We think of Xv as the time required to perform a job associated with v, but the job at v cannot begin until… (More)

- Kyle Siegrist
- 2008

We consider Markov chains on partially ordered sets that generalize the success-runs and remaining life chains in reliability theory. We find conditions for recurrence and transience and give simple expressions for the invariant distributions. We study a number of special cases, including rooted trees, uniform posets, and posets associated with positive… (More)

- Kyle Siegrist
- 2000