Graph explorer

Three competing patterns

Assuming repeated independent sampling from a Bernoulli distribution with two possible outcomes S and F, there are formulas for computing the probability of one specific pattern of consecutive outcomes (such as SSFFSS) winning (i.e. being generated first) over another such pattern (e.g. SFSSFS). In this article we will extend the theory to three competing patterns.

4 nodes3 linksoverview mapThree competing patterns
4 nodes3 links
Three competing patterns4 visible / 4 total nodes / 4 links
Co-authorshipAuthorshipAuthorshipTopic signalWThree competing patternspreprint / 2014ARita AbrahamResearcherAJan VrbikResearcherTmath.PR7239 works
PaperSignal 103 links

Three competing patterns

preprint / 2014

Open