The maximal and minimal 2-correlation of a class of 1-dependent 0-1 valued processes (Q5895239): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An algebraic construction of a class of one-dependent processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extremal two-correlations of two-valued stationary one-dependent processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rearrangements of \((0,-1)\) matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Problem of Plane Measure / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3259998 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On an inequality of A. Khintchine for zero-one matrices / rank | |||
Normal rank |
Revision as of 11:11, 21 June 2024
scientific article; zbMATH DE number 4172060
Language | Label | Description | Also known as |
---|---|---|---|
English | The maximal and minimal 2-correlation of a class of 1-dependent 0-1 valued processes |
scientific article; zbMATH DE number 4172060 |
Statements
The maximal and minimal 2-correlation of a class of 1-dependent 0-1 valued processes (English)
0 references
1988
0 references
The maximal and minimal value of \(P[X_ N=X_{N+1}=1]\) is computed for fixed \(P[X_ N=1]\), where \((X_ N)_{N\in {\mathbb{Z}}}\) is a 0-1 valued one-dependent process obtained by a coding (actually a two-block-factor) of an i.i.d. sequence of uniformly distributed random variables with a subset of the unit square. The discrete version of this problem is solved by the author [Compos. Math. 71, No.2, 139-179 (1989)].
0 references
one-dependent process
0 references
dynamical system
0 references
two-block-factor
0 references