Decoupling Combinatorial Complexity: a Two-Step Approach to Distributions of Runs
Kong Y. Decoupling Combinatorial Complexity: a Two-Step Approach to Distributions of Runs. Methodology And Computing In Applied Probability 2018, 21: 789-803. DOI: 10.1007/s11009-018-9689-1.Peer-Reviewed Original ResearchRun-related distributionsDistribution of runsMultivariate random sequencesCombinatorial complexityFinite Markov chainsMulti-object systemNearest-neighbor interactionsStatistical physicsCombinatorial difficultiesMarkov chainExplicit formRun statisticsNeighbor interactionsMultinomial coefficientsDifferent systematic approachesGeneral frameworkRun distributionRandom sequenceKinds of objectsTwo-step approachCombinatoricsGeneral formulaIndependent stepsComplexityPhysicsGenerating Function Methods for Run and Scan Statistics
Kong Y. Generating Function Methods for Run and Scan Statistics. 2018, 1-19. DOI: 10.1007/978-1-4614-8414-1_56-1.Peer-Reviewed Original ResearchFinite Markov chainsMulti-object systemNearest-neighbor interactionsStatistical physicsCombinatorial difficultiesGenerating functionMarkov chainExplicit formClassical resultsPattern statisticsNeighbor interactionsCombinatorial complexityFunction methodCombinatorial methodsKinds of objectsDifferent complexityMultiple objectsScan statisticIndividual objectsStatisticsIndependent stepsFirst stepWhole systemComplexityObjects
This site is protected by hCaptcha and its Privacy Policy and Terms of Service apply