Details

Lorentz Lattice Gases on Graphs

by Kreslavskiy, Dmitry Michael

Abstract (Summary)
The present work consists of three parts. In the first part (chapters III and IV), the dynamics of Lorentz lattice gases (LLG) on graphs is analyzed. We study the fixed scatterer model on finite graphs. A tight bound is established on the size of the orbit for arbitrary graphs, and the model is shown to perform a depth-first search on trees. Rigidity models on trees are also considered, and the size of the resulting orbit is established. In the second part (chapter V), we give a complete description of dynamics for LLG on the one-dimensional integer lattice, with a particular interest in showing that these models are not capable of universal computation. Some statistical properties of these models are also analyzed. In the third part (chapter VI) we attempt to partition a pool of workers into teams that will function as independent TSS lines. Such partitioning may be aimed to make sure that all groups work at approximately the same rate. Alternatively, we may seek to maximize the rate of convergence of the corresponding dynamical systems to their fixed points with optimal production at the fastest rate. The first problem is shown to be NP-hard. For the second problem, a solution for splitting into pairs is given, and it is also shown that this solution is not valid for partitioning into teams composed of more than two workers.
Bibliographical Information:

Advisor:Randall, Dana; Tetali, Prasad; Ciucu, Mihai; Morley, Thomas; Bunimovich, Leonid A.

School:Georgia Institute of Technology

School Location:USA - Georgia

Source Type:Master's Thesis

Keywords:algorithms combinatorics and optimization

ISBN:

Date of Publication:11/26/2003

© 2009 OpenThesis.org. All Rights Reserved.