Other Mathematics Commons^™

Embedding Oriented Graphs In Books, Stacey R. Mcadams

Doctoral Dissertations

A book consists of a line L in [special characters omitted]3, called the spine, and a collection of half planes, called pages, whose common boundary is L. A k-book is book with k pages. A k-page book embedding is a continuous one-to-one mapping of a graph G into a book such that the vertices are mapped into L and the edges are each mapped to either the spine or a particular page, such that no two edges cross in any page. Each page contains a planar subgraph of G. The book thickness, denoted bt( …

The Distribution Of The Number Of Clusters In The Arratia Flow, Vladimir Fomichov

Communications on Stochastic Analysis

No abstract provided.

Krawtchouk-Griffiths Systems I: Matrix Approach, Philip Feinsilver

Communications on Stochastic Analysis

No abstract provided.

Krawtchouk-Griffiths Systems Ii: As Bernoulli Systems, Philip Feinsilver

Communications on Stochastic Analysis

No abstract provided.

Ergodic Control Of Stochastic Navier-Stokes Equation With Lévy Noise, Manil T Mohan, Sivaguru S Sritharan

Communications on Stochastic Analysis

No abstract provided.

Exponential Convergence Of The Stochastic Micropolar And Magneto-Micropolar Fluid Systems, Kazuo Yamazaki

Communications on Stochastic Analysis

No abstract provided.

A General Itô Formula For Adapted And Instantly Independent Stochastic Processes, Chii-Ruey Hwang, Hui-Hsiung Kuo, Kimiaki Saitô, Jiayu Zhai

Communications on Stochastic Analysis

No abstract provided.

Path Functionals Of A Class Of Lévy Insurance Risk Processes, Ekaterina T Kolkovska, Ehyter M Martin-González

Communications on Stochastic Analysis

No abstract provided.

A Survey Of Graphs Of Minimum Order With Given Automorphism Group, Jessica Alyse Woodruff

Math Theses

We survey vertex minimal graphs with prescribed automorphism group. Whenever possible, we also investigate the construction of such minimal graphs, confirm minimality, and prove a given graph has the correct automorphism group.

Bayesian Peer Calibration With Application To Alcohol Use, Miles Q. Ott, Joseph W. Hogan, Krista J. Gile, Crystal Linkletter, Nancy P. Barnett

Statistical and Data Sciences: Faculty Publications

Peers are often able to provide important additional information to supplement self-reported behavioral measures. The study motivating this work collected data on alcohol in a social network formed by college students living in a freshman dormitory. By using two imperfect sources of information (self-reported and peer-reported alcohol consumption), rather than solely self-reports or peer-reports, we are able to gain insight into alcohol consumption on both the population and the individual level, as well as information on the discrepancy of individual peer-reports. We develop a novel Bayesian comparative calibration model for continuous, count and binary outcomes that uses covariate information to …

Definition Of A Method For The Formulation Of Problems To Be Solved With High Performance Computing, Ramya Peruri

Master of Science in Computer Science Theses

Computational power made available by current technology has been continuously increasing, however today’s problems are larger and more complex and demand even more computational power. Interest in computational problems has also been increasing and is an important research area in computer science. These complex problems are solved with computational models that use an underlying mathematical model and are solved using computer resources, simulation, and are run with High Performance Computing. For such computations, parallel computing has been employed to achieve high performance. This thesis identifies families of problems that can best be solved using modelling and implementation techniques of parallel …

Hybrid Chebyshev Polynomial Scheme For The Numerical Solution Of Partial Differential Equations, Balaram Khatri Ghimire

Dissertations

In the numerical solution of partial differential equations (PDEs), it is common to find situations where the best choice is to use more than one method to arrive at an accurate solution. In this dissertation, hybrid Chebyshev polynomial scheme (HCPS) is proposed which is applied in two-step approach and one-step approach. In the two-step approach, first, Chebyshev polynomials are used to approximate a particular solution of a PDE. Chebyshev nodes which are the roots of Chebyshev polynomials are used in the polynomial interpolation due to its spectral convergence. Then, the resulting homogeneous equation is solved by boundary type methods including …

Applications Of Discrete Mathematics For Understanding Dynamics Of Synapses And Networks In Neuroscience, Caitlyn Parmelee

Department of Mathematics: Dissertations, Theses, and Student Research

Mathematical modeling has broad applications in neuroscience whether we are modeling the dynamics of a single synapse or the dynamics of an entire network of neurons. In Part I, we model vesicle replenishment and release at the photoreceptor synapse to better understand how visual information is processed. In Part II, we explore a simple model of neural networks with the goal of discovering how network structure shapes the behavior of the network.

Vision plays an important role in how we interact with our environments. To fully understand how visual information is processed requires an understanding of the way signals are …

Multilevel Models For Longitudinal Data, Aastha Khatiwada

Electronic Theses and Dissertations

Longitudinal data arise when individuals are measured several times during an ob- servation period and thus the data for each individual are not independent. There are several ways of analyzing longitudinal data when different treatments are com- pared. Multilevel models are used to analyze data that are clustered in some way. In this work, multilevel models are used to analyze longitudinal data from a case study. Results from other more commonly used methods are compared to multilevel models. Also, comparison in output between two software, SAS and R, is done. Finally a method consisting of fitting individual models for each …

Newsvendor Models With Monte Carlo Sampling, Ijeoma W. Ekwegh

Electronic Theses and Dissertations

Newsvendor Models with Monte Carlo Sampling by Ijeoma Winifred Ekwegh The newsvendor model is used in solving inventory problems in which demand is random. In this thesis, we will focus on a method of using Monte Carlo sampling to estimate the order quantity that will either maximizes revenue or minimizes cost given that demand is uncertain. Given data, the Monte Carlo approach will be used in sampling data over scenarios and also estimating the probability density function. A bootstrapping process yields an empirical distribution for the order quantity that will maximize the expected profit. Finally, this method will be used …

An Algorithm For The Machine Calculation Of Minimal Paths, Robert Whitinger

Electronic Theses and Dissertations

Problems involving the minimization of functionals date back to antiquity. The mathematics of the calculus of variations has provided a framework for the analytical solution of a limited class of such problems. This paper describes a numerical approximation technique for obtaining machine solutions to minimal path problems. It is shown that this technique is applicable not only to the common case of finding geodesics on parameterized surfaces in R³, but also to the general case of finding minimal functionals on hypersurfaces in Rⁿ associated with an arbitrary metric.

The Greatest Integer Function, Alanna Rae

Journal of Humanistic Mathematics

No abstract provided.

Kolmogorov’S Axioms For Probabilities With Values In Hyperbolic Numbers, Daniel Alpay, M. E. Luna-Elizarrarás, Michael Shapiro

Mathematics, Physics, and Computer Science Faculty Articles and Research

We introduce the notion of a probabilistic measure which takes values in hyperbolic numbers and which satisfies the system of axioms generalizing directly Kolmogorov’s system of axioms. We show that this new measure verifies the usual properties of a probability; in particular, we treat the conditional hyperbolic probability and we prove the hyperbolic analogues of the multiplication theorem, of the law of total probability and of Bayes’ theorem. Our probability may take values which are zero–divisors and we discuss carefully this peculiarity.

Development Of Utility Theory And Utility Paradoxes, Timothy E. Dahlstrom

Lawrence University Honors Projects

Since the pioneering work of von Neumann and Morgenstern in 1944 there have been many developments in Expected Utility theory. In order to explain decision making behavior economists have created increasingly broad and complex models of utility theory. This paper seeks to describe various utility models, how they model choices among ambiguous and lottery type situations, and how they respond to the Ellsberg and Allais paradoxes. This paper also attempts to communicate the historical development of utility models and provide a fresh perspective on the development of utility models.

Representation And Gaussian Bounds For The Density Of Brownian Motion With Random Drift, Azmi Makhlouf

Communications on Stochastic Analysis

No abstract provided.