Mathematics Commons^™

The Battle Against Malaria: A Teachable Moment, Randy K. Schwartz

Journal of Humanistic Mathematics

Malaria has been humanity’s worst public health problem throughout recorded history. Mathematical methods are needed to understand which factors are relevant to the disease and to develop counter-measures against it. This article and the accompanying exercises provide examples of those methods for use in lower- or upper-level courses dealing with probability, statistics, or population modeling. These can be used to illustrate such concepts as correlation, causation, conditional probability, and independence. The article explains how the apparent link between sickle cell trait and resistance to malaria was first verified in Uganda using the chi-squared probability distribution. It goes on to explain …

Influences Of Probability Instruction On Undergraduates' Understanding Of Counting Processes, Kayla Blyman

Theses and Dissertations--Education Sciences

Historically, students in an introductory finite mathematics course at a major university in the mid-south have struggled the most with the counting and probability unit, leading instructors to question if there was a better way to help students master the material. The purpose of this study was to begin to understand connections that undergraduate finite mathematics students are making between counting and probability. By examining student performance in counting and probability, this study provides insights that inform future instruction in courses that include counting and probability. Consequently, this study lays the groundwork for future inquiries in the field of undergraduate …

Combining Interval, Probabilistic, And Other Types Of Uncertainty In Engineering Applications, Andrew Martin Pownuk

Open Access Theses & Dissertations

In many practical application, we process measurement results and expert estimates. Measurements and expert estimates are never absolutely accurate, their result are slightly different from the actual (unknown) values of the corresponding quantities. It is therefore desirable to analyze how this measurement and estimation inaccuracy affects the results of data processing.

There exist numerous methods for estimating the accuracy of the results of data processing under different models of measurement and estimation inaccuracies: probabilistic, interval, and fuzzy. To be useful in engineering applications, these methods should provide accurate estimate for the resulting uncertainty, should not take too much computation time, …

Oscillation Of Quenched Slowdown Asymptotics Of Random Walks In Random Environment In Z, Sung Won Ahn

Open Access Dissertations

We consider a one dimensional random walk in a random environment (RWRE) with a positive speed limn→∞ (Xn/) = υα > 0. Gantert and Zeitouni showed that if the environment has both positive and negative local drifts then the quenched slowdown probabilities P ω(Xn < xn) with x∈ (0,υα) decay approximately like exp{- n1-1/s} for a deterministic s > 1. More precisely, they showed that n -γ log Pω(Xn < xn) converges to 0 or -∞ depending on whether γ > 1 - 1/s or γ < 1 - 1/ s. In this paper, …

Martingales, Singular Integrals, And Fourier Multipliers, Michael A. Perlmutter

Open Access Dissertations

Many probabilistic constructions have been created to study the Lp-boundedness, 1 < p < ∞, of singular integrals and Fourier multipliers. We will use a combination of analytic and probabilistic methods to study analytic properties of these constructions and obtain results which cannot be obtained using probability alone.

In particular, we will show that a large class of operators, including many that are obtained as the projection of martingale transforms with respect to the background radiation process of Gundy and Varapolous or with respect to space-time Brownian motion, satisfy the assumptions of Calderón-Zygmund theory and therefore boundedly map L1 to weak- L1.

We will also use a method of rotations to study the L p boundedness, 1 < p < ∞, of Fourier multipliers which are obtained as the projections of martingale transforms with respect to symmetric α-stable processes, 0 < α < 2. Our proof does not use the fact that 0 < α < 2 and therefore allows us to obtain a larger class of multipliers, indexed by a parameter, 0 < r < ∞, which are bounded on L p. As in the case of the multipliers which arise as the projection of martingale …

Sexual Assault And The Doctrine Of Chances, Ryan Wallentine

Undergraduate Honors Capstone Projects

Sexual assault is a crime whose offenders often commit multiple acts and its victims experience devastating effects. The doctrine of chances is a rule of evidence that may allow evidences of these past events or circumstances to be presented in a court case given they meet certain criteria. This research argues the probability of being innocently prosecuted for rape multiple times is sufficiently low to meet at least one of the criteria for the doctrine of chances to be used in a sexual assault case. Additional implications and related areas of research are included as well.

Inference On Time-To-Event Distribution From Retrospective Data With Imperfect Recall., Sedigheh Salehabadi Dr.

Doctoral Theses

