DISCRETE INVERSE CONDUCTIVITY PROBLEMS ON NETWORKS
| dc.contributor.advisor | BERENSTEIN, CARLOS A | en_US |
| dc.contributor.author | Foroozan, Farshad | en_US |
| dc.contributor.department | Applied Mathematics and Scientific Computation | en_US |
| dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
| dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
| dc.date.accessioned | 2006-06-14T05:59:08Z | |
| dc.date.available | 2006-06-14T05:59:08Z | |
| dc.date.issued | 2006-04-30 | en_US |
| dc.description.abstract | The purpose of this dissertation is to present a mathematical model of network tomography through spectral graph theory analysis. In this regard, we explore the properties of harmonic functions and eigensystems of Laplacians for weighted graphs (networks) with and without boundary. We prove the solvability of the Dirichlet and Neumann boundary value problems. We also prove the global uniqueness of the inverse conductivity problem on a network under a suitable monotonicity condition. As a physical interpretation to the discrete inverse conductivity problem, we define a variant of the chip-firing game (a discrete balancing process) in which chips are added to the game from the boundary nodes and removed from the game if they are fired into the boundary of the graph. We find a bound on the length of the game, and examine the relations between set of spanning weighted forest rooted in the boundary of the graph and the set of critical configurations of the chips. | en_US |
| dc.format.extent | 494744 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/3542 | |
| dc.language.iso | en_US | |
| dc.subject.pqcontrolled | Mathematics | en_US |
| dc.title | DISCRETE INVERSE CONDUCTIVITY PROBLEMS ON NETWORKS | en_US |
| dc.type | Dissertation | en_US |
Files
Original bundle
1 - 1 of 1