{"entities":{"Q2380233":{"pageid":2390976,"ns":120,"title":"Item:Q2380233","lastrevid":72652335,"modified":"2026-04-14T06:19:01Z","type":"item","id":"Q2380233","labels":{"en":{"language":"en","value":"A \\(q\\)-analogue of de Finetti's theorem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5686781"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2380233$CA71C9C3-8133-49C2-9ECB-59C8ABBCD0ED","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"35e865f2de856f45a714bca71238d097bc56d3f1","datavalue":{"value":{"text":"A \\(q\\)-analogue of de Finetti's theorem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2380233$2C4D3C2D-404B-41A0-A026-FF32A02AF610","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c993ce67dd77ef6a82137ebe9b02a5d6f35c83c0","datavalue":{"value":"1200.60029","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2380233$D5BCC3CA-09C5-4738-9279-91028124351D","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"ebc7441ecfd9ecfa38d48ddc4b2adb39ac7d7000","datavalue":{"value":{"entity-type":"item","numeric-id":161296,"id":"Q161296"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2380233$8BA61428-5365-463A-9477-A9A97F436A04","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"143e8774a45e663375c24b3b343519cf2933b18c","datavalue":{"value":{"time":"+2010-03-26T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2380233$5795516E-6D44-489B-8C23-0FBA0C159A7B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"3e26f002ecd0df082201f956d375f92d108ead55","datavalue":{"value":"https://arxiv.org/abs/0905.0367","type":"string"},"datatype":"url"},"type":"statement","id":"Q2380233$08BEDC70-7D44-43E2-B8D5-9AFDA09AA017","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P205","hash":"08c577062b719110522c43b80596e633b7d9ecaa","datavalue":{"value":"https://eudml.org/doc/223887","type":"string"},"datatype":"url"},"type":"statement","id":"Q2380233$CA593BD8-CE94-4E9B-A9E2-538BE1978D9E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P205","hash":"328c0bc38d845101d9f23c7a7cf5372845d1e067","datavalue":{"value":"http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r78.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q2380233$4A94409A-8546-4BF7-A331-317F38D10DED","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"0209e7b7568223f3258fa9ca94691e8a77e42b34","datavalue":{"value":"Given \\(q> 0\\) a random binary sequence \\(\\varepsilon= (\\varepsilon_1,\\varepsilon_2,\\dots)\\) is \\(q\\)-exchangeable if \\[ P(\\varepsilon_1, \\varepsilon_2,\\dots, \\varepsilon_{i-1}, \\varepsilon_{i+1}, \\varepsilon_i,\\dots,\\varepsilon_n)= f(\\varepsilon_i- \\varepsilon_{i+1})P(\\varepsilon_1,\\dots, \\varepsilon) \\] with \\(f(t)= q^t\\). The paper investigates what extension of De Finetti's theorem still holds. It turns out that there is no simple extension. For \\(0< q< 1\\) there is a bijection \\(P\\leftrightarrow\\mu\\) between probability laws \\(P\\) of \\(\\varepsilon\\) and \\(\\mu\\) a measure on the set \\(\\Delta_q= \\{0,1,q,q^2,\\dots\\}\\). The squence \\(\\varepsilon\\) may be constructed \\((*)\\) by choosing \\(x\\in\\Delta_q\\) with probability distribution \\(\\mu\\) and then taking a \\(q\\)-analogue of the Bernoulli process indexed by \\(x\\). The distribution of \\(\\varepsilon\\) is determined by \\(v_{nk}= P\\) (\\(\\varepsilon_i=1\\), \\(i\\leq k\\), \\(\\varepsilon_i=0\\), \\(k< i\\leq n\\)). For the proof the authors define a weighted directed graph \\(\\Gamma(q)\\) with vertex set \\(\\Gamma= \\{(l,k): l,k= 0,1,\\dots\\}\\) and outgoing edges \\((l,k)\\to(l+ 1,k)\\) and \\((l,k)\\to(l,k+1)\\) with weights \\(1\\) and \\(q^l\\), respectively. A path in \\(\\Gamma(q)\\) has weight equal to the product of the weights of its edges. A Markov chain \\(S= (S_n)\\) on \\(\\Gamma(q)\\) starting at \\((0,0)\\) and moving along its edges is central when for every fixed \\((n-k, k)\\) the conditional probability given \\(S_n=(n-k,k)\\) that \\(S\\) follows a path \\(W\\) from \\((0,0)\\) to \\((n-k,k)\\) is proportional to the weight of \\(W\\). There is a bijection between \\(q\\)-exchangeable binary sequences and central Markov chains on \\(\\Gamma(q)\\). It is shown that \\(P\\,(S_n= (n-k,k))={n\\brack k}v_{nk}\\) with \\(v_{nk}\\) as above and \\({n\\brack k}\\) the \\(q\\)-binomial generalisation of \\({n\\choose k}\\). The \\(v_{nk}\\) satisfy a recurrence, viz. (9). The consruction \\((*)\\) may be seen as the barycentric decomposition of solutions of (9) into extreme solutions. These extreme solutions are found to be \\[ \\Phi_{nk}(x)= q^{k(k-n)}x^{n-k} \\prod_{i