Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Discrete Mathematics and Combinatorics (59)
- Other Mathematics (32)
- Applied Mathematics (30)
- Statistics and Probability (30)
- Algebra (28)
-
- Analysis (18)
- Geometry and Topology (16)
- Computer Sciences (15)
- Education (10)
- Data Science (9)
- Engineering (9)
- Theory and Algorithms (9)
- Other Applied Mathematics (8)
- Statistical Models (8)
- Applied Statistics (7)
- Life Sciences (6)
- Number Theory (6)
- Other Physical Sciences and Mathematics (6)
- Physics (6)
- Algebraic Geometry (5)
- Medicine and Health Sciences (5)
- Numerical Analysis and Computation (5)
- Probability (5)
- Arts and Humanities (4)
- Business (4)
- Computational Engineering (4)
- Dynamical Systems (4)
- Operations Research, Systems Engineering and Industrial Engineering (4)
- Institution
- Keyword
-
- Mathematics (42)
- Graph theory (33)
- College of Natural Science and Mathematics (22)
- Domination (11)
- Differential equations (6)
-
- Graph Theory (6)
- Algebra (5)
- Complementary prism (5)
- Geometry (5)
- Complex Analysis (4)
- Coverings (4)
- Machine learning (4)
- Packings (4)
- Total domination (4)
- Analysis (3)
- Atmospheric turbulence (3)
- Bifurcation theory (3)
- Chromatic number (3)
- Complex analysis (3)
- Convergence (3)
- Covering (3)
- Decidability (3)
- Design theory (3)
- Frames (3)
- Interpolation (3)
- Italian domination (3)
- Knot theory (3)
- Nonlinear (3)
- Nonlinear dynamics (3)
- Polynomial (3)
Articles 61 - 90 of 371
Full-Text Articles in Mathematics
Exponential Random Graphs And A Generalization Of Parking Functions, Ryan Demuse
Exponential Random Graphs And A Generalization Of Parking Functions, Ryan Demuse
Electronic Theses and Dissertations
Random graphs are a powerful tool in the analysis of modern networks. Exponential random graph models provide a framework that allows one to encode desirable subgraph features directly into the probability measure. Using the theory of graph limits pioneered by Borgs et. al. as a foundation, we build upon the work of Chatterjee & Diaconis and Radin & Yin. We add complexity to the previously studied models by considering exponential random graph models with edge-weights coming from a generic distribution satisfying mild assumptions. In particular, we show that a large family of two-parameter, edge-weighted exponential random graphs display a phase …
Decompositions Of The Complete Mixed Graph By Mixed Stars, Chance Culver
Decompositions Of The Complete Mixed Graph By Mixed Stars, Chance Culver
Electronic Theses and Dissertations
In the study of mixed graphs, a common question is: What are the necessary and suffcient conditions for the existence of a decomposition of the complete mixed graph into isomorphic copies of a given mixed graph? Since the complete mixed graph has twice as many arcs as edges, then an obvious necessary condition is that the isomorphic copies have twice as many arcs as edges. We will prove necessary and suffcient conditions for the existence of a decomposition of the complete mixed graphs into mixed stars with two edges and four arcs. We also consider some special cases of decompositions …
Trees With Unique Italian Dominating Functions Of Minimum Weight, Alyssa England
Trees With Unique Italian Dominating Functions Of Minimum Weight, Alyssa England
Electronic Theses and Dissertations
An Italian dominating function, abbreviated IDF, of $G$ is a function $f \colon V(G) \rightarrow \{0, 1, 2\}$ satisfying the condition that for every vertex $v \in V(G)$ with $f(v)=0$, we have $\sum_{u \in N(v)} f(u) \ge 2$. That is, either $v$ is adjacent to at least one vertex $u$ with $f(u) = 2$, or to at least two vertices $x$ and $y$ with $f(x) = f(y) = 1$. The Italian domination number, denoted $\gamma_I$(G), is the minimum weight of an IDF in $G$. In this thesis, we use operations that join two trees with a single edge in order …
An Analysis Of The First Passage To The Origin (Fpo) Distribution, Aradhana Soni
An Analysis Of The First Passage To The Origin (Fpo) Distribution, Aradhana Soni
Electronic Theses and Dissertations
What is the probability that in a fair coin toss game (a simple random walk) we go bankrupt in n steps when there is an initial lead of some known or unknown quantity $m? What is the distribution of the number of steps N that it takes for the lead to vanish? This thesis explores some of the features of this first passage to the origin (FPO) distribution. First, we explore the distribution of N when m is known. Next, we compute the maximum likelihood estimators of m for a fixed n and also the posterior distribution of m when …
Novel Inference Methods For Generalized Linear Models Using Shrinkage Priors And Data Augmentation., Arinjita Bhattacharyya
Novel Inference Methods For Generalized Linear Models Using Shrinkage Priors And Data Augmentation., Arinjita Bhattacharyya
Electronic Theses and Dissertations
Generalized linear models have broad applications in biostatistics and sociology. In a regression setup, the main target is to find a relevant set of predictors out of a large collection of covariates. Sparsity is the assumption that only a few of these covariates in a regression setup have a meaningful correlation with an outcome variate of interest. Sparsity is incorporated by regularizing the irrelevant slopes towards zero without changing the relevant predictors and keeping the resulting inferences intact. Frequentist variable selection and sparsity are addressed by popular techniques like Lasso, Elastic Net. Bayesian penalized regression can tackle the curse of …
Discrepancy Inequalities In Graphs And Their Applications, Adam Purcilly
Discrepancy Inequalities In Graphs And Their Applications, Adam Purcilly
Electronic Theses and Dissertations
Spectral graph theory, which is the use of eigenvalues of matrices associated with graphs, is a modern technique that has expanded our understanding of graphs and their structure. A particularly useful tool in spectral graph theory is the Expander Mixing Lemma, also known as the discrepancy inequality, which bounds the edge distribution between two sets based on the spectral gap. More specifically, it states that a small spectral gap of a graph implies that the edge distribution is close to random. This dissertation uses this tool to study two problems in extremal graph theory, then produces similar discrepancy inequalities based …
Hybrid Recommender Systems Via Spectral Learning And A Random Forest, Alyssa Williams
Hybrid Recommender Systems Via Spectral Learning And A Random Forest, Alyssa Williams
Electronic Theses and Dissertations
We demonstrate spectral learning can be combined with a random forest classifier to produce a hybrid recommender system capable of incorporating meta information. Spectral learning is supervised learning in which data is in the form of one or more networks. Responses are predicted from features obtained from the eigenvector decomposition of matrix representations of the networks. Spectral learning is based on the highest weight eigenvectors of natural Markov chain representations. A random forest is an ensemble technique for supervised learning whose internal predictive model can be interpreted as a nearest neighbor network. A hybrid recommender can be constructed by first …
Period Estimation And Denoising Families Of Nonuniformly Sampled Time Series, William Seguine
Period Estimation And Denoising Families Of Nonuniformly Sampled Time Series, William Seguine
Electronic Theses and Dissertations
Nonuniformly sampled time series are common in astronomy, finance, and other areas of research. Commonly, these time series belong to a family of signals recorded from the same phenomenon. Period estimation and denoising of such data relies on periodograms. In particular, the Lomb-Scargle periodogram and its extension, the Multiband Lomb-Scargle, are at the forefront of time series period estimation. However, these methods are not without laws. This paper explores alternatives to the Lomb-Scargle and Multiband Lomb-Scargle. In particular, this thesis uses regularized least squares and the convolution theorem to introduce a spectral consensus model of a family of nonuniformly sampled …
A Study Of Big Field Multivariate Cryptography., Ryann Cartor
A Study Of Big Field Multivariate Cryptography., Ryann Cartor
Electronic Theses and Dissertations
As the world grapples with the possibility of widespread quantum computing, the cryptosystems of the day need to be up to date. Multivariate Public Key Cryptography is a leading option for security in a post quantum society. One goal of this work is to classify the security of multivariate schemes, especially C*variants. We begin by introducing Multivariate Public Key Cryptography and will then discuss different multivariate schemes and the main types of attacks that have been proven effective against multivariate schemes. Once we have developed an appropriate background, we analyze security of different schemes against particular attacks. Specifically, we …
Roman Domination Cover Rubbling, Nicholas Carney
Roman Domination Cover Rubbling, Nicholas Carney
Electronic Theses and Dissertations
In this thesis, we introduce Roman domination cover rubbling as an extension of domination cover rubbling. We define a parameter on a graph $G$ called the \textit{Roman domination cover rubbling number}, denoted $\rho_{R}(G)$, as the smallest number of pebbles, so that from any initial configuration of those pebbles on $G$, it is possible to obtain a configuration which is Roman dominating after some sequence of pebbling and rubbling moves. We begin by characterizing graphs $G$ having small $\rho_{R}(G)$ value. Among other things, we also obtain the Roman domination cover rubbling number for paths and give an upper bound for the …
Lattice-Valued T-Filters And Induced Structures, Frederick Reid
Lattice-Valued T-Filters And Induced Structures, Frederick Reid
Electronic Theses and Dissertations
A complete lattice is called a frame provided meets distribute over arbitrary joins. The implication operation in this context plays a central role. Intuitively, it measures the degree to which one element is less than or equal to another. In this setting, a category is defined by equipping each set with a T-convergence structure which is defined in terms of T-filters. This category is shown to be topological, strongly Cartesian closed, and extensional. It is well known that the category of topological spaces and continuous maps is neither Cartesian closed nor extensional. Subcategories of compact and of complete spaces are …
Perfect Double Roman Domination Of Trees, Ayotunde Egunjobi
Perfect Double Roman Domination Of Trees, Ayotunde Egunjobi
Electronic Theses and Dissertations
See supplemental content for abstract
Generalizations Of The Arcsine Distribution, Rebecca Rasnick
Generalizations Of The Arcsine Distribution, Rebecca Rasnick
Electronic Theses and Dissertations
The arcsine distribution looks at the fraction of time one player is winning in a fair coin toss game and has been studied for over a hundred years. There has been little further work on how the distribution changes when the coin tosses are not fair or when a player has already won the initial coin tosses or, equivalently, starts with a lead. This thesis will first cover a proof of the arcsine distribution. Then, we explore how the distribution changes when the coin the is unfair. Finally, we will explore the distribution when one person has won the first …
Taking Notes: Generating Twelve-Tone Music With Mathematics, Nathan Molder
Taking Notes: Generating Twelve-Tone Music With Mathematics, Nathan Molder
Electronic Theses and Dissertations
There has often been a connection between music and mathematics. The world of musical composition is full of combinations of orderings of different musical notes, each of which has different sound quality, length, and em phasis. One of the more intricate composition styles is twelve-tone music, where twelve unique notes (up to octave isomorphism) must be used before they can be repeated. In this thesis, we aim to show multiple ways in which mathematics can be used directly to compose twelve-tone musical scores.
Applications Of Geometric And Spectral Methods In Graph Theory, Lauren Morey Nelsen
Applications Of Geometric And Spectral Methods In Graph Theory, Lauren Morey Nelsen
Electronic Theses and Dissertations
Networks, or graphs, are useful for studying many things in today’s world. Graphs can be used to represent connections on social media, transportation networks, or even the internet. Because of this, it’s helpful to study graphs and learn what we can say about the structure of a given graph or what properties it might have. This dissertation focuses on the use of the probabilistic method and spectral graph theory to understand the geometric structure of graphs and find structures in graphs. We will also discuss graph curvature and how curvature lower bounds can be used to give us information about …
Decidability For Residuated Lattices And Substructural Logics, Gavin St. John
Decidability For Residuated Lattices And Substructural Logics, Gavin St. John
Electronic Theses and Dissertations
We present a number of results related to the decidability and undecidability of various varieties of residuated lattices and their corresponding substructural logics. The context of this analysis is the extension of residuated lattices by various simple equations, dually, the extension of substructural logics by simple structural rules, with the aim of classifying simple equations by the decidability properties shared by their extensions. We also prove a number of relationships among simple extensions by showing the equational theory of their idempotent semiring reducts coincides with simple extensions of idempotent semirings. On the decidability front, we develop both semantical and syntactical …
Spatial Models With Specific Error Structures, Nathaniel Adu
Spatial Models With Specific Error Structures, Nathaniel Adu
Electronic Theses and Dissertations
The purpose of this dissertation is to study the first order autoregressive model in the spatial context with specific error structures. We begin by supposing that the error structure has a long memory in both the i and the j components. Whenever the model parameters alpha and beta equal one, the limiting distribution of the sequence of normalized Fourier coefficients of the spatial process is shown to be a function of a two parameter fractional Brownian sheet. This result is used to find the limiting distribution of the periodogram ordinate of the spatial process under the null hypothesis that alpha …
Cramer Type Moderate Deviations For Random Fields And Mutual Information Estimation For Mixed-Pair Random Variables, Aleksandr Beknazaryan
Cramer Type Moderate Deviations For Random Fields And Mutual Information Estimation For Mixed-Pair Random Variables, Aleksandr Beknazaryan
Electronic Theses and Dissertations
In this dissertation we first study Cramer type moderate deviation for partial sums of random fields by applying the conjugate method. In 1938 Cramer published his results on large deviations of sums of i.i.d. random variables after which a lot of research has been done on establishing Cramer type moderate and large deviation theorems for different types of random variables and for various statistics. In particular results have been obtained for independent non-identically distributed random variables for the sum of independent random to estimate the mutual information between two random variables. The estimates enjoy a central limit theorem under some …
Using Social Network Analysis To Examine The Connections Within A Noyce Community’S Facebook Group, Amanda Jensen
Using Social Network Analysis To Examine The Connections Within A Noyce Community’S Facebook Group, Amanda Jensen
Electronic Theses and Dissertations
One of the successes of the Rural Enhancement of Mathematics And Science Teachers (REMAST) Scholarship Program at South Dakota State University is the community we have built. This community has been built through a summer conference and a closed Facebook group. As we near the end of our Phase II Noyce funding, we are using social network analysis to examine the connections within the REMAST Facebook group. What we learn in this research project will be useful to other Noyce projects as it is a model for developing a strong professional learning community. In order to determine information about the …
Development Of A Data-Driven Patient Engagement Score Using Finite Mixture Models, Eric Bae
Development Of A Data-Driven Patient Engagement Score Using Finite Mixture Models, Eric Bae
Electronic Theses and Dissertations
Patient activation measure (PAM) is widely adopted by health care providers to access individual's knowledge, skill, and confidence for managing one's health and healthcare. Patient activation measure (PAM), licensed by Insignia Health, is widely adopted by health care providers to access individual's knowledge, skill, and confidence for managing one's health and healthcare. Multiple studies corroborate the effectiveness of activation measure in predicting most health behaviors, including preventive behaviors, healthy behaviors, self-management behaviors, and health information seeking. However, PAM is heavily dependent on subjective patient-reported data, which are often incomplete. The purpose of this study is to develop an objective statistical …
A Study Of Several Applications Of Parallel Computing In The Sciences Using Petsc, Nicholas Stegmeier
A Study Of Several Applications Of Parallel Computing In The Sciences Using Petsc, Nicholas Stegmeier
Electronic Theses and Dissertations
The importance of computing in the natural sciences continues to grow as scientists strive to analyze complex phenomena. The dynamics of turbulence, astrophysics simulations, and climate change are just a few examples where computing is critical. These problems are computationally intractable on all computing platforms except supercomputers, necessitating the continued development of efficient algorithms and methodologies in parallel computing. This thesis investigates the use of parallel computing and mathematical modeling in the natural sciences through several applications, namely computational fluid dynamics for impinging jets in mechanical engineering, simulation of biofilms in an aqueous environment in mathematical biology, and the solution …
Rigid Equilibriums Of A Rotating String, Teddrick Schaffer
Rigid Equilibriums Of A Rotating String, Teddrick Schaffer
Electronic Theses and Dissertations
This paper describes some possible equilibrium configurations of a string rotating in a certain class of force fields, which have properties motivated by the inverse square gravitational force. Specifically it is shown that for a given number n, there exists a sufficient rotational rate such that any equilibrium configuration with no more than n zeros is guaranteed to exist for any force field in the class considered.
Zeros Of The Dedekind Zeta-Function, Mashael Alsharif
Zeros Of The Dedekind Zeta-Function, Mashael Alsharif
Electronic Theses and Dissertations
H. L. Montgomery proved a formula for sums over two sets of nontrivial zeros of the Riemann zeta-function. Assuming the Riemann Hypothesis, he used this formula and Fourier analysis to prove an estimate for the proportion of simple zeros of the Riemann zeta-function. We prove a generalization of his formula for the nontrivial zeros of the Dedekind zeta-function of a Galois number field, and use this formula and Fourier analysis to prove an estimate for the proportion of distinct zeros, assuming the Generalized Riemann Hypothesis.
Hadwiger Numbers And Gallai-Ramsey Numbers Of Special Graphs, Christian Bosse
Hadwiger Numbers And Gallai-Ramsey Numbers Of Special Graphs, Christian Bosse
Electronic Theses and Dissertations
This dissertation explores two separate topics on graphs. We first study a far-reaching generalization of the Four Color Theorem. Given a graph G, we use chi(G) to denote the chromatic number; alpha(G) the independence number; and h(G) the Hadwiger number, which is the largest integer t such that the complete graph K_t can be obtained from a subgraph of G by contracting edges. Hadwiger's conjecture from 1943 states that for every graph G, h(G) is greater than or equal to chi(G). This is perhaps the most famous conjecture in Graph Theory and remains open even for graphs G with alpha(G) …
Variational Inclusions With General Over-Relaxed Proximal Point And Variational-Like Inequalities With Densely Pseudomonotonicity, George Nguyen
Variational Inclusions With General Over-Relaxed Proximal Point And Variational-Like Inequalities With Densely Pseudomonotonicity, George Nguyen
Electronic Theses and Dissertations
This dissertation focuses on the existence and uniqueness of the solutions of variational inclusion and variational inequality problems and then attempts to develop efficient algorithms to estimate numerical solutions for the problems. The dissertation consists a total of five chapters. Chapter 1 is an introduction to variational inequality problems, variational inclusion problems, monotone operators, and some basic definitions and preliminaries from convex analysis. Chapter 2 is a study of a general class of nonlinear implicit inclusion problems. The objective of this study is to explore how to omit the Lipschitz continuity condition by using an alternating approach to the proximal …
Estimation And Clustering In Statistical Ill-Posed Linear Inverse Problems, Rasika Rajapakshage
Estimation And Clustering In Statistical Ill-Posed Linear Inverse Problems, Rasika Rajapakshage
Electronic Theses and Dissertations
The main focus of the dissertation is estimation and clustering in statistical ill-posed linear inverse problems. The dissertation deals with a problem of simultaneously estimating a collection of solutions of ill-posed linear inverse problems from their noisy images under an operator that does not have a bounded inverse, when the solutions are related in a certain way. The dissertation defense consists of three parts. In the first part, the collection consists of measurements of temporal functions at various spatial locations. In particular, we study the problem of estimating a three-dimensional function based on observations of its noisy Laplace convolution. In …
Two Ramsey-Related Problems, Jingmei Zhang
Two Ramsey-Related Problems, Jingmei Zhang
Electronic Theses and Dissertations
Extremal combinatorics is one of the central branches of discrete mathematics and has experienced an impressive growth during the last few decades. It deals with the problem of determining or estimating the maximum or minimum possible size of a combinatorial structure which satisfies certain requirements. In this dissertation, we focus on studying the minimum number of edges of certain co-critical graphs. Given an integer r ≥ 1 and graphs G; H1; : : : ;Hr, we write → G (H1; : : : ;Hr) if every r-coloring of the edges of G contains a monochromatic copy of Hi in color …
Solution Of Linear Ill-Posed Problems Using Overcomplete Dictionaries, Pawan Gupta
Solution Of Linear Ill-Posed Problems Using Overcomplete Dictionaries, Pawan Gupta
Electronic Theses and Dissertations
In this dissertation, we consider an application of overcomplete dictionaries to the solution of general ill-posed linear inverse problems. In the context of regression problems, there has been an enormous amount of effort to recover an unknown function using such dictionaries. While some research on the subject has been already carried out, there are still many gaps to address. In particular, one of the most popular methods, lasso, and its variants, is based on minimizing the empirical likelihood and unfortunately, requires stringent assumptions on the dictionary, the so-called, compatibility conditions. Though compatibility conditions are hard to satisfy, it is well …
A First-Year Teacher’S Implementation Of Short-Cycle Formative Assessment Through The Use Of A Classroom Response System And Flexible Grouping, Adrienne Irving Dumas
A First-Year Teacher’S Implementation Of Short-Cycle Formative Assessment Through The Use Of A Classroom Response System And Flexible Grouping, Adrienne Irving Dumas
Electronic Theses and Dissertations
As teachers we are tasked with ensuring that our students are equipped with the skills necessary to not only perform with proficiency on local state and national assessments but also to provide our students with opportunities to develop confidence and competence as learners of mathematics through meaningful challenging and worthwhile activities. As such many teachers have turned to technology and cooperative groups as staples in the classroom. The purpose of this study was to understand how one first-year teacher implemented what she was taught in her undergraduate coursework in teaching two specific units of instruction in two sections of high …
Beta Invariant And Variations Of Chain Theorems For Matroids, Sooyeon Lee
Beta Invariant And Variations Of Chain Theorems For Matroids, Sooyeon Lee
Electronic Theses and Dissertations
The beta invariant of a matroid was introduced by Crapo in 1967. We first find the lower bound of the beta invariant of 3-connected matroids with rank r and the matroids which attain the lower bound. Second we characterize the matroids with beta invariant 5 and 6. For binary matroids we characterize matroids with beta invariant 7. These results extend earlier work of Oxley. Lastly we partially answer an open question of chromatic uniqueness of wheels and prove a splitting formula for the beta invariant of generalized parallel connection of two matroids. Tutte's Wheel-and-Whirl theorem and Seymour's Splitter theorem give …