Hostname: page-component-6898cfcb55-kwdml Total loading time: 0 Render date: 2026-11-11T05:35:02.655Z Has data issue: false hasContentIssue false
  • English
  • Français

Coincident probabilities and applications in combinatorics

Published online by Cambridge University Press:  14 July 2016

Samuel Karlin
Get accessRights & Permissions [Opens in a new window]

Abstract

For a strong Markov process on the line with continuous paths the Karlin–McGregor determinant formula of coincidence probabilities for multiple particle systems is extended to allow the individual component processes to start at variable times and run for variable durations. The extended formula is applied to a variety of combinatorial problems including counts of non-crossing paths in the plane with variable start and end points, dominance orderings, numbers of dominated majorization orderings, and time-inhomogeneous random walks.

Keywords

NON-CROSSING PATHSDOMINANCE ORDERINGSMAJORIZATION

Information

Type
Part 5 - Concepts of Coincidence and Convergence
Information
Journal of Applied Probability , Volume 25 , Issue A , 1988, pp. 185 - 200
Copyright
Copyright © Applied Probability Trust 1988 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Barton, D. E. and Mallows, D. E. (1965) Some aspects of the random sequence. Ann. Statist. 236–260.CrossRefGoogle Scholar
Gessel, I. and Veinnot, G. (1985) Binomial determinants, paths and hook length formulae. Adv. Math. 58, 300–321.CrossRefGoogle Scholar
Huntington, R. J. and Naus, J. I. (1975) A simpler expression for kth nearest neighbor coincidence probabilities. Ann. Prob. 3, 894–896.CrossRefGoogle Scholar
Hwang, F. K. (1977) A generalization of the Karlin–McGregor theorem on coincidence probabilities and an application to clustering. Ann. Prob. 5, 814–817.CrossRefGoogle Scholar
Karlin, S. (1968) Total Positivity. Stanford University Press, Stanford, CA.Google Scholar
Karlin, S. and Mcgregor, J. G. (1959) Coincidence probabilities. Pacific J. Math. 9, 1141–1164.CrossRefGoogle Scholar
Narayama, T. V. (1959) A partial order and its applications to probability theory. Sankhya 21, 91–98.Google Scholar
Naus, J. I. (1965) The distribution of the size of the maximum cluster of points on a line. J. Amer. Statist. Assoc. 60, 532–538.CrossRefGoogle Scholar
Stanley, R. P. (1986) Enumerative Combinatorics. Wadsworth, Monterey, CA.CrossRefGoogle Scholar