Mathematics Commons^™

Positive Solutions Obtained As Local Minima Via Symmetries, For Nonlinear Elliptic Equations, Florin Catrina

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

In this dissertation, we establish existence and multiplicity of positive solutions for semilinear elliptic equations with subcritical and critical nonlinearities. We treat problems invariant under subgroups of the orthogonal group. Roughly speaking, we prove that if enough "mass " is concentrated around special orbits, then among the functions with prescribed symmetry, there is a solution for the original problem.

Our results can be regarded as a further development of the work of Z.-Q. Wang, where existence of local minima in the space of symmetric functions was studied for the Schrödinger equation. We illustrate the general theory with three examples, all …

A New Perspective On Classification, Guohua Zhao

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The idea of voting multiple decision rules was introduced in to statistics by Breiman. He used bootstrap samples to build different decision rules, and then aggregated them by majority voting (bagging). In regression, bagging gives improved predictors by reducing the variance (random variation), while keeping the bias (systematic error) the same. Breiman introduced the idea of bias and variance for classification to explain how bagging works. However, Friedman showed that for the two-class situation, bias and variance influence the classification error in a very different way than they do in the regression case.

In the first part of …

Mean-Square Error Bounds And Perfect Sampling For Conditional Coding, Xiangchen Cui

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

In this dissertation, new theoretical results are obtained for bounding convergence and mean-square error in conditional coding. Further new statistical methods for the practical application of conditional coding are developed.

Criteria for the uniform convergence are first examined. Conditional coding Markov chains are aperiodic, π-irreducible, and Harris recurrent. By applying the general theories of uniform ergodicity of Markov chains on general state space, one can conclude that conditional coding Markov chains are uniformly ergodic and further, theoretical convergence rates based on Doeblin's condition can be found.

Conditional coding Markov chains can be also viewed as having finite state space. …

Comparing Nonlinear And Nonparametric Modeling Techniques For Mapping And Stratification In Forest Inventories Of The Interior Western Usa, Gretchen Gengenbach Moisen

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Recent emphasis has been placed on merging regional forest inventory data with satellite-based information both to improve the efficiency of estimates of population totals, and to produce regional maps of forest variables. There are numerous ways in which forest class and structure variables may be modeled as functions of remotely sensed variables, yet surprisingly little work has been directed at surveying modem statistical techniques to determine which tools are best suited to the tasks given multiple objectives and logistical constraints. Here, a series of analyses to compare nonlinear and nonparametric modeling techniques for mapping a variety of forest variables, and …