Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
Theory of Probability and Its Applications
Article . 1963 . Peer-reviewed
Data sources: Crossref
versions View all 2 versions
addClaim

Markov Measures and Markov Extensions

Markov measures and Markov extensions
Authors: Vorob'ev, N.;

Markov Measures and Markov Extensions

Abstract

Let ${\bf \mathfrak{K}}$ be a complex with the set of vertices M and A, B and R three subsets of M. R is said to be separating A and B in ${\bf \mathfrak{K}}$ (notation: $(A\mathop |\limits_R B)\mathfrak{K}$ if any $a \in A$ and $b \in B$ are not connected in $ \mathfrak{K} - \cup _{r \in R} O_\mathfrak{K} r$ is the star of r in $\mathfrak{K}$.Let $S_a ,a \in M$, be a finite set and $S_A = \prod _{a \in A} S_a ,A \subset M$. A measure $\mu _M $ on $S_M $ is said to be Markov relative to $\mathfrak{K}$ if for any separation $(A\mathop |\limits_R B)\mathfrak{K}$ if any $a \in A$ and $a \in A$ and $x_R \in S_R $ the inequality, $\mu _M (x_R ) \ne 0$ implies \[ \mu _M \left(X_A \times X_B |x_R \right) \ne \mu _M \left(X_A |x_R \right)\mu _M \left(X_B |x_R \right) \]for arbitrary $X_A \subset S_A $ and $X_B \subset S_B $.Theorem. If the complex $\mathfrak{K}$ is regular, any consistent family of measures $\mu _\mathfrak{K} = \left\{ {\mu _K } \right\}_{K \in \mathfrak{K}} $ on $S_\mathcal{K} = \left\{ {S_K } \...

Keywords

probability theory

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    30
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 1%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
30
Top 10%
Top 1%
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!