Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
Graphs Of Classroom Networks, Rebecca Holliday
Graphs Of Classroom Networks, Rebecca Holliday
Electronic Theses and Dissertations
In this work, we use the Havel-Hakimi algorithm to visualize data collected from students to investigate classroom networks. The Havel-Hakimi algorithm uses a recursive method to create a simple graph from a graphical degree sequence. In this case, the degree sequence is a representation of the students in a classroom, and we use the number of peers with whom a student studied or collaborated to determine the degree of each. We expand upon the Havel-Hakimi algorithm by coding a program in MATLAB that generates random graphs with the same degree sequence. Then, we run another algorithm to find the isomorphism …
A Survey Of Mathematical Models Of Dengue Fever, Iurii Bakach
A Survey Of Mathematical Models Of Dengue Fever, Iurii Bakach
Electronic Theses and Dissertations
In this paper, we compare and contrast five models of Dengue fever. We evaluate each model using different scenarios and identify the strenghts and wecknesses of each of the model
Enumerating Graphs Using Integrals From Quantum Field Theory, William A. Coggins
Enumerating Graphs Using Integrals From Quantum Field Theory, William A. Coggins
Electronic Theses and Dissertations
Enumerating graphs is a relatively new subfield of mathematics. In this thesis, we will discuss a enumerative method that derives from Quantum Field Theory. We begin with the basic ideas of Calculus and extend them into a enumerative method that will allow us to classify graphs embedded on surfaces.
Solutions Of Inequality Constrained Spline Optimization Problems With The Active Set Method, Joshua A. Holloway
Solutions Of Inequality Constrained Spline Optimization Problems With The Active Set Method, Joshua A. Holloway
Electronic Theses and Dissertations
We solve the problem of finding a near-interpolant curve, subject to constraints, which minimizes the bending energy of the curve. Using B-splines as our tools, we give a brief overview of spline properties and develop several different cases of inequality constrained optimization problems of this type. In particular, we develop the active set method and use it to solve these problems, emphasizing the fact that this algorithm will converge to a solution in finite iterations. Our solution will solve an open problem regarding near-interpolant spline curves. Furthermore, we supplement this with an iterative technique for better choosing data sites so …