This paper deals with the computation of the hitting time for a non-homogeneous discrete time Markov chain (NHDTMC or NHMC). We first give the basic definitions of NHMC, then we analyse the hitting time and its survivor function. We also give the sufficient conditions for the existence of the mean h
Finite homomorphism-homogeneous tournaments with loops
✍ Scribed by Andreja Ilić; Dragan Mašulović; Uroš Rajković
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 152 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently, Cameron and Nešetřil introduced a relaxed version of homogeneity: we say that a structure is homomorphism‐homogeneous if every homomorphism between finite substructures of the structure extends to an endomorphism of the structure. In this article we characterize homomorphism‐homogeneous finite tournaments where vertices are allowed to have loops. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 45–58, 2008
📜 SIMILAR VOLUMES
When we solve the wave equation by the finite element method, the order of convergence and the accuracy of the solution are reduced by the presence of sharp edges. The employment of singular elements improves the solution and allows us to reduce the cost of computation. In this paper, three types o