Process convergence for the complexity of Radix Selection on Markov sources
Process convergence for the complexity of Radix Selection on Markov sources
复制标题
马尔可夫源上基数选择复杂性的过程收敛
DOI:
10.1016/j.spa.2018.03.009
复制
发表时间:
--
期刊:
影响因子:
--
通讯作者:
H. Sulzbach
中科院分区:
文献类型:
--
作者:
Leckey;Neininger;H. Sulzbach
A fundamental algorithm for selecting ranks from a finite subset of an ordered set is Radix Selection. This algorithm requires the data to be given as strings of symbols over an ordered alphabet, e.g., binary expansions of real numbers. Its complexity is measured by the number of symbols that have to be read. In this paper the model of independent data identically generated from a Markov chain is considered.The complexity is studied as a stochastic process indexed by the set of infinite strings over the given alphabet. The orders of mean and variance of the complexity and, after normalization, a limit theorem with a centered Gaussian process as limit are derived. This implies an analysis for two standard models for the ranks: uniformly chosen ranks, also called grand averages, and the worst case rank complexities which are of interest in computer science.For uniform data and the asymmetric Bernoulli model (i.e. memoryless sources), we also find weak convergence for the normalized process of complexities when indexed by the ranks while for more general Markov sources these processes are not tight under the standard normalizations.
登录
查看更多内容
影响因子:
0.5
作者:
J. Clément;J. A. Fill;T. N. Thi;B. Vallée
通讯作者:
B. Vallée
DOI:
--
发表时间:
2012
期刊:
arXiv.org
影响因子:
--
作者:
N. Broutin;Ralph Neininger;Henning Sulzbach
通讯作者:
Henning Sulzbach
DOI:
--
发表时间:
2013
期刊:
影响因子:
--
作者:
Mahmoud Ragab;U. Roesler
通讯作者:
U. Roesler
DOI:
--
发表时间:
2004
期刊:
影响因子:
--
作者:
Ralph Neininger;L. Rüschendorf
通讯作者:
L. Rüschendorf
DOI:
--
发表时间:
2004
期刊:
影响因子:
--
作者:
B. Overman
通讯作者:
B. Overman