n. 1. any set that has a linear order; it may be a subset of a partially ordered set on which the ordering is connected. 2. a collection of nested sets. 3. Markov chain. another term for Markov process. 4. (Graph theory) any path joining two vertices in a graph. In particular, an Eulerian chain uses each edge exactly once; a Hamiltonian chain uses each vertex exactly once.