中文
相关论文

相关论文: Antipersistent binary time series

200 篇论文

Negative avoiding sequences of span $n$ are periodic sequences of elements from $\mathbb{Z}_k$ for some $k$ with the property that no $n$-tuple occurs more than once in a period and if an $n$-tuple does occur then its negative does not.…

组合数学 · 数学 2026-04-24 Chris J Mitchell , Peter R Wild

Nonlinear complexity is an important measure for assessing the randomness of sequences. In this paper we investigate how circular shifts affect the nonlinear complexities of finite-length binary sequences and then reveal a more explicit…

信息论 · 计算机科学 2024-04-26 Qin Yuan , Chunlei Li , Xiangyong Zeng , Tor Helleseth , Debiao He

Many empirical time series are genuinely symbolic: examples range from link activation patterns in network science, DNA coding or firing patterns in neuroscience to cryptography or combinatorics on words. In some other contexts, the…

混沌动力学 · 物理学 2023-07-19 Lluis Arola-Fernandez , Lucas Lacasa

The discrepancy of a binary string is the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string. In this note we determine the minimal discrepancy that a…

离散数学 · 计算机科学 2024-07-25 Nicolás Álvarez , Verónica Becher , Martín Mereb , Ivo Pajor , Carlos Miguel Soto

Time irreversibility, defined as the lack of invariance of the statistical properties of a system or time series under the operation of time reversal, has received an increasing attention during the last decades, thanks to the information…

数据分析、统计与概率 · 物理学 2021-11-03 Massimiliano Zanin

We consider the problem of sequentially testing for changes in the mean parameter of a time series, compared to a benchmark period. Most tests in the literature focus on the null hypothesis of a constant mean versus the alternative of a…

统计方法学 · 统计学 2025-09-23 Patrick Bastian , Tim Kutta , Rupsa Basu , Holger Dette

The extent to which a sequence of finite length differs from a shifted version of itself is measured by its aperiodic autocorrelations. Of particular interest are sequences whose entries are 1 or -1, called binary sequences, and sequences…

信息论 · 计算机科学 2016-02-12 Kai-Uwe Schmidt

This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such…

组合数学 · 数学 2026-03-20 Chris J Mitchell , Peter R Wild

A de Bruijn array code is a set of $r \times s$ binary doubly-periodic arrays such that each binary $n \times m$ matrix is contained exactly once as a window in one of the arrays. Such a set of arrays can be viewed as a two-dimensional…

信息论 · 计算机科学 2024-12-09 Tuvi Etzion

Binary time series data are very common in many applications, and are typically modelled independently via a Bernoulli process with a single probability of success. However, the probability of a success can be dependent on the outcome…

统计方法学 · 统计学 2024-06-12 Louise Kimpton , Peter Challenor , Henry Wynn

Analogously to de Bruijn sequences, orientable sequences have application in automatic position-location applications and, until recently, studies of these sequences focused on the binary case. In recent work by Alhakim et al., a range of…

组合数学 · 数学 2026-03-20 Chris J Mitchell , Peter R Wild

If A is a set of nonnegative integers containing 0, then there is a unique nonempty set B of nonnegative integers such that every positive integer can be written in the form a+b, where a\in A and b\in B, in an even number of ways. We…

数论 · 数学 2010-03-04 Joshua N. Cooper , Dennis Eichhorn , Kevin O'Bryant

For positive integers $k,n$, a de Bruijn sequence $B(k,n)$ is a finite sequence of elements drawn from $k$ characters whose subwords of length $n$ are exactly the $k^n$ words of length $n$ on $k$ characters. This paper introduces the…

组合数学 · 数学 2016-08-31 Christie S. Burris , Francis C. Motta , Patrick D. Shipman

We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…

组合数学 · 数学 2026-03-20 Abbas Alhakim , Chris J. Mitchell , Janusz Szmidt , Peter R. Wild

In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…

信息论 · 计算机科学 2023-12-27 Sicheng Liang , Xiangyong Zeng , Zibi Xiao , Zhimin Sun

Hyperbolic decay time series such as, fractional Gaussian noise (FGN) or fractional autoregressive moving-average (FARMA) process, each exhibit two distinct types of behaviour: strong persistence or antipersistence. Beran (1994)…

统计理论 · 数学 2016-11-04 A. Ian McLeod

We propose an informal test for stationarity in a time series which checks for the compatibility of nonlinear approximations to the dynamics made in different segments of the sequence. The segments are compared directly, rather than via…

chao-dyn · 物理学 2009-10-31 Thomas Schreiber

When do nonparametric Bayesian procedures ``overfit''? To shed light on this question, we consider a binary regression problem in detail and establish frequentist consistency for a certain class of Bayes procedures based on hierarchical…

统计理论 · 数学 2007-06-13 Marc Coram , Steven P. Lalley

Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this paper, the structure of n-periodic binary…

信息论 · 计算机科学 2026-02-03 Qin Yuan , Chunlei Li , Xiangyong Zeng

The existence of forbidden patterns, i.e., certain missing sequences in a given time series, is a recently proposed instrument of potential application in the study of time series. Forbidden patterns are related to the permutation entropy,…

统计金融 · 定量金融 2009-11-13 Massimiliano Zanin
‹ 上一页 1 2 3 10 下一页 ›