Time-to-event data arises from measurements of time till the occurrence of an event of interest. Such data are common in the fields of biology, epidemiology, pub- lic health, medical research, economics and industry. The event of interest can be the death of a human being (Klein and Moeschberger, 2003), failure of a machine (Zhiguo et al., 2007), onset of menarche in adolescent and young adult females (Bergsten-Brucefors, 1976; Chumlea et al., 2003; Mirzaei, Sengupta and Das, 2015), onset (or relapse) of a disease (Klein and Moeschberger, 2003), dental develop- ment (Demirjian, Goldstien and Tanner, 1973; Eveleth and Tanner, 1990), breast …

A Computational And Theoretical Exploration Of The St. Petersburg Paradox, Alexander Olivero

Undergraduate Honors Thesis Collection

This thesis displays a sample distribution, generated from both a simulation (for large n) by computer program and explicitly calculated (for smaller n), that is not governed by the Central Limit Theorem and, in fact seems to display chaotic behavior. To our knowledge, the explicit calculation of the sample distribution function is new. This project outlines the results that have found a relation to number theory in a probabilistic game that has perplexed mathematicians for hundreds of years.

Combining Interval And Probabilistic Uncertainty In Engineering Applications, Andrew Martin Pownuk

Open Access Theses & Dissertations

In many practical application, we process measurement results and expert estimates. Measurements and expert estimates are never absolutely accurate, their result are slightly different from the actual (unknown) values of the corresponding quantities. It is therefore desirable to analyze how this measurement and estimation inaccuracy affects the results of data processing. There exist numerous methods for estimating the accuracy of the results of data processing under different models of measurement and estimation inaccuracies: probabilistic, interval, and fuzzy. To be useful in engineering applications, these methods should provide accurate estimate for the resulting uncertainty, should not take too much computation time, …

On The Analysis Of Some Recursive Equations In Probability., Arunangshu Biswas Dr.

Doctoral Theses

This thesis deals with recursive systems used in theoretical and applied probability. Recursive systems are stochastic processes {Xn}n≥1 where the Xn depends on the earlier Xn−1 and also on some increment process which is uncorrelated with the process Xn. The simplest example of a recursive system is the Random Walk, whose properties have been extensively studied. Mathematically a recursive system takes the form Xn = f(Xn−1, n), is the increment/ innovation procedure and f(·, ·) is a function on the product space of xn and n. We first consider a recursive system called Self-Normalized sums (SNS) corresponding to a sequence …

Some Studies On Selected Stream Ciphers Analysis Fault Attack & Related Results., Subhadeep Banik Dr.

Doctoral Theses

Stream Ciphers are important Symmetric Cryptological primitives, built for the purpose of providing secure message encryption. As no formal security proofs exist, our confidence in these algorithms is largely based on the fact that intense cryptanalysis has been carried out over several years without revealing any weakness. This thesis makes some independent contributions to the cryptanalysis of a selection of stream ciphers.In this thesis, we take a closer look at two stream ciphers viz. RC4+ designed by Maitra et al. at Indocrypt 2008 and GGHN designed by Gong et al. at CISC 2005. Both these ciphers were designed as viable …

Boundary Problems For One And Two Dimensional Random Walks, Miky Wright

Masters Theses & Specialist Projects

This thesis provides a study of various boundary problems for one and two dimensional random walks. We first consider a one-dimensional random walk that starts at integer-valued height k > 0, with a lower boundary being the x-axis, and on each step moving downward with probability q being greater than or equal to the probability of going upward p. We derive the variance and the standard deviation of the number of steps T needed for the height to reach 0 from k, by first deriving the moment generating function of T. We then study two types of two-dimensional random walks with …

Efficient Coupling For Random Walk With Redistribution, Elizabeth Tripp

Honors Scholar Theses

What can be said on the convergence to stationarity of a finite state Markov chain that behaves 'locally' like a nearest-neighbor random walk on the set of integers? In this work, we looked to obtain sharp bounds for the rate of convergence to stationarity for a particular non-symmetric Markov chain. Our Markov chain is a variant of the simple symmetric random walk on the state space {0, ..., N} obtained by allowing transitions from 0 to J₀ and from N to J_N. We first looked at the case where J₀ and J_N are fixed, deterministic …

Cycle Lengths Of Θ-Biased Random Permutations, Tongjia Shi

HMC Senior Theses

