Some Matrix Occupancy Problems with Dichotomous Entries.
Abstract
An R X N matrix is generated in the following way. In each row a predetermined number of positions are randomly assigned the value 1; the remaining positions are assigned the value 0. For each column a real valued function of the elements is given. In this paper the sum of the values of these functions is studied when N approaches the limit of infinity. The results can be applied to e.g. committee problems and contingency tables of 0-1-variables. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1976
- Accession Number
- ADA031933
Entities
People
- Lars Holst
Organizations
- University of Wisconsin–Madison