zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Markov graphs. (English) Zbl 0607.05057
Necessary definitions and notations are introduced in section 2. Probability functions are represented in exponential form and by summation, as two possible alternatives. Side conditions permit to identify the interaction function $\lambda\sb A$ of a set A of subindexes i in the set of m discrete random variables. Then the dependence graph D on a vertex set M is introduced. Using these results, the probability function of a random graph G is characterized in Theorem 1. It is a log-linear model. Sufficient statistics are fixed and they indicate the ”sufficient subgraphs of G. Two examples illustrate the concepts and results. Theorem 2 gives the log-linear model and the sufficient statistics for a Markov graph and Theorem 3 for an undirected and homogeneous Markov graph. Inference for Markov graphs is studied and the difficulties for obtaining maximum likelihood estimators are discussed. The use of a Metropolis procedure, say a thermodynamic simulation method, permits to obtain the maximum. The logit regression is also proposed and maximum likelihood estimators are derived for generated random graphs. Random directed graphs with a certain structure are characterized by fixing their probabilistic structure. The corresponding model is a log-linear one. Also, Markov graphs under directed graphs and Markov homogeneous directed graph are studied. The characterizations are given in Theorems 4, 5 and 6. Various graphics and tables illustrate the results. Hammersley-Clifford theorem is used for describing the dependence structures related with the different cases.
Reviewer: C.N.Bouza

05C80Random graphs
60C05Combinatorial probability
62J99Linear statistical inference
60J99Markov processes
90B15Network models, stochastic (optimization)
Full Text: DOI