Mathematics Commons^™

On The Design Of A Framework For Large-Scale Exploratory Graph Analytics, Oliver Andres Alvarado Rodriguez

Dissertations

Large-scale exploratory graph analytics merges data science with high-performance computing to extract critical insights from network-representable data. Data scientists routinely analyze data from the natural, social, and computing sciences by representing it as networks, or graphs, where objects become vertices and their relationships become edges. This representation allows data scientists to add graph analytics to their toolbox. However, designing tools for large-scale exploratory graph analytics is challenging due to the complexities of graph algorithms, such as high communication in distributed systems and large memory demands. These challenges can lead to overly complex software, which limits usability and development to a …

From Neural Networks To Large Language Models: Innovations In Financial Ai, Mathematical Reasoning, And Structured Data Representation, Junyi Ye

Dissertations

This dissertation explores the evolution and application of artificial intelligence techniques across three critical domains: financial modeling, mathematical reasoning, and structured data analysis. The dissertation presents seven research projects that chart a progression from specialized neural architectures to sophisticated large language models (LLMs), contributing novel methodologies and frameworks at each stage.

In the financial domain, the research first introduces TS-Mixer, a MLP-based architecture for time-series forecasting that captures both feature relationships and temporal dependencies through a simple yet effective design, outperforming more complex models in S&P500 index prediction. The dissertation then presents DySTAGE, a dynamic graph representation learning framework that …

A Novel Framework For Dynamic Graph Representation Learning With Mamba, Ashish Pandey

Theses

Dynamic graph embedding is a key technique for modeling temporal dependencies in evolving networks. While transformer-based models perform well, their quadratic complexity limits scalability on long graph sequences. This thesis compares transformer approaches with the Mamba architecture-a linear-complexity state-space model—for temporal graph embedding.

Two frameworks are proposed: DG-Mamba and GDG-Mamba. DG-Mamba uses standard GCN-based spatial encoding, while GDG-Mamba incorporates domain-aware edge features using Graph Isomorphism Network with Edge Convolution (GraphGINE). Experiments on UCI, Reality Mining, Slashdot, Bitcoin-OTC, and SBM datasets show that Mamba-based models match or exceed transformer performance, especially on graphs with high temporal variability.

The thesis also applies …

The Jacod-Yor Theorem For Sigma Martingales And The Second Fundamental, Moritz Sohns

Journal of Stochastic Analysis

In this paper, we prove the Jacod-Yor Theorem for sigma martingales, a class of processes that generalize local martingales and play a pivotal role in financial mathematics. While the Jacod-Yor Theorem has been extensively studied for L2-martingales, martingales, and local martingales, no prior version exists for sigma martingales. Our result establishes the connection between sigma martingales and their martingale representation properties, addressing a critical gap in the literature. As an application, we prove the Second Fundamental Theorem of Asset Pricing for markets where price processes are modeled as sigma martingales.

The Mckay-Navarro Conjecture For The Prime 2, L. Ruhstorfer, A. A. Schaeffer Fry

Mathematics: Faculty Scholarship

We complete the proof of the McKay-Navarro conjecture (also known as the Galois-McKay conjecture) for the prime 2, by completing the proof of the inductive McKay-Navarro conditions introduced by Navarro-Späth-Vallejo for this prime.

The Witten Deformation And Proper Cocompact Lie Group Actions, Hao Zhuang

Arts & Sciences Graduate Student Theses and Dissertations

We study the interactions between the Witten deformation of the de Rham exterior differentiation and topological invariants in two scenarios of proper Lie group actions. In the first scenario, we work on a closed oriented manifold admitting an action by a compact connected Lie group. Using a special Morse-Bott function invariant under the group action, we deform the de Rham exterior derivative and get the associated Witten Laplacian. Applying asymptotic analysis, we localize the kernel of the Witten Laplacian around the critical components of the invariant Morse-Bott function. Finally, we build the chain isomorphism between the invariant Thom-Smale complex and …

Lower Bounds For The Total Distance $K$-Domination Number Of A Graph, Randy R. Davila

Theory & Applications of Graphs

