How the perturbation of a Markov chain affect the stationary distribution The 2019 Stack Overflow Developer Survey Results Are InStationary distribution of convex combination of Markov chainsHow to prove stationary distribution of a particular MCFor finite Markov Chain, time average distribution is always a stationary distribution?Understanding the proof of stationary distribution of a markov chainAn example of a reversible but reducible Markov chainDetermining the Stationary Distribution of a Homogeneous Markov ChainStationary distribution of transient statesContinuous-state Markov chain: Existence and uniqueness of stationary distributionConditions under which a finite, irreducible Markov Chain does not converge to its stationary distributionSelecting a Stationary distribution of a Markov chainWhat is the difference between “Limiting Distribution”, and “Stationary Distribution” in the discussion of Markov chain?
How to obtain a position of last non-zero element
How to notate time signature switching consistently every measure
Star Trek - X-shaped Item on Regula/Orbital Office Starbases
Can we generate random numbers using irrational numbers like π and e?
Is Cinnamon a desktop environment or a window manager? (Or both?)
Worn-tile Scrabble
Falsification in Math vs Science
Did the UK government pay "millions and millions of dollars" to try to snag Julian Assange?
How to translate "being like"?
Did Scotland spend $250,000 for the slogan "Welcome to Scotland"?
Old scifi movie from the 50s or 60s with men in solid red uniforms who interrogate a spy from the past
Why can't devices on different VLANs, but on the same subnet, communicate?
Is it correct to say the Neural Networks are an alternative way of performing Maximum Likelihood Estimation? if not, why?
Getting crown tickets for Statue of Liberty
Loose spokes after only a few rides
A word that means fill it to the required quantity
How can I add encounters in the Lost Mine of Phandelver campaign without giving PCs too much XP?
Is it okay to consider publishing in my first year of PhD?
What is this sharp, curved notch on my knife for?
How do PCB vias affect signal quality?
Keeping a retro style to sci-fi spaceships?
How come people say “Would of”?
What is the light source in the black hole images?
Output the Arecibo Message
How the perturbation of a Markov chain affect the stationary distribution
The 2019 Stack Overflow Developer Survey Results Are InStationary distribution of convex combination of Markov chainsHow to prove stationary distribution of a particular MCFor finite Markov Chain, time average distribution is always a stationary distribution?Understanding the proof of stationary distribution of a markov chainAn example of a reversible but reducible Markov chainDetermining the Stationary Distribution of a Homogeneous Markov ChainStationary distribution of transient statesContinuous-state Markov chain: Existence and uniqueness of stationary distributionConditions under which a finite, irreducible Markov Chain does not converge to its stationary distributionSelecting a Stationary distribution of a Markov chainWhat is the difference between “Limiting Distribution”, and “Stationary Distribution” in the discussion of Markov chain?
$begingroup$
I wonder whether there is such kind of relation between the scale of the perturbation and the stationary distribution of a Markov chain. Suppose $hatP=P+FinmathbbR^ntimes n$, where $F$ is the perturbation matrix, each of whose line is sum up to $0$. The corresponding stationary distribution is $pi, hatpi$. Is there exist some $C(n)$, which only relate to $n$, so that
$$sum_i,j=1^n|F_ij|ge C(n)||hatpi-pi||_1$$
I know there is some existing result like $C$ is some kind of condition number. I also find "A Note on Entrywise Perturbation Theory for Markov Chains", which shows that if $|F_ij|leepsilon|P_ij|$, we have $||hatpi-pi||_1le2(n-1)epsilon+mathcalO(epsilon^2)$. But still I can't derive what $C(n)$ is in my question.
linear-algebra markov-chains perturbation-theory
$endgroup$
add a comment |
$begingroup$
I wonder whether there is such kind of relation between the scale of the perturbation and the stationary distribution of a Markov chain. Suppose $hatP=P+FinmathbbR^ntimes n$, where $F$ is the perturbation matrix, each of whose line is sum up to $0$. The corresponding stationary distribution is $pi, hatpi$. Is there exist some $C(n)$, which only relate to $n$, so that
$$sum_i,j=1^n|F_ij|ge C(n)||hatpi-pi||_1$$
I know there is some existing result like $C$ is some kind of condition number. I also find "A Note on Entrywise Perturbation Theory for Markov Chains", which shows that if $|F_ij|leepsilon|P_ij|$, we have $||hatpi-pi||_1le2(n-1)epsilon+mathcalO(epsilon^2)$. But still I can't derive what $C(n)$ is in my question.
linear-algebra markov-chains perturbation-theory
$endgroup$
add a comment |
$begingroup$
I wonder whether there is such kind of relation between the scale of the perturbation and the stationary distribution of a Markov chain. Suppose $hatP=P+FinmathbbR^ntimes n$, where $F$ is the perturbation matrix, each of whose line is sum up to $0$. The corresponding stationary distribution is $pi, hatpi$. Is there exist some $C(n)$, which only relate to $n$, so that
$$sum_i,j=1^n|F_ij|ge C(n)||hatpi-pi||_1$$
I know there is some existing result like $C$ is some kind of condition number. I also find "A Note on Entrywise Perturbation Theory for Markov Chains", which shows that if $|F_ij|leepsilon|P_ij|$, we have $||hatpi-pi||_1le2(n-1)epsilon+mathcalO(epsilon^2)$. But still I can't derive what $C(n)$ is in my question.
linear-algebra markov-chains perturbation-theory
$endgroup$
I wonder whether there is such kind of relation between the scale of the perturbation and the stationary distribution of a Markov chain. Suppose $hatP=P+FinmathbbR^ntimes n$, where $F$ is the perturbation matrix, each of whose line is sum up to $0$. The corresponding stationary distribution is $pi, hatpi$. Is there exist some $C(n)$, which only relate to $n$, so that
$$sum_i,j=1^n|F_ij|ge C(n)||hatpi-pi||_1$$
I know there is some existing result like $C$ is some kind of condition number. I also find "A Note on Entrywise Perturbation Theory for Markov Chains", which shows that if $|F_ij|leepsilon|P_ij|$, we have $||hatpi-pi||_1le2(n-1)epsilon+mathcalO(epsilon^2)$. But still I can't derive what $C(n)$ is in my question.
linear-algebra markov-chains perturbation-theory
linear-algebra markov-chains perturbation-theory
edited Mar 30 at 21:23
Bernard
124k741117
124k741117
asked Mar 30 at 21:22
Mengxiao ZhangMengxiao Zhang
133
133
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
I think I answered this here, but I'll translate into the setting of that question: Stationary distribution of convex combination of Markov chains
I believe there is no formula that only depends on $n$.
Here is my reasoning:
Instead of writing $P + F$, write $lambda P + (1 - lambda) Q$, with $F_lambda = ( lambda - 1) P + (1 - lambda)Q$.
Then we have $|F_lambda| leq (|P| + |Q|) ( 1- lambda) = 2n ( 1 - lambda)$, where $|M| = sum |M_ij|$, since $|P| = n$ for any transition Kernel. So
we can make $|F_lambda|$ as small as we want, by choosing the appropriate $lambda$.
So adding $F_lambda$ amounts to mixing with $Q$ by a factor of $lambda$. This is now in the setting of the link, which basically explained the following:
The original $P$ chain may be very lazy, and then adding $F_lambda$ will have a huge impact even for small $lambda$ (and make the stationary distribution immediately look a lot like $pi_Q$), or $Q$ might be extremely lazy, and adding it will have little impact, so the stationary distribution will continue to look like $pi_P$.
In light of this, the condition $|F_ij| leq epsilon |P_ij|$ seems to be ruling out the extremely lazy $P$ case : if $P$ is extremely lazy, then $F$ is basically the identity matrix, and adding it shouldn't change the stationary distribution too much. The inequality also rules out the case that $P + F$ can make transitions that $P$ couldn't: $F$ can't be positive where $P$ is zero.
In general the bound you give seems to be saying that if $Q$ is lazier than $P$, and doesn't introduce new jumps, you can get some control over the stationary distribution. That sounds reasonable.
What do you think?
$endgroup$
$begingroup$
Thank you for your explanation! I just have some more questions about this. If I know $|F_ij|le epsilon|P_ij|$ already, will it help to get a C(n)? I mean whether we can derive a stronger version of ||π^−π||1≤2(n−1)ϵ+O(ϵ2), something like ||π^−π||1≤2(n−1)||F_ij||+O(ϵ2)
$endgroup$
– Mengxiao Zhang
Mar 30 at 22:22
$begingroup$
@MengxiaoZhang I don't know, sorry. I suggest looking through the techniques in that paper and seeing if you can get their result into the form you desire. Please let me know if you learn anything interesting from doing that. :-) (Please scrutinize this answer to make sure it satisfies your reason -- I'm only a graduate student, and I didn't learn this from a book, so there could easily be a mistake in here.)
$endgroup$
– Lorenzo
Mar 30 at 22:30
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3168796%2fhow-the-perturbation-of-a-markov-chain-affect-the-stationary-distribution%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I think I answered this here, but I'll translate into the setting of that question: Stationary distribution of convex combination of Markov chains
I believe there is no formula that only depends on $n$.
Here is my reasoning:
Instead of writing $P + F$, write $lambda P + (1 - lambda) Q$, with $F_lambda = ( lambda - 1) P + (1 - lambda)Q$.
Then we have $|F_lambda| leq (|P| + |Q|) ( 1- lambda) = 2n ( 1 - lambda)$, where $|M| = sum |M_ij|$, since $|P| = n$ for any transition Kernel. So
we can make $|F_lambda|$ as small as we want, by choosing the appropriate $lambda$.
So adding $F_lambda$ amounts to mixing with $Q$ by a factor of $lambda$. This is now in the setting of the link, which basically explained the following:
The original $P$ chain may be very lazy, and then adding $F_lambda$ will have a huge impact even for small $lambda$ (and make the stationary distribution immediately look a lot like $pi_Q$), or $Q$ might be extremely lazy, and adding it will have little impact, so the stationary distribution will continue to look like $pi_P$.
In light of this, the condition $|F_ij| leq epsilon |P_ij|$ seems to be ruling out the extremely lazy $P$ case : if $P$ is extremely lazy, then $F$ is basically the identity matrix, and adding it shouldn't change the stationary distribution too much. The inequality also rules out the case that $P + F$ can make transitions that $P$ couldn't: $F$ can't be positive where $P$ is zero.
In general the bound you give seems to be saying that if $Q$ is lazier than $P$, and doesn't introduce new jumps, you can get some control over the stationary distribution. That sounds reasonable.
What do you think?
$endgroup$
$begingroup$
Thank you for your explanation! I just have some more questions about this. If I know $|F_ij|le epsilon|P_ij|$ already, will it help to get a C(n)? I mean whether we can derive a stronger version of ||π^−π||1≤2(n−1)ϵ+O(ϵ2), something like ||π^−π||1≤2(n−1)||F_ij||+O(ϵ2)
$endgroup$
– Mengxiao Zhang
Mar 30 at 22:22
$begingroup$
@MengxiaoZhang I don't know, sorry. I suggest looking through the techniques in that paper and seeing if you can get their result into the form you desire. Please let me know if you learn anything interesting from doing that. :-) (Please scrutinize this answer to make sure it satisfies your reason -- I'm only a graduate student, and I didn't learn this from a book, so there could easily be a mistake in here.)
$endgroup$
– Lorenzo
Mar 30 at 22:30
add a comment |
$begingroup$
I think I answered this here, but I'll translate into the setting of that question: Stationary distribution of convex combination of Markov chains
I believe there is no formula that only depends on $n$.
Here is my reasoning:
Instead of writing $P + F$, write $lambda P + (1 - lambda) Q$, with $F_lambda = ( lambda - 1) P + (1 - lambda)Q$.
Then we have $|F_lambda| leq (|P| + |Q|) ( 1- lambda) = 2n ( 1 - lambda)$, where $|M| = sum |M_ij|$, since $|P| = n$ for any transition Kernel. So
we can make $|F_lambda|$ as small as we want, by choosing the appropriate $lambda$.
So adding $F_lambda$ amounts to mixing with $Q$ by a factor of $lambda$. This is now in the setting of the link, which basically explained the following:
The original $P$ chain may be very lazy, and then adding $F_lambda$ will have a huge impact even for small $lambda$ (and make the stationary distribution immediately look a lot like $pi_Q$), or $Q$ might be extremely lazy, and adding it will have little impact, so the stationary distribution will continue to look like $pi_P$.
In light of this, the condition $|F_ij| leq epsilon |P_ij|$ seems to be ruling out the extremely lazy $P$ case : if $P$ is extremely lazy, then $F$ is basically the identity matrix, and adding it shouldn't change the stationary distribution too much. The inequality also rules out the case that $P + F$ can make transitions that $P$ couldn't: $F$ can't be positive where $P$ is zero.
In general the bound you give seems to be saying that if $Q$ is lazier than $P$, and doesn't introduce new jumps, you can get some control over the stationary distribution. That sounds reasonable.
What do you think?
$endgroup$
$begingroup$
Thank you for your explanation! I just have some more questions about this. If I know $|F_ij|le epsilon|P_ij|$ already, will it help to get a C(n)? I mean whether we can derive a stronger version of ||π^−π||1≤2(n−1)ϵ+O(ϵ2), something like ||π^−π||1≤2(n−1)||F_ij||+O(ϵ2)
$endgroup$
– Mengxiao Zhang
Mar 30 at 22:22
$begingroup$
@MengxiaoZhang I don't know, sorry. I suggest looking through the techniques in that paper and seeing if you can get their result into the form you desire. Please let me know if you learn anything interesting from doing that. :-) (Please scrutinize this answer to make sure it satisfies your reason -- I'm only a graduate student, and I didn't learn this from a book, so there could easily be a mistake in here.)
$endgroup$
– Lorenzo
Mar 30 at 22:30
add a comment |
$begingroup$
I think I answered this here, but I'll translate into the setting of that question: Stationary distribution of convex combination of Markov chains
I believe there is no formula that only depends on $n$.
Here is my reasoning:
Instead of writing $P + F$, write $lambda P + (1 - lambda) Q$, with $F_lambda = ( lambda - 1) P + (1 - lambda)Q$.
Then we have $|F_lambda| leq (|P| + |Q|) ( 1- lambda) = 2n ( 1 - lambda)$, where $|M| = sum |M_ij|$, since $|P| = n$ for any transition Kernel. So
we can make $|F_lambda|$ as small as we want, by choosing the appropriate $lambda$.
So adding $F_lambda$ amounts to mixing with $Q$ by a factor of $lambda$. This is now in the setting of the link, which basically explained the following:
The original $P$ chain may be very lazy, and then adding $F_lambda$ will have a huge impact even for small $lambda$ (and make the stationary distribution immediately look a lot like $pi_Q$), or $Q$ might be extremely lazy, and adding it will have little impact, so the stationary distribution will continue to look like $pi_P$.
In light of this, the condition $|F_ij| leq epsilon |P_ij|$ seems to be ruling out the extremely lazy $P$ case : if $P$ is extremely lazy, then $F$ is basically the identity matrix, and adding it shouldn't change the stationary distribution too much. The inequality also rules out the case that $P + F$ can make transitions that $P$ couldn't: $F$ can't be positive where $P$ is zero.
In general the bound you give seems to be saying that if $Q$ is lazier than $P$, and doesn't introduce new jumps, you can get some control over the stationary distribution. That sounds reasonable.
What do you think?
$endgroup$
I think I answered this here, but I'll translate into the setting of that question: Stationary distribution of convex combination of Markov chains
I believe there is no formula that only depends on $n$.
Here is my reasoning:
Instead of writing $P + F$, write $lambda P + (1 - lambda) Q$, with $F_lambda = ( lambda - 1) P + (1 - lambda)Q$.
Then we have $|F_lambda| leq (|P| + |Q|) ( 1- lambda) = 2n ( 1 - lambda)$, where $|M| = sum |M_ij|$, since $|P| = n$ for any transition Kernel. So
we can make $|F_lambda|$ as small as we want, by choosing the appropriate $lambda$.
So adding $F_lambda$ amounts to mixing with $Q$ by a factor of $lambda$. This is now in the setting of the link, which basically explained the following:
The original $P$ chain may be very lazy, and then adding $F_lambda$ will have a huge impact even for small $lambda$ (and make the stationary distribution immediately look a lot like $pi_Q$), or $Q$ might be extremely lazy, and adding it will have little impact, so the stationary distribution will continue to look like $pi_P$.
In light of this, the condition $|F_ij| leq epsilon |P_ij|$ seems to be ruling out the extremely lazy $P$ case : if $P$ is extremely lazy, then $F$ is basically the identity matrix, and adding it shouldn't change the stationary distribution too much. The inequality also rules out the case that $P + F$ can make transitions that $P$ couldn't: $F$ can't be positive where $P$ is zero.
In general the bound you give seems to be saying that if $Q$ is lazier than $P$, and doesn't introduce new jumps, you can get some control over the stationary distribution. That sounds reasonable.
What do you think?
answered Mar 30 at 22:04
LorenzoLorenzo
11.9k31740
11.9k31740
$begingroup$
Thank you for your explanation! I just have some more questions about this. If I know $|F_ij|le epsilon|P_ij|$ already, will it help to get a C(n)? I mean whether we can derive a stronger version of ||π^−π||1≤2(n−1)ϵ+O(ϵ2), something like ||π^−π||1≤2(n−1)||F_ij||+O(ϵ2)
$endgroup$
– Mengxiao Zhang
Mar 30 at 22:22
$begingroup$
@MengxiaoZhang I don't know, sorry. I suggest looking through the techniques in that paper and seeing if you can get their result into the form you desire. Please let me know if you learn anything interesting from doing that. :-) (Please scrutinize this answer to make sure it satisfies your reason -- I'm only a graduate student, and I didn't learn this from a book, so there could easily be a mistake in here.)
$endgroup$
– Lorenzo
Mar 30 at 22:30
add a comment |
$begingroup$
Thank you for your explanation! I just have some more questions about this. If I know $|F_ij|le epsilon|P_ij|$ already, will it help to get a C(n)? I mean whether we can derive a stronger version of ||π^−π||1≤2(n−1)ϵ+O(ϵ2), something like ||π^−π||1≤2(n−1)||F_ij||+O(ϵ2)
$endgroup$
– Mengxiao Zhang
Mar 30 at 22:22
$begingroup$
@MengxiaoZhang I don't know, sorry. I suggest looking through the techniques in that paper and seeing if you can get their result into the form you desire. Please let me know if you learn anything interesting from doing that. :-) (Please scrutinize this answer to make sure it satisfies your reason -- I'm only a graduate student, and I didn't learn this from a book, so there could easily be a mistake in here.)
$endgroup$
– Lorenzo
Mar 30 at 22:30
$begingroup$
Thank you for your explanation! I just have some more questions about this. If I know $|F_ij|le epsilon|P_ij|$ already, will it help to get a C(n)? I mean whether we can derive a stronger version of ||π^−π||1≤2(n−1)ϵ+O(ϵ2), something like ||π^−π||1≤2(n−1)||F_ij||+O(ϵ2)
$endgroup$
– Mengxiao Zhang
Mar 30 at 22:22
$begingroup$
Thank you for your explanation! I just have some more questions about this. If I know $|F_ij|le epsilon|P_ij|$ already, will it help to get a C(n)? I mean whether we can derive a stronger version of ||π^−π||1≤2(n−1)ϵ+O(ϵ2), something like ||π^−π||1≤2(n−1)||F_ij||+O(ϵ2)
$endgroup$
– Mengxiao Zhang
Mar 30 at 22:22
$begingroup$
@MengxiaoZhang I don't know, sorry. I suggest looking through the techniques in that paper and seeing if you can get their result into the form you desire. Please let me know if you learn anything interesting from doing that. :-) (Please scrutinize this answer to make sure it satisfies your reason -- I'm only a graduate student, and I didn't learn this from a book, so there could easily be a mistake in here.)
$endgroup$
– Lorenzo
Mar 30 at 22:30
$begingroup$
@MengxiaoZhang I don't know, sorry. I suggest looking through the techniques in that paper and seeing if you can get their result into the form you desire. Please let me know if you learn anything interesting from doing that. :-) (Please scrutinize this answer to make sure it satisfies your reason -- I'm only a graduate student, and I didn't learn this from a book, so there could easily be a mistake in here.)
$endgroup$
– Lorenzo
Mar 30 at 22:30
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3168796%2fhow-the-perturbation-of-a-markov-chain-affect-the-stationary-distribution%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown