{"entities":{"Q1300754":{"pageid":1311504,"ns":120,"title":"Item:Q1300754","lastrevid":70636248,"modified":"2026-04-13T15:53:09Z","type":"item","id":"Q1300754","labels":{"en":{"language":"en","value":"Distributions of runs and consecutive systems on directed trees"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1331048"}},"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":"Q1300754$A25A6772-CD93-43C3-BCA3-78A1382D72D9","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6990db40074840f56e04e63aff6f35ec24cc759a","datavalue":{"value":{"text":"Distributions of runs and consecutive systems on directed trees","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1300754$14788258-5A25-4DF4-BBEC-876EFD4186FE","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"2e2616c7bea91f00573809bb82d096643c7ebc6e","datavalue":{"value":"0948.60009","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1300754$D08D2E0C-B229-4C89-B7A9-5B46B266DC40","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ec7a83056e49b9614dc128e605cfdadc60bac622","datavalue":{"value":"10.1023/A:1003877016437","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1300754$5E5FE292-21F4-48A1-9D67-19D1FDCFECC8","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ee93d756f10730ada8e76a575636201a684dec60","datavalue":{"value":{"entity-type":"item","numeric-id":186552,"id":"Q186552"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1300754$D141578D-E0EF-47D6-9A17-B906164074C2","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"d7d8474aa6c322a4c16cfe0f783155cae222748d","datavalue":{"value":{"entity-type":"item","numeric-id":78039,"id":"Q78039"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1300754$941969C6-ACE6-46D4-B111-612A091113F3","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f75721fa752c9123eb70187b9a711f89662b7df4","datavalue":{"value":{"time":"+2000-11-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1300754$466F8A11-EA03-47F7-A53F-DD3ECA86E612","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"877146f521d339b5a991c1a2462e9f026f8541fb","datavalue":{"value":"During the last 60 years several authors have developed the exact distribution theory of runs of random sequences using a number of methods. In particular, the reviewer and \\textit{A. A. Muwafi} [Fibonacci Q. 20, 28-32 (1982; Zbl 0476.60008)] introduced an innovating approach for this problem, based on enumerative combinatorics, \\textit{M. Ebneshahrashoob} and \\textit{M. Sobel} [Stat. Probab. Lett. 9, No. 1, 5-11 (1990; Zbl 0695.60016)] introduced the powerful method of conditional pgf's, and \\textit{J. C. Fu} and \\textit{M. V. Koutras} [J. Am. Stat. Assoc. 89, No. 427, 1050-1058 (1994; Zbl 0806.60011)] introduced the method of Markov chain imbedding. Two of the most simple and interesting applications of this theory are the derivations of the failure probability of consecutive-\\(k\\)-out-of-\\(n\\):\\(F\\) systems and \\(m\\)-consecutive-\\(k\\)-out-of-\\(n\\):\\(F\\) systems [see, e.g., the reviewer, in: Fibonacci numbers and their applications. Math. Appl., D. Reidel Publ. Co. 28, 203-227 (1986; Zbl 0602.60023), and \\textit{M. Chao} et al., IEEE Trans. Reliability 40, 120-127 (1995)].    Presently, the author derives recurrences for the pgf's of runs on directed trees and applies them in studying the lifetime of consecutive systems. More precisely, let \\(T\\) be a directed tree with all its edges directed away from its root, and denote the latter by \\(v_0\\). Let \\(V\\) be the set of vertices of \\(T\\), and let \\(\\{X_v\\), \\(v\\in V\\}\\) be a given collection of \\(\\{0,1\\}\\)-valued random variables. Assume that \\(\\{X_v\\), \\(v\\in V\\}\\) has the directed Markov distribution [see, e.g., \\textit{S. L. Lauritzen}, ``Graphical models'' (1998; Zbl 0907.62001)], with the initial distribution at the root \\(P(X_{v_0}= 1)= p= 1-q\\) and the conditional probabilities \\(P(X_v= 1\\mid X_{p\\alpha(v)}= 1)= p_1= 1-q_1\\) and \\(P(X_v= 1\\mid X_{p\\alpha(v)}= 0)= p_0= 1- q_0\\), for each vertex \\(v\\) except for the root, where \\(p\\alpha (v)\\) denotes the parent of the vertex \\(v\\). Then, the collection of the random variables \\(\\{X_v\\), \\(v\\in V\\}\\) is often called a Markov tree. Fix any vertex \\(v\\) except for the root, and suppose that it has \\(\\alpha(v)\\) ancestors \\(v^1, v^2,\\dots, v^{\\alpha(v)}\\) with \\(p\\alpha (v^j)= v^{j+1}\\) for \\(j= 1, 2,\\dots, \\alpha(v)- 1\\). Assume that the vertex \\(v\\) has \\(c(v)\\) children \\(c_1, c_2,\\dots, c_{c(v)}\\). Denote by \\(T_v\\) the subtree which consists of the vertex \\(v\\) (the root of the subtree) and the descendants of \\(v\\), and let \\(V_v\\) denote the set of vertices of \\(T_v\\). Furthermore, let \\(\\varphi_{v_0} (t)\\) be the pgf of the distribution of the number of non-overlapping ``1''-runs of length \\(k\\) along the direction in \\(\\{X_v\\), \\(v\\in V\\}\\). For every vertex \\(v\\) except for the root \\(v_0\\), let \\(\\varphi_v^0 (t)\\) be the pgf of the conditional distribution of the number of non-overlapping ``1''-runs of length \\(k\\) along the direction in \\(\\{X_w\\), \\(w\\in V_v\\}\\) given that \\(X_{p\\alpha(v)}= 0\\), and let \\(\\psi_v^0 (t)\\) be the pgf of the conditional distribution of the number of non-overlapping ``1''-runs of length \\(k\\) along the direction in \\(\\{X_w\\), \\(w\\in V_v\\}\\) given that at the vertex \\(p\\alpha(v)\\) a ``1''-run of length \\(k\\) along this direction is observed. Finally, for \\(I= 1, 2,\\dots\\), \\(\\min \\{(k-1), \\alpha(v)\\}\\), let \\(\\varphi^I_v(t)\\) be the pgf of the conditional distribution of the number of non-overlapping ``1''-runs of length \\(k\\) along the direction in \\(\\{X_w\\), \\(w\\in V_v\\}\\) given that at the vertex \\(p\\alpha(v)\\) a ``1''-run of length \\(I\\) along this direction is observed.   The main result, Theorem 2.1, consists of recurrences for the above-mentioned pgf's and provides a feasible algorithm for computations. As a simple illustration, an example is given of a specific directed tree in which the exact pgf of the distribution (and the distribution itself) of the number of ``1''-runs of length 3 is derived. In addition, the author defines and studies, via recurrences of pgf's, consecutive-\\(k\\)-out-of-\\(n\\):\\(F\\) systems on directed trees.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1300754$8B5777A8-0F87-4F65-96C0-5456BF881E51","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"739e004674139c2b61782ece3788a457e8d3f5b8","datavalue":{"value":"60E10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1300754$714240B4-1FE0-4993-87B8-BFC64E62121E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8488bae0e70b66574d93dcdd9d355b6e4db8969e","datavalue":{"value":"60K10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1300754$80C41C58-088D-4478-A210-CF09B30BCEED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1300754$0F35FE7F-53F2-494D-B915-8818BB6974C2","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"20c91b5b6eeea70d39e7a9ffb65f56d96c93fad4","datavalue":{"value":"1331048","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1300754$3171BB79-FF79-40E2-ABF7-C9CBB2BB3419","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e900a48ab45f82e469190cd42dcab4e561535eb9","datavalue":{"value":"runs of random sequences","type":"string"},"datatype":"string"},"type":"statement","id":"Q1300754$0337A634-CA9F-4F2D-8857-C26A3AFB0768","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f760e4e68d47db9649a28fb6c72054eeda8bba08","datavalue":{"value":"enumerative combinatorics","type":"string"},"datatype":"string"},"type":"statement","id":"Q1300754$89162581-4AFC-420E-AE30-9103C4C4DDDF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b4db25a480b4cfde796479cf1fa0bde3d5deb2ea","datavalue":{"value":"consecutive-\\(k\\)-out-of-\\(n\\):\\(F\\) systems","type":"string"},"datatype":"string"},"type":"statement","id":"Q1300754$13A25506-1976-4369-AAA5-03099BB740B0","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"786340af3c96bfe6dc1fd85e3aa5793d780a0314","datavalue":{"value":{"entity-type":"item","numeric-id":452296,"id":"Q452296"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1300754$56C5819F-6788-4D08-BD97-964A0F9F63B2","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1300754$9BCDEA2F-2EDE-42DF-B811-7973DC86CF60","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"d229de43427d8558d65064f9de028a159ed0033e","datavalue":{"value":"https://doi.org/10.1023/a:1003877016437","type":"string"},"datatype":"url"},"type":"statement","id":"Q1300754$0DFF4A8C-B15C-4716-B767-B5F9734A08E1","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"8ff2e528a26d654c07bad11968096ab92727efd4","datavalue":{"value":"W1977957429","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1300754$8516872E-AF94-4AFB-B53F-A9FFC2F1C924","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d3954786997e32f4993f5001086abbee5ff57651","datavalue":{"value":{"entity-type":"item","numeric-id":1706471,"id":"Q1706471"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"bfa86f359be8195bef7aeb6af51aa2db82159744","datavalue":{"value":{"amount":"+0.8986521363258362","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1300754$5B4368DD-4043-4E05-9918-CD4E629D594C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"679b95d8ea6415aef5eb95d691c1c7dd74bbf839","datavalue":{"value":{"entity-type":"item","numeric-id":3622077,"id":"Q3622077"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d974142829d677b0d8091130af5c62e1e556aab5","datavalue":{"value":{"amount":"+0.8404456973075867","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1300754$431D3B66-FF49-4793-9191-B52E4D009A24","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1e55315953590798a1c8f109f3d74dcd2e81f665","datavalue":{"value":{"entity-type":"item","numeric-id":3800845,"id":"Q3800845"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"77f1df73a69ffc3f9cdfb6465550516babe256b6","datavalue":{"value":{"amount":"+0.7744743227958679","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1300754$6F041AC3-0A56-47A3-8E63-80E8C8912462","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"75c0198714d2610707e2c7f38bda6e1819fee416","datavalue":{"value":{"entity-type":"item","numeric-id":3321813,"id":"Q3321813"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6c942200e226a87825809f6cf7645df2b3f106cb","datavalue":{"value":{"amount":"+0.7729939818382263","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1300754$553E740D-4CD0-4510-9F8D-D46C7A0CB051","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Distributions of runs and consecutive systems on directed trees","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Distributions_of_runs_and_consecutive_systems_on_directed_trees"}}}}}