For $k \geq 1$ and a graph $G$ without isolated vertices, a \emph{total distance $k$-dominating set} of $G$ is a set of vertices $S \subseteq V(G)$ such that every vertex in $G$ is within distance $k$ to some vertex of $S$ other than itself. The \emph{total distance $k$-domination number} of $G$ is the minimum cardinality of a total $k$-dominating set in $G$ and is denoted by $\gamma_{k}^t(G)$. When $k=1$, the total $k$-domination number reduces to the \emph{total domination number}, written $\gamma_t(G)$; that is, $\gamma_t(G) = \gamma_{1}^t(G)$. This paper shows that several known lower bounds on the total domination number generalize …

The Integer-Antimagic Spectra Of A Weak Join Of Hamiltonian Graphs, Ugur Odabasi, Dan Roberts, Richard M. Low

Theory & Applications of Graphs

A simple graph $G$ with vertex set $V(G)$ and edge set $E(G)$ is \emph{$\mathbb{Z}_{k}$-antimagic} if there exists a function $f: E(G) \to \mathbb{Z}_{k} \backslash \{0\}$ such that the induced function $f^+(v)=\sum_{uv\in E(G)} f(uv)$ is injective. The \textit{integer-antimagic spectrum} of a graph $G$ is the set IAM$(G) = \{k: G \textnormal{ is } \mathbb{Z}_k\textnormal{-antimagic and } k \geq 2\}$. A \emph{weak join} of vertex-disjoint graphs is the collection of the graphs with additional simple edges (possibly none) between the original graphs. In this paper, we characterize IAM$(H)$ where $H$ is a weak join of Hamiltonian graphs.

Prime Labelings On A 3xn Grid Graph, Stephen J. Curran, Matt A. Ollis

Theory & Applications of Graphs

It is conjectured that the mxn grid graph has a prime labeling for all positive integers m and n. It is known that for any prime p and any integer n such that 1≤n≤p², there exists a prime labeling on the pxn grid graph P_m x P_n. Also, it is known that the ladder P₂ x P_n has a prime labeling for all positive integers n. We assume that Goldbach's Even Conjecture and a strengthened variant of Lemoine's Conjecture are true in order to show that the 3xn grid graph P …

A Selective Discontinuous Galerkin Implicit Particle-In-Cell Method For Plasma Simulation With Improved Interpolation, Siyu Wu, Yang Li, Hongtao Liu, Xiaoming He, Yong Cao

Mathematics and Statistics Faculty Research & Creative Works

This article dynamically incorporates multiple ideas into the existing direct implicit particle-in-cell (DIPIC) method for plasma simulation, in order to dramatically improve the DIPIC method for its local mesh refinement needs based on Cartesian meshes as well as its interpolation needs based on the locally refined meshes. One key tool is to utilize the selective discontinuous Galerkin method, which is based on the interior penalty discontinuous Galerkin formulation and the regular local finite element basis functions, as the electric field solver in the DIPIC simulation. This hybrid type finite element method combines the advantages of both continuous and discontinuous finite …

A Short Proof Of The Lemma Of The Logarithmic Derivative In Several Complex Variables, Qi Han, Jingbo Liu

All Faculty Scholarship (Archived)

In this work, we provide a concise proof of the logarithmic derivative lemma in Cⁿ. We start by giving a complete proof of a critical result by Biancofiore and Stoll (Ann. of Math. Stud., No. 100, 29–45, 1981) via matrix theory, which is central to this area of study. Then, we follow Li (Trans. Amer. Math. Soc. 363, 6257–6267, 2011) and Ye (Math. Z. 222, 81–95, 1996) to present the shortest proof to date.

Agent-Based Modeling: Introduction And Actuarial Applications, Rick Gorvett

Mathematics and Economics Faculty Working Papers

Agent-based modeling (ABM) has become an important and valued approach to modeling complex systems. In this paper, I advocate for actuaries to recognize the complex systems-nature of socioeconomic and risk processes and for ABM models to become a regular resource in our actuarial toolkits. These models allow for the observation of potential macro-behavior emerging from the underlying agent-level micro-activity and characteristics. Therefore, ABM models can provide significant insight into the quantification of risk and the identification of optimal strategies. This paper is an introduction and guide to ABM models, and it includes several case studies to illustrate their utility.

Math 115: College Algebra Instructor Guide, Seth Lehman

Open Educational Resources

OER instructor guide for Math 115, College Algebra, Queens College

Conditional Quantization For Some Discrete Distributions, Edgar A. Gonzalez, Mrinal Kanti Roychowdhury, David A. Salinas, Vishal Veeramachaneni

