Physical Sciences and Mathematics Commons^™

Voting Rules And Properties, Zhuorong Mao

Undergraduate Honors Theses

This thesis composes of two chapters. Chapter one considers the higher order of Borda Rules (Bp) and the Perron Rule (P) as extensions of the classic Borda Rule. We study the properties of those vector-valued voting rules and compare them with Simple Majority Voting (SMV). Using simulation, we found that SMV can yield different results from B1, B2, and P even when it is transitive. We also give a new condition that forces SMV to be transitive, and then quantify the frequency of transitivity when it fails.

In chapter two, we study the `protocol paradox' of approval voting. In approval …

The Probability Mass Function Of The Kaplan-Meier Product-Limit Estimator, Yuxin Qin, Heather Sasinowska, Lawrence Leemis

Arts & Sciences Articles

Kaplan andMeier’s 1958 article developed a nonparametric estimator of the survivor function from a right censored dataset. Determining the size of the support of the estimator as a function of the sample size provides a challenging exercise for students in an advanced course in mathematical statistics. We devise two algorithms for calculating the support size and calculate the associated probability mass function for small sample sizes and particular probability distributions for the failure and censoring times.

Modern Theory Of Copositive Matrices, Yuqiao Li

Undergraduate Honors Theses

Copositivity is a generalization of positive semidefiniteness. It has applications in theoretical economics, operations research, and statistics. An $n$-by-$n$ real, symmetric matrix $A$ is copositive (CoP) if $x^T Ax \ge 0$ for any nonnegative vector $x \ge 0.$ The set of all CoP matrices forms a convex cone. A CoP matrix is ordinary if it can be written as the sum of a positive semidefinite (PSD) matrix and a symmetric nonnegative (sN) matrix. When $n < 5,$ all CoP matrices are ordinary. However, recognizing whether a given CoP matrix is ordinary and determining an ordinary decomposition (PSD + sN) is still an unsolved problem. Here, we give an overview on modern theory of CoP matrices, talk about our progress on the ordinary recognition and decomposition problem, and emphasis the graph theory aspect of ordinary CoP matrices.

Enumerating Switching Isomorphism Classes Of Signed Graphs, Nathaniel Healy

Undergraduate Honors Theses

Let Γ be a simple connected graph, and let {+,−}^E(Γ) be the set of signatures of Γ. For σ a signature of Γ, we call the pair Σ = (Γ,σ) a signed graph of Γ. We may define switching functions ζ_X ∈ {+, −}^V (Γ) that negate the sign of every edge {u, v} incident with exactly one vertex in the fiber X = ζ^{−1}(−). The group Sw(Γ) of switching functions acts X on the set of signed graphs of Γ and induces an equivalence relation of switching classes in its orbits; there are 2^{|E(Γ)|−|V (Γ)|+1} such classes. More interestingly, …

Period Doubling Cascades From Data, Alexander Berliner

Undergraduate Honors Theses

Orbit diagrams of period doubling cascades represent systems going from periodicity to chaos. Here, we investigate whether a Gaussian process regression can be used to approximate a system from data and recover asymptotic dynamics in the orbit diagrams for period doubling cascades. To compare the orbits of a system to the approximation, we compute the Wasserstein metric between the point clouds of their obits for varying bifurcation parameter values. Visually comparing the period doubling cascades, we note that the exact bifurcation values may shift, which is confirmed in the plots of the Wasserstein distance. This has implications for studying dynamics …

The Enumeration Of Minimum Path Covers Of Trees, Merielyn Sher

Undergraduate Honors Theses

A path cover of a tree T is a collection of induced paths of T that are vertex disjoint and cover all the vertices of T. A minimum path cover (MPC) of T is a path cover with the minimum possible number of paths, and that minimum number is called the path cover number of T. A tree can have just one or several MPC's. Prior results have established equality between the path cover number of a tree T and the largest possible multiplicity of an eigenvalue that can occur in a symmetric matrix whose graph is that tree. We …

Introducing R, Lawrence Leemis

Arts & Sciences Book Chapters

R is an open source programming language and interactive programming environment that has become the software tool of choice in data analytics. Learning Base R provides an introduction to the language for those with and without prior programming experience. It introduces the key topics that you will need to begin analyzing data and programming in R. The focus here is on the R language rather than a particular application. Within the text, there are 200 exercises to assess your R skills.