Mathematics Commons^™

Limit Theorems For L-Functions In Analytic Number Theory, Asher Roberts

Dissertations, Theses, and Capstone Projects

We use the method of Radziwill and Soundararajan to prove Selberg’s central limit theorem for the real part of the logarithm of the Riemann zeta function on the critical line in the multivariate case. This gives an alternate proof of a result of Bourgade. An upshot of the method is to determine a rate of convergence in the sense of the Dudley distance. This is the same rate Selberg claims using the Kolmogorov distance. We also achieve the same rate of convergence in the case of Dirichlet L-functions. Assuming the Riemann hypothesis, we improve the rate of convergence by using …

Aspects Of Stochastic Geometric Mechanics In Molecular Biophysics, David Frost

All Dissertations

In confocal single-molecule FRET experiments, the joint distribution of FRET efficiency and donor lifetime distribution can reveal underlying molecular conformational dynamics via deviation from their theoretical Forster relationship. This shift is referred to as a dynamic shift. In this study, we investigate the influence of the free energy landscape in protein conformational dynamics on the dynamic shift by simulation of the associated continuum reaction coordinate Langevin dynamics, yielding a deeper understanding of the dynamic and structural information in the joint FRET efficiency and donor lifetime distribution. We develop novel Langevin models for the dye linker dynamics, including rotational dynamics, based …

The Vanishing Discount Method For Stochastic Control: A Linear Programming Approach, Brian Hospital

Theses and Dissertations

Under consideration are convergence results between optimality criteria for two infinite-horizon stochastic control problems: the long-term average problem and the $\alpha$-discounted problem, where $\alpha \in (0,1]$ is a given discount rate. The objects under control are those stochastic processes that arise as (relaxed) solutions to a controlled martingale problem; and such controlled processes, subject to a given budget constraint, comprise the feasible sets for the two stochastic control problems.

In this dissertation, we define and characterize the expected occupation measures associated with each of these stochastic control problems, and then reformulate each problem as an equivalent linear program over a …

Efficient Handover Mechanisms For Heterogeneous Networks., Shankar Kumar Ghosh Dr.

Doctoral Theses

In this thesis, some analytical frameworks have been developed to analyze the effect of different system parameters on handover performances in heterogeneous network (HetNet) and based on such frameworks, some efficient handover algorithms have been proposed. The study starts with an analytical framework to investigate the effect of resource allocation mechanisms, upper layer mobility management protocols (MMPs) and handover decision metrics on user perceived throughput. This analysis reveals that among other factors, handover decision metric plays a crucial role in determining user perceived throughput in HetNet. Subsequently, we develop two handover decision metrics for ultra dense networks (UDN) and unlicensed …

A Functional Optimization Approach To Stochastic Process Sampling, Ryan Matthew Thurman

USF Tampa Graduate Theses and Dissertations

The goal of the current research project is the formulation of a method for the estimation and modeling of additive stochastic processes with both linear- and cycle-type trend components as well as a relatively robust noise component in the form of Levy processes. Most of the research in stochastic processes tends to focus on cases where the process is stationary, a condition that cannot be assumed for the model above due to the presence of the cyclical sub-component in the overall additive process. As such, we outline a number of relevant theoretical and applied topics, such as stochastic processes and …

A Brief Treatise On Bayesian Inverse Regression., Debashis Chatterjee Dr.

Doctoral Theses

Inverse problems, where in a broad sense the task is to learn from the noisy response about some unknown function, usually represented as the argument of some known functional form, has received wide attention in the general scientific disciplines. However, apart from the class of traditional inverse problems, there exists another class of inverse problems, which qualify as more authentic class of inverse problems, but unfortunately did not receive as much attention.In a nutshell, the other class of inverse problems can be described as the problem of predicting the covariates corresponding to given responses and the rest of the data. …

Essays In Behavioral Social Choice Theory., Sarvesh Bandhu Dr.

Doctoral Theses

This thesis comprises four essays on social choice theory. The first three essays/chapters consider models where voters follow “non-standard” rules for decision making. The last chapter considers the binary social choice model and analyzes the consequences of a new axiom. The first chapter introduces a new axiom for manipulability when voters incur a cost if they misreport their true preference ordering. The second chapter considers the random voting model with strategic voters where standard stochastic dominance strategy-proofness is replaced by strategy-proofness under two lexicographic criteria. The third chapter also considers the random voting model but from a non-strategic perspective. It …