School of Mathematical & Statistical Sciences Faculty Publications

Quantization for a Borel probability measure refers to the idea of estimating a given probability by a discrete probability with support containing a finite number of elements. If in the quantization some of the elements in the finite support are preselected, then the quantization is called a conditional quantization. In this paper, we have determined the conditional quantization, first for two different finite discrete distributions with a same conditional set, and for a finite discrete distribution with two different conditional sets. Next, we have determined the conditional and unconditional quantization for an infinite discrete distribution with support {12𝑛:𝑛∈ℕ}. We have …

All Graphs Of Order N With Distinguishing Number N−1 Or N − 2, Andi Pujo Rahadi, Edy Tri Baskoro, Suhadi Wido Saputro

Theory & Applications of Graphs

Let G be a simple connected graph. The distinguishing number of G, denoted by D(G), is the least integer d such that G has a vertex d-labeling preserved only by the trivial automorphism. In this paper, we characterize all graphs of order n with distinguishing number n − 1, or n − 2.

Similarity Metrics, Metrics, And Conditionally Negative Definite Functions, Daniel Alpay, Liora Mayats-Alpay

Mathematics, Physics, and Computer Science Faculty Articles and Research

We give an example of a similarity metric which is not positive definite, and present a general theorem which provides a large family of similarity metrics which are positive definite.

Global Attractivity Of Positive Solutions Of Higher Order Nonlinear Difference Equations And Its Applications, Abdulaziz Almaslokh

Theses and Dissertations

Difference equations play an effective role in many mathematical models that represent some phenomena in different fields such as physics, economics, engineering and biology. From this perspective, studying and analyzing such equations are interesting issues for the advancement of scientific research. In particular, studying the asymptotic behavior of positive solutions of some population models that are a system of difference equations has become a necessity. In this dissertation, we examine the global attractivity of positive solutions of certain higher order nonlinear difference equations and apply these results to some population models.

Entanglement Distribution Of Universal Quantum Cloners, James B. Daughtry

Student Scholarship

Szab`o et al. [4] show that universal quantum cloning machines may be used to manipulate entanglement between bipartite states. Entanglement is measured with concurrence, C, and it is shown that as the fidelity of the cloner improves, more entanglement transfers from the reference to the cloned state. This thesis characterizes the nature of this entanglement transfer by analyzing the entanglement distribution of the cloner. In this analysis we will show that entanglement is generally destroyed after cloning except in cases where there is no cloning, two identical qubits are created, or there is complete qubit transfer. Along with …

On The Special Cases Of Carmichael’S Totient Conjecture, Christopher Saito

UNLV Theses, Dissertations, Professional Papers, and Capstones

Euler’s totient function, φ(n), is the arithmetic function defined as the number of positive integers less than or equal to n that are relatively prime to n. In his 1922 paper [3], Professor R. D. Carmichael conjectured that for each positive integer n, there exists at least one positive integer m̸ = n such that φ(m) = φ(n).In this thesis, we consider some relevant literature and explore Carmichael’s totient conjecture for particular values of φ(n) = k. Our main consideration will be the set X_k = {n ∈ N : φ(n) = k}. In identifying X_k for k = 2^t, …

The Concept Of T-Basis And Vector-Valued Hardy Classes, Bilal Bilalov, Sabina Rahib Sadigova

Turkish Journal of Mathematics

This paper introduces the concept of a t-basis generated by some bilinear mapping t(·;·). It is considered the vector-valued class L_p(X) := L_p(J; X), 1 ≤ p < +∞, where J = [−π, π] and X is a Banach space with the UMD property, and it is proven that the classical system of exponents {e^int}_n∈ℤ forms a t-basis for L_p(X), 1 < p < +∞. Using this fact, the Hardy vector classes _nH_p^±(X), 1 < p < +∞, different from the classical ones, are defined, and an equivalent definition of these classes is given and some of their properties are studied. In addition, the concept of t-Riesz property of a system of exponentials is introduced in L_p(X), 1 < p < +∞, and it is proved that this system has the t-Riesz property. A new method is given for establishing the Plemelj–Sokhotski formulas for X-valued Cauchy type integrals when X has the UMD property. An abstract analogue of the “1/4-Kadets” theorem is obtained for …