Expected rank in antimatroids

@inproceedings{Gordon2002ExpectedRI,
  title={Expected rank in antimatroids},
  author={Gary Gordon},
  year={2002}
}
We consider a probabilistic antimatroid A on the ground set E, where each element e ∈ E may succeed with probability pe. We focus on the expected rank ER(A) of a subset of E as a polynomial in the pe. General formulas hold for arbitrary antimatroids, and simpler expressions are valid for certain well-studied classes, including trees, rooted trees, posets, and finite subsets of the plane. We connect the Tutte polynomial of an antimatroid to ER(A). When S is a finite subset of the plane with no… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Exact formulas for reliability measures for various classes of graphs

  • A. Amin, K. Siegrist, P. Slater
  • Cong. Numer. 58
  • 1987
Highly Influential
3 Excerpts

Pair-connected reliability of a tree and its distance degree sequences

  • A. Amin, K. Siegrist, P. Slater
  • Cong. Numer. 58
  • 1987
Highly Influential
3 Excerpts

The Combinatorics of Network Reliability

  • C. Colbourn
  • Oxford Univ. Press, Oxford
  • 1987
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…