Quantum Markov Maps: Structureand Asymptotics., Vijaya Kumar U. Dr.

Doctoral Theses

No abstract provided.

Essays In Social Choice Theory., Dipjyoti Majumdar Dr.

Doctoral Theses

The purpose of this thesis is to explore some issues in social choice theory and decision theory. Social choice theory provides the theoretical foundations for the field of public choice and welfare economics. It tries to bring together normative aspects like perspective value judgements and positive aspects, like strategic con- siderations. The second feature which is our focus, is closely related to the problem of providing appropriate incentives to agents, an issue of prime importance in eco- nomics.Consider for example, a set of agents who must elect one among a set of can- didates. These candidates may be physical agents …

Dynamic Neuromechanical Sets For Locomotion, Aravind Sundararajan

Doctoral Dissertations

Most biological systems employ multiple redundant actuators, which is a complicated problem of controls and analysis. Unless assumptions about how the brain and body work together, and assumptions about how the body prioritizes tasks are applied, it is not possible to find the actuator controls. The purpose of this research is to develop computational tools for the analysis of arbitrary musculoskeletal models that employ redundant actuators. Instead of relying primarily on optimization frameworks and numerical methods or task prioritization schemes used typically in biomechanics to find a singular solution for actuator controls, tools for feasible sets analysis are instead developed …

Analysis Of The Continuity Of The Value Function Of An Optimal Stopping Problem, Samuel Morris Nehls

Theses and Dissertations

In order to study model uncertainty of an optimal stopping problem of a stochastic process with a given state dependent drift rate and volatility, we analyze the effects of perturbing the parameters of the problem. This is accomplished by translating the original problem into a semi-infinite linear program and its dual. We then approximate this dual linear program by a countably constrained sub-linear program as well as an infinite sequence of finitely constrained linear programs. We find that in this framework the value function will be lower semi-continuous with respect to the parameters. If in addition we restrict ourselves to …

Combinatorial And Asymptotic Statistical Properties Of Partitions And Unimodal Sequences, Walter Mcfarland Bridges

LSU Doctoral Dissertations

Our main results are asymptotic zero-one laws satisfied by the diagrams of unimodal sequences of positive integers. These diagrams consist of columns of squares in the plane; the upper boundary is called the shape. For various types of unimodal sequences, we show that, as the number of squares tends to infinity, 100% of shapes are near a certain curve---that is, there is a single limit shape. Similar phenomena have been well-studied for integer partitions, but several technical difficulties arise in the extension of such asymptotic statistical laws to unimodal sequences. We develop a widely applicable method for obtaining these limit …

The Martingale Approach To Financial Mathematics, Jordan M. Rowley

Master's Theses

In this thesis, we will develop the fundamental properties of financial mathematics, with a focus on establishing meaningful connections between martingale theory, stochastic calculus, and measure-theoretic probability. We first consider a simple binomial model in discrete time, and assume the impossibility of earning a riskless profit, known as arbitrage. Under this no-arbitrage assumption alone, we stumble upon a strange new probability measure Q, according to which every risky asset is expected to grow as though it were a bond. As it turns out, this measure Q also gives the arbitrage-free pricing formula for every asset on our market. In …

Exact Sampling And Prefix Distributions, Sebastian Oberhoff

Theses and Dissertations

This thesis explores some new means to generate random numbers without incurring any numerical

inaccuracies along the way. In the context of continuous distributions this leads to the discussion of

prex distributions { discrete distributions that fully capture a continuous distribution by describing

their initial digits. These are rst studied graphically, then analytically, which also leads to a general

examination of the behavior of the distribution of trailing digits of continuous distributions. Finally,

some slightly novel, related results from the theory of computation are presented.

A Mathematical Analysis Of The Game Of Chess, John C. White

Selected Honors Theses

This paper analyzes chess through the lens of mathematics. Chess is a complex yet easy to understand game. Can mathematics be used to perfect a player’s skills? The work of Ernst Zermelo shows that one player should be able to force a win or force a draw. The work of Shannon and Hardy demonstrates the complexities of the game. Combinatorics, probability, and some chess puzzles are used to better understand the game. A computer program is used to test a hypothesis regarding chess strategy. Through the use of this program, we see that it is detrimental to be the first …

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 …

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, …

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.

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 …

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 …

A Study Of Poisson And Related Processes With Applications, Phillip Mingola

Chancellor’s Honors Program Projects

No abstract provided.

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 …

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 …