Physical Sciences and Mathematics Commons^™

Overrepresentation Of The Underrepresented: Gender Bias In Wikipedia, Anna Marinina

Honors College Theses

The goal of our research is to determine if gender bias exists in Wikipedia. Wikipedia is a very large dataset that has been used to train artificial intelligence models. If a dataset that is being used for this purpose is biased, then the artificial intelligence model that was trained with it will be biased as well, therefore making biased decisions. For this reason, it is important to explore large datasets for any potential biases before they are used in machine learning. Since Wikipedia is ontologically structured, we used graph theory to create a network of all of the website’s categories …

Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen

Zhi-Hong Chen

No abstract provided.

Stability And Application Of The K-Core Dynamical Model To Biological Networks, Francesca Beatrice Arese Lucini

Dissertations, Theses, and Capstone Projects

The objective of the dissertation is to illustrate the importance of the k-core dynamical model, by first presenting the stability analysis of the nonlinear k-core model and compare its solution to the most widely used linear model. Second, I show a real world application of the k-core model to describe properties of neural networks, specifically, the transition from conscious to subliminal perception.

Winnability Of The Group Labeling Lights Out Game On Complete Bipartite Graphs, Christian J. Miller

McNair Scholars Manuscripts

For an arbitrary graph, we can play Lights Out on it if we assign a number label to each of the vertices of a graph G, representing states of on/off in the original Lights Out game, with the edges connecting those vertices representing the buttons that are adjacent to each other. This project is focused on a slightly modifed version of the game's original rules, with the labels for the vertices coming from the group Zn. It is not always possible to win the game. We will be investigating the values of n for which this group labeling "Lights Out!" …

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 …

Simulating Epidemics And Interventions On High Resolution Social Networks, Christopher E. Siu

Master's Theses

Mathematical models of disease spreading are a key factor of ensuring that we are prepared to deal with the next epidemic. They allow us to predict how an infection will spread throughout a population, thereby allowing us to make intelligent choices when attempting to contain the disease. Whether due to a lack of empirical data, a lack of computational power, a lack of biological understanding, or some combination thereof, traditional models must make sweeping assumptions about the behavior of a population during an epidemic.

In this thesis, we implement granular epidemic simulations using a rich social network constructed from real-world …

Stock Market Prediction Using Ensemble Of Graph Theory, Machine Learning And Deep Learning Models, Pratik Patil

Master's Projects

Efficient Market Hypothesis (EMH) is the cornerstone of the modern financial theory and it states that it is impossible to predict the price of any stock using any trend, fundamental or technical analysis. Stock trading is one of the most important activities in the world of finance. Stock price prediction has been an age-old problem and many researchers from academia and business have tried to solve it using many techniques ranging from basic statistics to machine learning using relevant information such as news sentiment and historical prices. Even though some studies claim to get prediction accuracy higher than a random …

Variations In Ramsey Theory, Drake Olejniczak

Dissertations

The Ramsey number R(F,H) of two graphs F and H is the smallest positive integer n for which every red-blue coloring of the (edges of a) complete graph of order n results in a graph isomorphic to F all of whose edges are colored red (a red F) or a blue H. Beineke and Schwenk extended this concept to a bipartite version of Ramsey numbers, namely the bipartite Ramsey number BR(F,H) of two bipartite graphs F and H is the smallest positive integer rsuch that every red-blue coloring of the r-regular complete bipartite graph results in either …

The Knill Graph Dimension From Clique Cover, Evatt Salinger, Dr. Kassahun Betre

Seaver College Research And Scholarly Achievement Symposium

In this paper we prove that the recursive (Knill) dimension of the join of two graphs has a simple formula in terms of the dimensions of the component graphs: dim (G1 + G2) = 1 + dim G1 + dim G2. We use this formula to derive an expression for the Knill dimension of a graph from its minimum clique cover. A corollary of the formula is that a graph made of the arbitrary union of complete graphs KN of the same order KN will have dimension N − 1.

Counting And Coloring Sudoku Graphs, Kyle Oddson

Mathematics and Statistics Dissertations, Theses, and Final Project Papers

A sudoku puzzle is most commonly a 9 × 9 grid of 3 × 3 boxes wherein the puzzle player writes the numbers 1 - 9 with no repetition in any row, column, or box. We generalize the notion of the n² × n² sudoku grid for all n ϵ Z ^≥2 and codify the empty sudoku board as a graph. In the main section of this paper we prove that sudoku boards and sudoku graphs exist for all such n we prove the equivalence of [3]'s construction using unions and products of graphs to the definition of …

