Coincident probabilities and applications in combinatorics
Samuel Karlin
Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.