Physical Sciences and Mathematics Commons^™

A Bootstrap Method To Analyze An Intervention Model With Autoregressive Error Terms, Scott D. Mcknight

Dissertations

The analysis of a particular time-series intervention model involving lag one autoregressive (AR(1)) error terms is the focus of this dissertation. The method of ordinary least squares, and several two stage procedures that are commonly used to analyze this intervention model are examined. The two stage Cochrane-Orcutte, Durbin, and generalized least squares procedures each requires estimation of the AR(1) parameter in stage one before hypothesis testing about the intervention parameters can be performed in stage two. Using Monte Carlo experiments we show that the AR(1) estimates commonly used in these procedures are poor and consequently the stage two hypothesis tests …

The Theory And Applications Of Stratified Graphs, Reza Rashidi

Dissertations

Physical design is one of several stages in the design of a VLSI chip. In this stage, the specifications of an electrical circuit are converted into a geometrical model. Problems concerning the physical design stage can often be studied by means of graphs. The problems encountered here are routing problems and concern placement of vertices, which represent wires, into layers. All this gives rise to a class of graphs whose vertices are partitioned into classes. Such graphs are called stratified graphs. In this dissertation, we formally define stratified graphs, study their properties, and investigate various algorithmic problems related to these …

High Breakdown Rank-Based Estimates For Linear Models, William H. Chang

Dissertations

No abstract provided.

Comparisons Of Several Medians In A Lognormal K-Sample Context Where Some Data May Be Left-Censored, Stavros Costa Pouloukas

Dissertations

No abstract provided.

Isospectral Graphs And The Expander Coefficient, Ian Campbell Walters Jr.

Dissertations

The expander coefficient of a graph is a parameter that is utilized to quantify the rate at which information is spread throughout a graph. The eigenvalues of the Lapladan of a graph provide a bound for the expander coefficient of the graph. In this dissertation, we construct many pairs of isospectral graphs with different expander coefficients.

In Chapter I, we define the problem and present some preliminary definitions. We then introduce two constructions that are related to graph composition and that may be employed to produce cospectral and isospectral graphs.

In Chapter II, we investigate the connectivity of and distance …