A Novel Graph-Operational Matrix Method For Solving Multidelay Fractional Differential Equations With Variable Coefficients And A Numerical Comparative Survey Of Fractional Derivative Types, Ömür Kivanç Kürkçü, Ersi̇n Aslan, Mehmet Sezer

Turkish Journal of Mathematics

In this study, we introduce multidelay fractional differential equations with variable coefficients in a unique formula. A novel graph-operational matrix method based on the fractional Caputo, Riemann-Liouville, Caputo-Fabrizio, and Jumarie derivative types is developed to efficiently solve them. We also make use of the collocation points and matrix relations of the matching polynomial of the complete graph in the method. We determine which of the fractional derivative types is more appropriate for the method. The solutions of model problems are improved via a new residual error analysis technique. We design a general computer program module. Thus, we can explicitly monitor …

Kings In The Direct Product Of Digraphs, Morgan Norge

Theses and Dissertations

A k-king in a digraph D is a vertex that can reach every other vertex in D by a directed path of length at most k. A king is a vertex that is a k-king for some k. We will look at kings in the direct product of digraphs and characterize a relationship between kings in the product and kings in the factors. This is a continuation of a project in which a similar characterization is found for the cartesian product of digraphs, the strong product of digraphs, and the lexicographic product of digraphs.

Optimization Methods For Learning Graph-Structured Sparse Models, Baojian Zhou

Legacy Theses & Dissertations (2009 - 2024)

Learning graph-structured sparse models has recently received significant attention thanks to their broad applicability to many important real-world problems. However, such models, of more effective and stronger interpretability compared with their counterparts, are difficult to learn due to optimization challenges. This thesis presents optimization algorithms for learning graph-structured sparse models under three different problem settings. Firstly, under the batch learning setting, we develop methods that can be applied to different objective functions that enjoy linear convergence guarantees up to constant errors. They can effectively optimize the statistical score functions in the task of subgraph detection; Secondly, under stochastic learning setting, …

Conflict Free Connectivity And The Conflict-Free-Connection Number Of Graphs, Travis D. Wehmeier

Electronic Theses and Dissertations

We explore a relatively new concept in edge-colored graphs called conflict-free connectivity. A conflict-free path is a (edge-) colored path that has an edge with a color that appears only once. Conflict-free connectivity is the maximal number of internally disjoint conflict-free paths between all pairs of vertices in a graph. We also define the c-conflict-free-connection of a graph G. This is the maximum conflict-free connectivity of G over all c-colorings of the edges of G. In this paper we will briefly survey the works related to conflict-free connectivity. In addition, we will use the probabilistic method to achieve a bound …

Special Subset Vertex Multisubgraphs For Multi Networks, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilanthenral K

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors study special type of subset vertex multi subgraphs; these multi subgraphs can be directed or otherwise. Another special feature of these subset vertex multigraphs is that we are aware of the elements in each vertex set and how it affects the structure of both subset vertex multisubgraphs and edge multisubgraphs. It is pertinent to record at this juncture that certain ego centric directed multistar graphs become empty on the removal of one edge, there by theorising the importance, and giving certain postulates how to safely form ego centric multi networks. Given any subset vertex multigraph we …

Separability And Vertex Ordering Of Graphs, Elizabeth Gorbonos

Theses and Dissertations (Comprehensive)

Many graph optimization problems, such as finding an optimal coloring, or a largest clique, can be solved by a divide-and-conquer approach. One such well-known technique is decomposition by clique separators where a graph is decomposed into special induced subgraphs along their clique separators. While the most common practice of this method employs minimal clique separators, in this work we study other variations as well. We strive to characterize their structure and in particular the bound on the number of atoms. In fact, we strengthen the known bounds for the general clique cutset decomposition and the minimal clique separator decomposition. Graph …

Evaluation Of Power System Robustness In Order To Prevent Cascading Outages, Farnaaz Hajbani, Heresh Seyedi, Kazem Zare

Turkish Journal of Electrical Engineering and Computer Sciences

Power system robustness against overload condition is a challenging issue in the fields of power system planning and operation. In this paper, two indices are proposed to evaluate power system robustness. The proposed indices are used to identify critical lines whose failure is due to overload, leading the power system to cascading outages and blackout. The first proposed index is a linear index. The second index is based on graph theory metrics. To prevent cascading outages, system robustness is calculated for all N-1 and N-2 contingencies. The lines whose outages lead to the smallest robustness values are considered as critical …