Decoupling combinatorial complexity: a two-step approach to distributions of runs (Q2283672): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11009-018-9689-1 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q60195445 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11009-018-9689-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2903666313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distribution Theory of Runs: A Markov Chain Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2713470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scan statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint distributions of numbers of runs of specified lengths in a sequence of Markov dependent multistate trials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distribution of Runs and Longest Runs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributions of Runs Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of appearances of events in random sequences: A new approach to non-overlapping runs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(m\)th longest runs of multivariate random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of appearances of events in random sequences: a new generating function approach to type II and type III runs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint distribution of rises, falls, and number of runs in random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Waiting time distributions associated with runs of fixed length in two-state Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Runs, scans and urn model distributions: A unified Markov chain approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Distribution Theory of Runs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875364 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11009-018-9689-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:49, 17 December 2024

scientific article
Language Label Description Also known as
English
Decoupling combinatorial complexity: a two-step approach to distributions of runs
scientific article

    Statements

    Decoupling combinatorial complexity: a two-step approach to distributions of runs (English)
    0 references
    0 references
    13 January 2020
    0 references
    combinatorial complexity
    0 references
    generating function
    0 references
    distribution-free statistical test
    0 references
    combinatorial identities
    0 references
    Gosper-Zeilberger method
    0 references
    randomness test
    0 references
    runs length test
    0 references
    distributions of runs
    0 references
    multivariate ligand binding
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references