Probability on Graphs and Semigroups

Abstract Reliability Theory

Contents

Ancillary Material

General Theory

  1. Graphs
    1. Basics
    2. Partial Order Graphs
    3. Probability on Graphs
    4. Random Walks
    5. Constant Rate Distributions
    6. Reflexive Closure
    7. Induced Graphs
    8. Graph Products
    9. Lexicographic Sums
    10. Endpoint Addition
  2. Semigroups
    1. Basics
    2. Positive Semigroups
    3. Invariant Measures
    4. Probability on Semigroups
    5. Memoryless and Exponential Distributions
    6. Conditional Distributions
    7. Semigroup Products
    8. Semigroup Quotients

Examples and Applications

  1. Standard Continuous Spaces
    1. The Standard Space
    2. Isomorphic Spaces
    3. Relative Aging
    4. Marshall-Olkin Distributions
    5. A Class of Bivariate Distributions
    6. Norm Graphs
    7. Matrix Semigroups
  2. Standard Discrete Spaces
    1. The Stanadard Space
    2. Variations
    3. Sub-Semigroups
    4. Induced Spaces
    5. A Lexicographic Sum
  3. Rooted Trees and Related Spaces
    1. Rooted Trees
    2. Free Semigroups
    3. Probability on Rooted Trees
    4. Probability on Free Semigroups
    5. Downward Run Graphs
    6. Upward Run Graphs
  4. Arithmetic Semigroups
    1. Semigroups
    2. Probability
  5. Paths and Related Graphs
    1. Polynomials
    2. The Infinite Path
    3. Finite Paths
    4. Related Graphs
  6. The Subset Semigroup
    1. Graphs
    2. Semigroups
    3. Exponential Distributions
    4. Almost Exponential Distributions
    5. Constant Rate Distributions
    6. Characterizations of the Poisson Distribution

Overview

The purpose of this text is to study abstract settings that generalize many of the basic concepts in classical reliability theory. Generalized graphs (consisting of a set and a binary relation) are the natural home for generalizations of the reliability function, failure rate function, and particularly constant rate distributions. Certain semigroups are the natural home for generalizations of the memoryless and exponential distributions. The two algebraic structures are closely related since there is a natural graph associated with a semigroup. Please read the Preface for mathematical prerequisites, notational conventions, and some basic assumptions, and read the Introduction for a review of the classical theory that motivates this work.

The text is divided into two basic parts. The first part gives the basic definitions and properties of the two fundamental structures, graphs and semigroups, basic probability and random walks on the two structures, and exponential, memoryless, and constant rate distributions. Part I also gives some basic constructions for creating new graphs and semigroups from existing ones. These include various product structures, a quotient structure, and graphs partitioned by an underlying graph. The second part studies a number of applications and examples in detail. The applications include the standard discrete and continuous spaces, rooted trees, free semigroups on countable alphabets, arithmetic semigroups including the positive integers under mulitplication, and semigroup and graph structures on finite subsets of positive integers.

Browser Requirements

This site uses a number of open and standard technologies, including HTML5, CSS, and JavaScript. To use this project properly, you will need a modern browser that supports these technologies. Display of mathematical notation is handled by the wonderful MathJax project.

Rights and Permissions

This work is licensed under a Creative Commons License. Basically, you are free to copy, distribute, and display this work, to make derivative works. However please give proper attribution and provide a link to the home site: http://www.randomservices.org/Reliability/. Click on the Creative Commons link above for more information.

Author

Kyle Siegrist
Department of Mathematical Sciences
University of Alabama in Huntsville
kyle@randomservices.org