Search Results
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 |
2
votes
Accepted
Similarity transformation of transition matrix of reversible Markov chain (reference request)
If $P$ is the Markov transition matrix of a graph, the matrix $A=P\pi^{-1}$ is called the affinity matrix and $R=\pi^{1/2}A\pi^{1/2}=\pi^{1/2}P\pi^{-1/2}$ is called the normalized affinity matrix, see …
6
votes
Accepted
Uniqueness of Gibbs Measure on Ising model
From the physics point of view, the answer to your question is an immediate "yes": a nonunique Gibbs measure arises if there is a phase transition into a phase with multiple ground states (say, a phas …
109
votes
"Surprising" examples of Markov chains
I could go back to Markov himself, who in 1913 applied the concept of a Markov chain to sequences of vowels and consonants in Alexander Pushkin's poem Eugene Onegin. In good approximation, the probabi …
1
vote
How to explain "Feller process" to an undergraduate student?
I found George Lowther's blog on Feller processes quite instructive, with several helpful examples. The comments in particular give some simple constructions for Markov processes that are almost, but …
1
vote
Accepted
What's the probability of two independent events in time domain?
Let me denote the probability that that there is an event "first $A$ then $B$" by $P_{AB}$ and let me consider $1-P_{AB}$.
One contribution to $1-P_{AB}$ is that the event $A$ does not happen at al …
5
votes
Reference Request: Theoretical Mixing Times Research in Machine Learning / Artificial Intell...
Mark Jerrum has rigorous results (bounds) on mixing times for Markov Chain Monte Carlo algorithms, as summarized in this presentation. In the context of deep learning, such bounds have been used in La …
3
votes
Accepted
The reference on Markov chains uncovering the power of the subject in a better way for a wor...
This may not be a viable route, but if your friend is familiar with Python, a hands-on course might be an effective way to explore Markov chains. The course designed by Sargent and Stachurski guides y …