A probabilistic and algebraic treatment of regular inbreeding systems (Q1071685): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Peter W. Arzberger / rank | |||
Property / author | |||
Property / author: Peter W. Arzberger / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A probabilistic and algebraic treatment of regular inbreeding systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3848243 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5659379 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5624436 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ratio theorems for random walks. II / rank | |||
Normal rank |
Latest revision as of 12:55, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A probabilistic and algebraic treatment of regular inbreeding systems |
scientific article |
Statements
A probabilistic and algebraic treatment of regular inbreeding systems (English)
0 references
1985
0 references
This paper studies regular inbreeding systems in population genetics, with a view to determining those for which the population tends to genetic uniformity after an infinite time. Let the measure of genetic uniformity be \(f(x)=f\), the inbreeding coefficient for one individual x, namely the probability that the 2 distinct genes in x are identical by descent. Then in theorem 5, it is proved that in a regular mating system, \(f=1\) if and only if \(\sum A_ n^{-1}=\infty\) where \(A_ n\) is the number of ancestors in the n-th generation into the past. The inbreeding models used are represented by graphs on whose nodes random walks are assumed to be performed. The author shows that the converse of theorem 5 is false in general; two counter-examples are given to prove this. However, the converse is shown to be true for graphs of certain finitely presented semigroups.
0 references
renewal event
0 references
homogeneity property
0 references
graphs of finitely presented
0 references
semigroups
0 references
martingales
0 references
random walks on graphs
0 references
regular inbreeding systems
0 references
population genetics
0 references
genetic uniformity
0 references
infinite time
0 references
identical by descent
0 references
regular mating system
0 references
counter-examples
0 references