Title Information
Title
Large Deviations Principles on Jackson Network and Importance Sampling for a Jump-Diffusion Process
Name: Personal
Name Part
Sun, Weifeng
Role
Role Term: Text
creator
Name: Personal
Name Part
Wang, Hui
Role
Role Term: Text
Advisor
Name: Personal
Name Part
Dong, Hongjie
Role
Role Term: Text
Reader
Name: Personal
Name Part
Pirjol, Dan
Role
Role Term: Text
Reader
Name: Corporate
Name Part
Brown University. Department of Applied Mathematics
Role
Role Term: Text
sponsor
Origin Information
Copyright Date
2019
Physical Description
Extent
ix, 77 p.
digitalOrigin
born digital
Note: thesis
Thesis (Ph. D.)--Brown University, 2019
Genre (aat)
theses
Abstract
Large deviations are classical topics of study that enjoy great practical application under probability theory. In essence, it studies the properties lie in the tail events of probability measure. In this thesis, we study two problems in both theoretical analyses of large deviation properties and numerical simulations. In the first part of the thesis, we investigate large deviation properties on Jackson networks embedded with preemptive service discipline. This preemptive service discipline introduces the discontinuous dynamics in the system. Thus the classical Cramer’s theorem cannot be utilized. The discontinuous statistics problem generated from preemptive service discipline is not fully studied and enjoys great practical applications. Aim at generating a general large deviation results, we prove the large deviation properties on a very common queuing network -- Jackson Network. The difficulty of this problem lies in showing the large deviation lower bound and possible additional “stability-at-the-interface” condition. In the thesis, we convert the large deviation problem into a stochastic control problem and utilize the weak convergence approach to justify that the “stability-at-the-interface” condition is automatically embedded in the system. The second part of the thesis concentrates on the numerical simulation of tail events. Importance sampling is a classical variance reduction technique and the art of importance sampling lies in the selection of alternative sampling distribution. The tail events are easy to simulate under a “good” alternative distribution. In this study, we select mixtures of exponential tilting distributions as a candidate and establish a cross-entropy iterative algorithm to approximate the optimal one. Then we utilize this technology to pricing some deep out-of-money options and achieve great variance reduction performance. Besides, some large deviation results for the cross-entropy solution are investigated.
Subject (fast) (authorityURI="http://id.worldcat.org/fast", valueURI="http://id.worldcat.org/fast/01025819")
Topic
Monte Carlo method
Subject (fast) (authorityURI="http://id.worldcat.org/fast", valueURI="http://id.worldcat.org/fast/00992659")
Topic
Large deviations
Subject
Topic
Probability
Subject (fast) (authorityURI="http://id.worldcat.org/fast", valueURI="http://id.worldcat.org/fast/01046902")
Topic
Options (Finance)--Prices--Mathematical models
Subject (fast) (authorityURI="http://id.worldcat.org/fast", valueURI="http://id.worldcat.org/fast/01085717")
Topic
Queuing theory--Mathematical models
Language
Language Term (ISO639-2B)
English
Record Information
Record Content Source (marcorg)
RPB
Record Creation Date (encoding="iso8601")
20190603
Identifier: DOI
10.26300/sn06-te46
Access Condition: rights statement (href="http://rightsstatements.org/vocab/InC/1.0/")
In Copyright
Access Condition: restriction on access
Collection is open for research.
Type of Resource (primo)
dissertations