Using intersection matrices to identify graphical structure

Authors:
James E. Stafford
Affiliations:
Department of Public Health Sciences, University of Toronto, McMurrich Building, Toronto, ON M5S 1A8, Canada. stafford@ustat.utoronto.edu
Venue:
Statistics and Computing
Year:
2001

Citing 4
Cited 1

The Mathematica book (3rd ed.)

The Mathematica book (3rd ed.)
Symbolic operators for multiple sums

Computational Statistics & Data Analysis
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Iterated full partitions

Statistics and Computing

Computer algebra in the life sciences

ACM SIGSAM Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

Intersection matrices help identify the common graphical structure of two or more objects. They arise naturally in a variety of settings. Several examples of their use in a computer algebra environment are given. These include: simplifying an expression involving array products, automating cumulant calculations, determining the behaviour of an expected value operator and identifying model hierarchy in a factorial experiment. The emphasis is placed on the graphical structure, and the symmetry of arrays help reduce the complexity of the graphical problem.