Families of linear functionals on a vector space that are mapped to each other by a group of symmetries of the space have a significant amount of structure. This results in computational redundancies which can be used to make computing the entire family of functionals at once more efficient than applying each in turn. This thesis explores asymptotic complexity results for a few such families: contingency tables and unranked choice data. These are used to explore the framework of Radon transform diagrams, which promise to allow general theorems about linear summary statistics to be stated and proved.
| Identifer | oai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:hmc_theses-1106 |
| Date | 01 January 2017 |
| Creators | Pedrick, Micah G |
| Publisher | Scholarship @ Claremont |
| Source Sets | Claremont Colleges |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | HMC Senior Theses |
| Rights | © 2017 Micah G Pedrick, http://creativecommons.org/licenses/by-nc-sa/4.0/ |
Page generated in 0.0018 seconds