Zobrazeno 1 - 10
of 200
pro vyhledávání: '"Fill, James Allen"'
Autor:
Fill, James Allen, Matterer, Jason
QuickSelect (aka Find), introduced by Hoare (1961), is a randomized algorithm for selecting a specified order statistic from an input sequence of $n$ objects, or rather their identifying labels usually known as keys. The keys can be numeric or symbol
Externí odkaz:
http://arxiv.org/abs/2412.12599
For $d\ge2$ and iid $d$-dimensional observations $X^{(1)},X^{(2)},\dots$ with independent Exponential$(1)$ coordinates, we revisit the study by Fill and Naiman (Electron. J. Probab., 2020) of the boundary (relative to the closed positive orthant), or
Externí odkaz:
http://arxiv.org/abs/2402.17221
Autor:
Fill, James Allen, Sun, Ao
Given a sequence of independent random vectors taking values in ${\mathbb R}^d$ and having common continuous distribution function $F$, say that the $n^{\rm \scriptsize th}$ observation sets a (Pareto) record if it is not dominated (in every coordina
Externí odkaz:
http://arxiv.org/abs/2402.17220
For a complex number $\alpha$, we consider the sum of the $\alpha$th powers of subtree sizes in Galton--Watson trees conditioned to be of size $n$. Limiting distributions of this functional $X_n(\alpha)$ have been determined for $\Re\alpha \neq 0$, r
Externí odkaz:
http://arxiv.org/abs/2212.10871
Autor:
Fill, James Allen
For a sequence of i.i.d. $d$-dimensional random vectors with independent continuously distributed coordinates, say that the $n$th observation in the sequence sets a record if it is not dominated in every coordinate by an earlier observation; for $j \
Externí odkaz:
http://arxiv.org/abs/2109.14846
Autor:
Fill, James Allen, Hung, Wei-Chun
We prove that, for every $0 \leq t \leq 1$, the limiting distribution of the scale-normalized number of key comparisons used by the celebrated algorithm QuickQuant to find the $t$th quantile in a randomly ordered list has a Lipschitz continuous densi
Externí odkaz:
http://arxiv.org/abs/2109.14749
Autor:
Fill, James Allen, Janson, Svante
We study the additive functional $X_n(\alpha)$ on conditioned Galton-Watson trees given, for arbitrary complex $\alpha$, by summing the $\alpha$th power of all subtree sizes. Allowing complex $\alpha$ is advantageous, even for the study of real $\alp
Externí odkaz:
http://arxiv.org/abs/2104.02715
Autor:
Fill, James Allen, Hung, Wei-Chun
We substantially refine asymptotic logarithmic upper bounds produced by Svante Janson (2015) on the right tail of the limiting QuickSort distribution function $F$ and by Fill and Hung (2018) on the right tails of the corresponding density $f$ and of
Externí odkaz:
http://arxiv.org/abs/1903.07775
Autor:
Fill, James Allen
Publikováno v:
Combinator. Probab. Comp. 30 (2021) 105-123
We establish a fundamental property of bivariate Pareto records for independent observations uniformly distributed in the unit square. We prove that the asymptotic conditional distribution of the number of records broken by an observation given that
Externí odkaz:
http://arxiv.org/abs/1901.08232
Autor:
Fill, James Allen, Naiman, Daniel Q.
We present, (partially) analyze, and apply an efficient algorithm for the simulation of multivariate Pareto records. A key role is played by minima of the record-setting region (we call these generators) each time a new record is generated, and two h
Externí odkaz:
http://arxiv.org/abs/1901.05621