Zobrazeno 1 - 10
of 2 993
pro vyhledávání: '"Markov chain mixing time"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Richard Bronson, Gabriel B. Costa
In this chapter, the concept of probability is introduced. Both independent and disjoint events are covered, as are basic properties of probability. Bernoulli events and counting (combinatorics) are also discussed. Markov chains used in modeling are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::366f5c710fcc759afc7e1778a3a0b1a0
https://doi.org/10.1016/b978-0-12-818419-6.00009-5
https://doi.org/10.1016/b978-0-12-818419-6.00009-5
Autor:
Joseph B. Kadane
Publikováno v:
Principles of Uncertainty ISBN: 9781315167565
Principles of Uncertainty
Principles of Uncertainty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c339bf70c9be5adfaea2fdf841883a73
https://doi.org/10.1201/9781315167565-10
https://doi.org/10.1201/9781315167565-10
Publikováno v:
STOC
For d ≥ 2 and all q≥ q0(d) we give an efficient algorithm to approximately sample from the q-state ferromagnetic Potts and random cluster models on the torus (g.,Currency sign / n g.,Currency sign )d for any inverse temperature β≥ 0. This stan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3fea7afa7300d65f423a4d844a26887d
https://doi.org/10.1145/3357713.3384271
https://doi.org/10.1145/3357713.3384271
Autor:
Achim Klenke
Publikováno v:
Probability Theory ISBN: 9783030564018
Probability Theory ISBN: 9781447153603
Probability Theory ISBN: 9781447153603
We consider a Markov chain X with invariant distribution π and investigate conditions under which the distribution of X n converges to π as n→∞. Essentially it is necessary and sufficient that the state space of the chain cannot be decomposed i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4e7b1b43072e619c2578db7a9512f8a
https://doi.org/10.1007/978-3-030-56402-5_18
https://doi.org/10.1007/978-3-030-56402-5_18
Publikováno v:
Stochastic Processes and their Applications. 128:3221-3252
In this paper we consider the field of local times of a discrete-time Markov chain on a general state space, and obtain uniform (in time) upper bounds on the total variation distance between this field and the one of a sequence of $n$ i.i.d. random v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42065725cc5ec56a1871283bf0bb6216
https://doi.org/10.1016/j.spa.2017.10.015
https://doi.org/10.1016/j.spa.2017.10.015
Publikováno v:
Computational Statistics & Data Analysis. 118:1-17
The grouped independence Metropolis–Hastings (GIMH) and Markov chain within Metropolis (MCWM) algorithms are pseudo-marginal methods used to perform Bayesian inference in latent variable models. These methods replace intractable likelihood calculat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5e4784eb99aef65a799a281b5532008
https://doi.org/10.1016/j.csda.2017.09.002
https://doi.org/10.1016/j.csda.2017.09.002
Publikováno v:
IFAC-PapersOnLine. 51:673-678
The problem of load balancing in industrial networks requires a deterministic and a high performance solution. We consider the Markov chain mixing time problem in undirected hub spoke networks as a basis model to our solution. A data bank is generate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53bb0dcd96707fd64c052bfaed6127ee
https://doi.org/10.1016/j.ifacol.2018.03.114
https://doi.org/10.1016/j.ifacol.2018.03.114