Analysis of Random Processes via And-Or Tree Evaluation
| Title | Analysis of Random Processes via And-Or Tree Evaluation |
| Publication Type | Technical Report |
| Year of Publication | 1997 |
| Authors | Luby, M., Mitzenmacher M., & M. Shokrollahi A. |
| Other Numbers | 1106 |
| Abstract | We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework for carrying out the analysis of several previously studied random processes. including random loss-resilient codes, solving random k-SAT formulae using the pure literal rule, the greedy algorithm for matchings in random graphs. In addition, these tools allow generalizations of these problems not previously analyzed to be analyzed in a straightforward manner. We illustrate our methodology on the three problems listed above. |
| URL | http://www.icsi.berkeley.edu/ftp/global/pub/techreports/1997/tr-97-042.pdf |
| Bibliographic Notes | ICSI Technical Report TR-97-042 |
| Abbreviated Authors | M. G. Luby, M. Mitzenmacher, and M. A. Shokrollahi |
| ICSI Publication Type | Technical Report |