Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 13 of 13 for “"Tail asymptotics"”.
-
Tail Asymptotics for the Limiting Distribution of Theta Sums
… of \alpha and \beta. We then prove optimal tail asymptotics for the limiting distribution. More specifically, we prove that, according to the limiting distribution, the probability of landing outside a ball of sufficiently large radius $R$ for an explicit set of rational pairs (\alpha, …
-
Tail asymptotics of queueing networks with subexponential service times
This dissertation is concerned with the tail asymptotics of queueing networks with subexponential service time distributions. Our objective is to investigate the tail characteristics of key performance measures such as cycle times and waiting times on a variety of queueing models which may arise in …
-
Tail asymptotics of a sum of heavy-tailed distributions with application to risk theory /
… we investigate the asymptotic properties of both tail probability ant tail expectation of a randomly weighted sum with application to risk theory. In this sum primary random variables are real- valued and heavy-tailed, and random weights are nonnegative and nondegenerated at zero. The asymptotic …
-
The exact tail asymptotics behaviour of the joint stationary distributions of the generalized join the shortest queueing model
… Tauberian-like Theorem I investigate the exact tail asymptotic behaviour of the joint stationary distribution of the generating functions. In addition, I apply the results of the formulation of a general random walk model in the half plane to the Generalized-JSQ model, which is a queueing system …
-
Asymptotic properties of transformations of heavy-tailed distributions /
Over the years, heavy-tailed distributions have received considerable attention in a wide range of fields and are often used to model relatively rare but extreme events that classical distributions tend to underestimate. Since heavy-tailed behaviour is governed by large values in the tails, tail …
-
On Tail Equivalence to the Supremum : From Lévy to Compound Renewal Processes
… is typically intractable, in many settings the tail of the supremum is asymptotically equivalent to that of the underlying process, a phenomenon we call tail equivalence to the supremum. In this thesis we study certain cases where such equivalence holds. By highlighting a certain property, which …
-
Invasion percolation on regular trees : structure, scaling limit and ponds
… of the sub-critical parameters, we obtain detailed results such as scaling formulas for the r-point functions, limiting Laplace transforms for the level sizes and volumes within balls, and mutual singularity compared to the incipient infinite cluster. Chapter 3 gives the scaling limit of the …
-
On the densities of the limiting distributions for QuickSort and QuickQuant
… function f enjoys superpolynomial decay in both tails. The first contribution of this dissertation is to establish upper and lower asymptotic bounds for the left and right tails of f that are nearly matching in each tail. The literature study of the scale-normalized number of key comparisons used …
-
Towards formal verification of Bayesian inference in probabilistic programming via guaranteed bounds
… distributions, including bounds on moments and tail asymptotics.</p> <p>All these methods enjoy desirable theoretical properties, such as soundness and, in many cases, convergence to the exact result as the computational budget increases. Experimental evaluations demonstrate that they are …
-
Large deviations for semi-exponential distributions: theory and applications
… for Lévy processes and random walks with heavy-tailed Weibull (semi-exponential) increments. This result holds in the Skorokhod space with respect to the M1’ topology. In addition, we prove the extended sample path LDP in the Skorokhod space with the finer J1 topology. Furthermore, we develop …
-
Delay-sensitive Communications Code-Rates, Strategies, and Distributed Control
An ever increasing demand for instant and reliable information on modern communication networks forces codewords to operate in a non-asymptotic regime. To achieve reliability for imperfect channels in this regime, codewords need to be retransmitted from receiver to the transmit buffer, aided by a …