Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 22157
3 votes
Accepted

Reference on continuous-time finite state filtering

This question is related to the topic of stochastic filtering theory. See e.g. the following monographs * Bucy, Joseph - Filtering for stochastic processes with applications to guidance * Bain, Crisan …
Joris Bierkens's user avatar
1 vote
1 answer
219 views

Uniqueness of invariant measure for equivalent transition probabilities

Suppose $P(x,dy)$ and $Q(x,dy)$ are two Markov transition kernels on a topological space $E$ equipped with Borel $\sigma$-algebra $\mathcal B(E)$. Suppose for every $x \in E$, $P(x,\cdot)$ and $Q(x, \ …
Joris Bierkens's user avatar
3 votes

Ising model - phase transition vs rapid mixing

As only a partial answer, in the paper Bierkens, Roberts, A piecewise deterministic scaling limit of Lifted Metropolis Hastings for the Curie-Weiss model, http://arxiv.org/abs/1509.00302, we have obta …
Joris Bierkens's user avatar
8 votes
2 answers
376 views

A family of skew-symmetric matrices corresponding to cycles in graphs

When investigating loops in Markov chains I ran into the following observation. A cycle in a graph $G$ with $n$ vertices may be represented by a matrix $\Gamma \in \mathbb R^{n \times n}$ having the …
Joris Bierkens's user avatar
2 votes
0 answers
436 views

Hitting time of a specific Markov chain using martingale approach (or otherwise)

Let $0 < c < 1$. Consider the Markov chain $(X_i)$ on $\{0, 1, \dots, n\}$, with transition probabilities $$ P(k,k+1) = \left(1 - \tfrac {k}{n} \right)(1-c), \quad k = 0, \dots, n-1, $$ $$ P(k,k-1) …
Joris Bierkens's user avatar