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

DOI10.1007/S11009-018-9689-1zbMath1430.05005OpenAlexW2903666313WikidataQ60195445 ScholiaQ60195445MaRDI QIDQ2283672

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 identitiesgenerating functioncombinatorial complexityrandomness testdistribution-free statistical testdistributions of runsGosper-Zeilberger methodmultivariate ligand bindingruns length test

Mathematics Subject Classification ID

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

Related Items (3)

Distributions of successions of arbitrary multisets ⋮ Multiple consecutive runs of multi-state trials: distributions of \(( k_1 , k_2 , \dots , k_\ell )\) patterns ⋮ Distributions of runs and scans in multistate Markov exchangeable sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Number of appearances of events in random sequences: a new generating function approach to type II and type III runs
• Waiting time distributions associated with runs of fixed length in two-state Markov chains
• Runs, scans and urn model distributions: A unified Markov chain approach
• The \(m\)th longest runs of multivariate random sequences
• Joint distributions of numbers of runs of specified lengths in a sequence of Markov dependent multistate trials
• Distributions of Runs Revisited
• Number of appearances of events in random sequences: A new approach to non-overlapping runs
• Distribution Theory of Runs: A Markov Chain Approach
• Joint distribution of rises, falls, and number of runs in random sequences
• Distribution of Runs and Longest Runs
• The Distribution Theory of Runs
• Scan statistics

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