Consider a probability distribution on the permutations of n elements. If the probability of each permutation is proportional to θ^K, where K is the number of cycles in the permutation, then we say that the distribution generates a θ-biased random permutation. A random permutation is a special θ-biased random permutation with θ = 1. The m^th moment of the r^th longest cycle of a random permutation is Θ(n^m), regardless of r and θ. The joint moments are derived, and it is shown that the longest cycles of a permutation can either be positively or …

A Topics Analysis Model For Health Insurance Claims, Jared Anthony Webb

Theses and Dissertations

Mathematical probability has a rich theory and powerful applications. Of particular note is the Markov chain Monte Carlo (MCMC) method for sampling from high dimensional distributions that may not admit a naive analysis. We develop the theory of the MCMC method from first principles and prove its relevance. We also define a Bayesian hierarchical model for generating data. By understanding how data are generated we may infer hidden structure about these models. We use a specific MCMC method called a Gibbs' sampler to discover topic distributions in a hierarchical Bayesian model called Topics Over Time. We propose an innovative use …

Confidence Interval, Ursula Whitcher

Journal of Humanistic Mathematics

A poem about estimating probabilities.

Mathematics And The Hunger Games, Michael A. Lewis

Journal of Humanistic Mathematics

The Hunger Games plot features a dystopian future in which twelve outer districts are oppressed by a centralized capital. The story focuses on the heroism of a sixteen-year-old girl named Katniss and how she tries to rise above the oppression that she experiences. It also features a special lottery and other twists that are sources of mathematical interest. This essay focuses on some of the mathematical issues raised by The Hunger Games in an effort to show that this story can be used to teach students (as well as other interested parties) some important concepts from mathematics.

On Lattice Structure Of The Probability Functions On L*, Mashaallah Mashinchi, Ghader Khaledi

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, the set of all probability functions on L* is studied, where L* is the lattice of bothvalued fuzzy sets or intuitionistic fuzzy sets. It is shown that the set of all probability functions on L* endowed with two appropriate operations has a monoid structure which is also a distributive complete lattice. Also the lattice structure of the set of all probability functions on L* induced by an appropriate function on [0, 1] to itself is studied. Some lattice (dual) isomorphisms are discussed that suggests probabilities on L* could be considered in the framework of theories modeling imprecision.

Set: The Probabilities And Possibilities, Tabitha K. Bollinger

Undergraduate Theses and Capstone Projects

The card game SET involves finding groups o f three cards called SETs. Choices are based upon the individual card characteristics, including shape, pattern, number, and color. Previously, the maximum number o f cards that can be played without creating a SET has been determined as 20 cards by extensive computer work. This report further explored the probabilities and possibilities o f the game. Using discrete mathematics and probability, we explored how many SETs are possible and what strategies led to the most points. Additionally, this project exercised undergraduate logic and reasoning to generalize the results in order to be …

Non Bayesian Conditioning And Deconditioning, Jean Dezert, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we present a Non-Bayesian conditioning rule for belief revision. This rule is truly Non-Bayesian in the sense that it doesn’t satisfy the common adopted principle that when a prior belief is Bayesian, after conditioning by X, Bel(X|X) must be equal to one. Our new conditioning rule for belief revision is based on the proportional conflict redistribution rule of combination developed in DSmT (Dezert-Smarandache Theory) which abandons Bayes’ conditioning principle. Such Non-Bayesian conditioning allows to take into account judiciously the level of conflict between the prior belief available and the conditional evidence. We also introduce the deconditioning problem …

The Expectation Of Transition Events On Finite-State Markov Chains, Jeremy Michael West

Theses and Dissertations

Markov chains are a fundamental subject of study in mathematical probability and have found wide application in nearly every branch of science. Of particular interest are finite-state Markov chains; the representation of finite-state Markov chains by a transition matrix facilitates detailed analysis by linear algebraic methods. Previous methods of analyzing finite-state Markov chains have emphasized state events. In this thesis we develop the concept of a transition event and define two types of transition events: cumulative events and time-average events. Transition events generalize state events and provide a more flexible framework for analysis. We derive computable, closed-form expressions for the …

Confidence Intervals For The Ratio Of Two Exponential Means With Applications To Quality Control, James Albert Polcer,Iii

Student Research Conference Select Presentations

We considered the problem of statistical quality control based on the ratio of two population means. We restrict the discussion for two exponential rates, which are commonly used for modeling failure times of components, machines, or systems. Closed form expressions via the moment generation function (MGF) technique will be presented, and numerical examples will be shown using engineering data sets.

