arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.09025cs.ITmath.IT
收藏

马尔可夫源的联合串复杂度:小数据问题

Joint String Complexity for Markov Sources: Small Data Matters

Philippe Jacquet, Dimitris Milioris, Wojciech Szpankowski

摘要:

字符串复杂度被定义为给定字符串的所有不同单词(因子)的集合的基数。对于两个字符串,我们引入联合字符串复杂度作为两个字符串共有的一组单词的基数。字符串复杂性有许多应用,从捕捉语言的丰富性到寻找两个基因组序列之间的相似性。在本文中,我们分析了联合字符串的复杂性时,两个字符串产生的马尔可夫源。我们证明了联合字符串的复杂性线性增长(字符串长度方面)时,两个源是统计上不可区分的和次线性时,源是统计上不相同的。联合字符串的复杂性的精确分析是相当具有挑战性的,需要微妙的奇异性分析和鞍点方法在无穷多个鞍点,导致新的振荡现象与单,双周期。为了克服这些挑战,我们采用强大的分析技术,如多元生成函数,多元depoissonization和梅林变换,谱矩阵分析,和复杂的渐近方法。

英文摘要:

String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we introduce the joint string complexity as the cardinality of a set of words that are common to both strings. String complexity finds a number of applications from capturing the richness of a language to finding similarities between two genome sequences. In this paper we analyze the joint string complexity when both strings are generated by Markov sources. We prove that the joint string complexity grows linearly (in terms of the string lengths) when both sources are statistically indistinguishable and sublinearly when sources are statistically not the same. Precise analysis of the joint string complexity turns out to be quite challenging requiring subtle singularity analysis and saddle point method over infinity many saddle points leading to novel oscillatory phenomena with single and double periodicities. To overcome these challenges, we apply powerful analytic techniques such as multivariate generating functions, multivariate depoissonization and Mellin transform, spectral matrix analysis, and complex asymptotic methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