Decoupling combinatorial complexity: a two-step approach to distributions of runs

DOI10.1007/S11009-018-9689-1MaRDI QIDQ2283672zbMATH OpenOpenAlexWikidataFDO

Authors Yong Kong

Publication date 13 January 2020

Published in Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11009-018-9689-1

zbMATH Keywords

combinatorial complexitycombinatorial identitiesdistribution-free statistical testdistributions of runsgenerating functionGosper-Zeilberger methodmultivariate ligand bindingrandomness testruns length test

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Discrete-time Markov processes on general state spaces (60J05) Biophysics (92C05)

Recommendations

• Distribution of Runs and Longest Runs
• Distribution Theory of Runs: A Markov Chain Approach
• Distributions of runs revisited
• scientific article; zbMATH DE number 947423
• Number of appearances of events in random sequences: a new generating function approach to type II and type III runs

Cites work

• Distribution of Runs and Longest Runs
• Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
• Distribution Theory of Runs: A Markov Chain Approach
• Distributions of runs revisited
• scientific article; zbMATH DE number 1058063 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 872231 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Joint distribution of rises, falls, and number of runs in random sequences
• Joint distributions of numbers of runs of specified lengths in a sequence of Markov dependent multistate trials
• Number of appearances of events in random sequences: a new approach to non-overlapping runs
• Number of appearances of events in random sequences: a new generating function approach to type II and type III runs
• Runs and scans with applications
• Runs, scans and urn model distributions: A unified Markov chain approach
• Scan statistics
• The \(m\)th longest runs of multivariate random sequences
• The Distribution Theory of Runs
• Waiting time distributions associated with runs of fixed length in two-state Markov chains

Cited in

(10)

• Joint distributions of runs in a sequence of multi-state trials
• Multiple consecutive runs of multi-state trials: distributions of \(( k_1 , k_2 , \dots , k_\ell )\) patterns
• Distributions of runs revisited
• Number of appearances of events in random sequences: a new approach to non-overlapping runs
• Distributions of successions of arbitrary multisets
• Distribution of Runs and Longest Runs
• Distributions of runs and scans in multistate Markov exchangeable sequences
• Joint distribution of numbers of occurrences of countably many runs of specified lengths in a sequence of discrete random variables
• Joint distributions associated with countably many runs in sooner waiting time problems
• On the joint distributions of increasing and decreasing successions of arbitrary multisets

This page was built for publication: Decoupling combinatorial complexity: a two-step approach to distributions of runs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283672)