Temat: Markov chain - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Two mutually rarefied renewal processes
Autorzy:: Kopocińska, Ilona
Powiązania:: https://bibliotekanauki.pl/articles/1340626.pdf
Data publikacji:: 1994
Wydawca:: Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:: rarefied renewal process
Markov chain
Opis:: Let us consider two independent renewal processes generated by appropriate sequences of life times. We say that a renewal time is accepted if in the time between a signal and the preceding one, some signal of the second process occurs. Our purpose is to analyze the sequences of accepted renewals. For simplicity we consider continuous and discrete time separately. In the first case we mainly consider the renewal process rarefied by the Poisson process, in the second we analyze the process generated by the motion of draughtsmen moved by die tossing.
Źródło:: Applicationes Mathematicae; 1993-1995, 22, 2; 267-273
1233-7234
Pojawia się w:: Applicationes Mathematicae
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: On adaptive control of Markov chains using nonparametric estimation
Autorzy:: Drabik, Ewa
Stettner, Łukasz
Powiązania:: https://bibliotekanauki.pl/articles/1208175.pdf
Data publikacji:: 2000
Wydawca:: Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:: controlled Markov chain
estimation
adaptive control
Opis:: Two adaptive procedures for controlled Markov chains which are based on a nonparametric window estimation are shown.
Źródło:: Applicationes Mathematicae; 2000, 27, 2; 143-152
1233-7234
Pojawia się w:: Applicationes Mathematicae
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Mathematical model of mixing in Rumen
Autorzy:: Szlenk, Wiesław
Powiązania:: https://bibliotekanauki.pl/articles/1339321.pdf
Data publikacji:: 1996
Wydawca:: Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:: ergodic
rumen
Markov chain
Baker Transformation
Opis:: A mathematical model of mixing food in rumen is presented. The model is based on the idea of the Baker Transformation, but exhibits some different phenomena: the transformation does not mix points at all in some parts of the phase space (and under some conditions mixes them strongly in other parts), as observed in ruminant animals.
Źródło:: Applicationes Mathematicae; 1996-1997, 24, 1; 87-95
1233-7234
Pojawia się w:: Applicationes Mathematicae
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Pairs of successes in Bernoulli trials and a new n-estimator for the binomial distribution
Autorzy:: Kühne, Wolfgang
Neumann, Peter
Stoyan, Dietrich
Stoyan, Helmut
Powiązania:: https://bibliotekanauki.pl/articles/1340510.pdf
Data publikacji:: 1994
Wydawca:: Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:: n-estimator
simulation
silicon wafer
Markov chain
binomial distribution
Opis:: The problem of estimating the number, n, of trials, given a sequence of k independent success counts obtained by replicating the n-trial experiment is reconsidered in this paper. In contrast to existing methods it is assumed here that more information than usual is available: not only the numbers of successes are given but also the number of pairs of consecutive successes. This assumption is realistic in a class of problems of spatial statistics. There typically k = 1, in which case the classical estimators cannot be used. The quality of the new estimator is analysed and, for k > 1, compared with that of a classical n-estimator. The theoretical basis for this is the distribution of the number of success pairs in Bernoulli trials, which can be determined by an elementary Markov chain argument.
Źródło:: Applicationes Mathematicae; 1993-1995, 22, 3; 331-337
1233-7234
Pojawia się w:: Applicationes Mathematicae
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 5.

Tytuł:: Directed forests with application to algorithms related to Markov chains
Autorzy:: Pokarowski, Piotr
Powiązania:: https://bibliotekanauki.pl/articles/1338687.pdf
Data publikacji:: 1999
Wydawca:: Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:: entrywise relative error
directed forest
Matrix Tree Theorem
directed graph
Simulated Annealing
Markov chains
Metropolis algorithm
direct methods for linear systems
nearly completely decomposable Markov chains
aggregation algorithms
nonhomogeneous Markov chains
Markov Chain Tree Theorem
Markov chain Monte Carlo algorithms
Gibbs sampler
Opis:: This paper is devoted to computational problems related to Markov chains (MC) on a finite state space. We present formulas and bounds for characteristics of MCs using directed forest expansions given by the Matrix Tree Theorem. These results are applied to analysis of direct methods for solving systems of linear equations, aggregation algorithms for nearly completely decomposable MCs and the Markov chain Monte Carlo procedures.
Źródło:: Applicationes Mathematicae; 1999, 26, 4; 395-414
1233-7234
Pojawia się w:: Applicationes Mathematicae
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja