#### Filter Results:

#### Publication Year

2001

2009

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Graphical Markov models determined by acyclic digraphs (ADGs), also called directed acyclic graphs (DAOs), are widely studied in statistics, computer science (as Bayesian networks), operations research (as influence diagrams), and many related fields. Because different ADOs may determine the same Markov equivalence class, it long has been of interest to… (More)

Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and efficient for representing complex multivariate dependence structures in terms of local relations. However, model search and selection is potentially complicated by the many-to-one… (More)

Isogonal polyhedra are those polyhedra having the property of being vertex-transitive. By this we mean that every vertex can be mapped to any other vertex via a symmetry of the whole polyhedron; in a sense, every vertex looks exactly like any other. The Platonic solids are examples, but these are bounded polyhedra and our focus here is on infinite… (More)

- ‹
- 1
- ›