Teaching Probability Through Use Of An Applet, Melissa Gregory Jackson

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

The use of technology in the classroom is an ongoing debate by educators. Many teachers consider it to be a valuable teaching tool. Despite the many advantages, there are also drawbacks in using technology. A Java applet is a particular kind of multimedia technology proven to be useful in education. Because of students' struggles with learning basic probability in Statistics 1040, I have created a probability applet to reinforce the concept of probability. The applet was tested with two Statistics 1040 classes. The majority of students agreed that they learned more about probability from using the applet. Several of the …

Contributions To Random Energy Models., Nabin Kumar Jana Dr.

Doctoral Theses

In this introductory chapter, we begin with a brief description of spin glasses in section 1. We are not physicists. The purpose of this section is to trace the history of the models. Section 2 gives a brief summary of the thesis and section 3 recalls certain known facts which will be used later in the thesis.Origin of the problem The models considered in this thesis have their origin in spin glass theory. Roughly, spin glass is a glassy state in a spin system or a disordered material exhibiting high magnetic frustration. The origin of this behavior can be either …

Multiattribute Acceptance Sampling Plans., Anup Majumdar Dr.

Doctoral Theses

Irrespective of the type of product, evaluation of conformity to specified requirements of its quality characteristics is an integral part of quality assurance. Although they form a set of necessary verification activities almost at all stages of production, these activities, known as inspection do not add value to the product on their own and are to be kept at their minimum. The sampling inspection where a portion of a collection of product units is inspected on a set of characteristics with a view to making decision about acceptance or otherwise becomes relevant in this context.The number of elements of the …

Recounting The Odds Of An Even Derangement, Arthur T. Benjamin, Curtis D. Bennet, Florence Newberger

All HMC Faculty Publications and Research

No abstract provided in this article.

Some Nonparametric And Semiparametric Methods For Discriminant Analysis., Anil Kumar Ghosh Dr.

Doctoral Theses

Discriminant analysis (see e.g., Devijver and Kittler, 1982; Duda, Hart and Stork, 2000; Hastle, Tibahirani and Friedman, 2001) deals with the separation of different groups of obaervationa and allocation of a new oboervation to one of the previously delined grouga. In a J-class discriminant analysis problem, we usually hae a training sample of the form {(xk, ck) : k = 1,2,...,N}, where xk = (Ik1,Ik2,...J) is a d-dimensional measarement vector, and ca € {1,2,...,J} is its class label. On the basis of thia training sample, one aims to form a decision rule d(x) : Rd + (1,2,...,J} for clasifying the …

Some Statistical Contributions To The Analysis Of Human Genome Diversity And Evolution., Analabha Basu Dr.

Doctoral Theses

The work embodied in this thesis pertains to human population genetics. In particular, the overarching goals of this thesis are to contribute to the understanding of genomic diversity of human populations and to the development of statistical methods for making inferences in genome diversity studies. With these two goals in mind, we have carried out a detailed statistical analysis of genomic data on a large number of ethnic populations of India, generated in the laboratory of the Anthropology & Human Genetics Unit, Indian Statistical Institute, Kolkata. Additionally, wherever relevant, we have compared our data with those collated from the published …

Contributions To Emerging Techniques In Survey Sampling., Sanghamitra Pal Dr.

Doctoral Theses

This dissertation contains seven Chapters. The contents in the respective Chapters may be briefly recounted as follows.A topic of classical interest in survey sampling is how to ensure the existence of a uniformly non-negative (UNN) unbiased estimator for the mean square error (MSE) of a homogeneous linear estimator (HLE) for a finite survey population total. Hájek (1958), Vijayan (1975), Rao and Vijayan (1977) and Rao (1979) developed a number of results which boil down to the folowing as narrated in the monograph by Chaudhuri and Stenger (1992).If there exist non-zero constants w, and the unknown values y, of the variable …

I Don't Care If I Ever Get Back: Marathons Lasting 20 Or More Innings, Phil Lowry, Darren B. Glass

Math Faculty Publications

This article looks at marathon games of baseball. For purposes of this article, a marathon is defined as a game lasting 20 or more innings. In my research I have discovered 341 marathons. These games are hard to find. Leagues either keep no records, or keep track only of their longest game; only the Texas League keeps records on all marathons. Nobody has ever before explored such questions as: What is the probability a game will go x number of innings? How often should we expect a marathon of 20 or more innings, or 40 or more innings? What is …