Does this form of matrix have a name?
$begingroup$
I'm looking for the name of this kind of $n$-by-$n$ matrix:
$$left(begin{array}{cccc}
-s_1 & b_{12} & b_{13} & b_{14} \
b_{21} & -s_2 & b_{23} & b_{24} \
b_{31} & b_{32} & -s_3 & b_{34} \
b_{41} & b_{42} & b_{43} & -s_4
end{array}right)$$
where $s_i = sum_{jneq i} b_{ij}$. This is basically so I can google it, so by name I really mean an appropriate "search string".
linear-algebra matrices
$endgroup$
add a comment |
$begingroup$
I'm looking for the name of this kind of $n$-by-$n$ matrix:
$$left(begin{array}{cccc}
-s_1 & b_{12} & b_{13} & b_{14} \
b_{21} & -s_2 & b_{23} & b_{24} \
b_{31} & b_{32} & -s_3 & b_{34} \
b_{41} & b_{42} & b_{43} & -s_4
end{array}right)$$
where $s_i = sum_{jneq i} b_{ij}$. This is basically so I can google it, so by name I really mean an appropriate "search string".
linear-algebra matrices
$endgroup$
$begingroup$
I think it's the Q-matrix of a continuous time Markov chain, but I'm not sure...
$endgroup$
– user71815
Jun 12 '13 at 11:29
$begingroup$
Sounds about right
$endgroup$
– Lucas
Jun 12 '13 at 15:50
$begingroup$
It reminds of a adjacency matrix (see wiki). Your matrix is minus the neighborhood matrix for the Besag model (slide 10).
$endgroup$
– Rafael
Dec 14 '18 at 22:58
add a comment |
$begingroup$
I'm looking for the name of this kind of $n$-by-$n$ matrix:
$$left(begin{array}{cccc}
-s_1 & b_{12} & b_{13} & b_{14} \
b_{21} & -s_2 & b_{23} & b_{24} \
b_{31} & b_{32} & -s_3 & b_{34} \
b_{41} & b_{42} & b_{43} & -s_4
end{array}right)$$
where $s_i = sum_{jneq i} b_{ij}$. This is basically so I can google it, so by name I really mean an appropriate "search string".
linear-algebra matrices
$endgroup$
I'm looking for the name of this kind of $n$-by-$n$ matrix:
$$left(begin{array}{cccc}
-s_1 & b_{12} & b_{13} & b_{14} \
b_{21} & -s_2 & b_{23} & b_{24} \
b_{31} & b_{32} & -s_3 & b_{34} \
b_{41} & b_{42} & b_{43} & -s_4
end{array}right)$$
where $s_i = sum_{jneq i} b_{ij}$. This is basically so I can google it, so by name I really mean an appropriate "search string".
linear-algebra matrices
linear-algebra matrices
asked Jun 12 '13 at 11:25
LucasLucas
1,032720
1,032720
$begingroup$
I think it's the Q-matrix of a continuous time Markov chain, but I'm not sure...
$endgroup$
– user71815
Jun 12 '13 at 11:29
$begingroup$
Sounds about right
$endgroup$
– Lucas
Jun 12 '13 at 15:50
$begingroup$
It reminds of a adjacency matrix (see wiki). Your matrix is minus the neighborhood matrix for the Besag model (slide 10).
$endgroup$
– Rafael
Dec 14 '18 at 22:58
add a comment |
$begingroup$
I think it's the Q-matrix of a continuous time Markov chain, but I'm not sure...
$endgroup$
– user71815
Jun 12 '13 at 11:29
$begingroup$
Sounds about right
$endgroup$
– Lucas
Jun 12 '13 at 15:50
$begingroup$
It reminds of a adjacency matrix (see wiki). Your matrix is minus the neighborhood matrix for the Besag model (slide 10).
$endgroup$
– Rafael
Dec 14 '18 at 22:58
$begingroup$
I think it's the Q-matrix of a continuous time Markov chain, but I'm not sure...
$endgroup$
– user71815
Jun 12 '13 at 11:29
$begingroup$
I think it's the Q-matrix of a continuous time Markov chain, but I'm not sure...
$endgroup$
– user71815
Jun 12 '13 at 11:29
$begingroup$
Sounds about right
$endgroup$
– Lucas
Jun 12 '13 at 15:50
$begingroup$
Sounds about right
$endgroup$
– Lucas
Jun 12 '13 at 15:50
$begingroup$
It reminds of a adjacency matrix (see wiki). Your matrix is minus the neighborhood matrix for the Besag model (slide 10).
$endgroup$
– Rafael
Dec 14 '18 at 22:58
$begingroup$
It reminds of a adjacency matrix (see wiki). Your matrix is minus the neighborhood matrix for the Besag model (slide 10).
$endgroup$
– Rafael
Dec 14 '18 at 22:58
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
We have diagonally dominant matrices if absolute values of diagonal elements are larger than sum of absolute values of the others in that row.
Such matrices are invertible, ie. nonzero determinant.
$endgroup$
add a comment |
$begingroup$
In your matrix the row sums are null.
In a Stochastic Matrix they are equal to $1$, with the elements being non-negative.
If your $b_{i,j}$'s are also non negative, then your matrix is essentially a diagonal matrix $times$ (a stochastic matrix minus $I$).
And that in brackets is a matrix that , in a Markov chain, gives the difference between the configuration at step $n+1$ wrt that at step $n$.
$endgroup$
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%2f418310%2fdoes-this-form-of-matrix-have-a-name%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
We have diagonally dominant matrices if absolute values of diagonal elements are larger than sum of absolute values of the others in that row.
Such matrices are invertible, ie. nonzero determinant.
$endgroup$
add a comment |
$begingroup$
We have diagonally dominant matrices if absolute values of diagonal elements are larger than sum of absolute values of the others in that row.
Such matrices are invertible, ie. nonzero determinant.
$endgroup$
add a comment |
$begingroup$
We have diagonally dominant matrices if absolute values of diagonal elements are larger than sum of absolute values of the others in that row.
Such matrices are invertible, ie. nonzero determinant.
$endgroup$
We have diagonally dominant matrices if absolute values of diagonal elements are larger than sum of absolute values of the others in that row.
Such matrices are invertible, ie. nonzero determinant.
answered May 4 '16 at 6:36
Behnam EsmayliBehnam Esmayli
1,956515
1,956515
add a comment |
add a comment |
$begingroup$
In your matrix the row sums are null.
In a Stochastic Matrix they are equal to $1$, with the elements being non-negative.
If your $b_{i,j}$'s are also non negative, then your matrix is essentially a diagonal matrix $times$ (a stochastic matrix minus $I$).
And that in brackets is a matrix that , in a Markov chain, gives the difference between the configuration at step $n+1$ wrt that at step $n$.
$endgroup$
add a comment |
$begingroup$
In your matrix the row sums are null.
In a Stochastic Matrix they are equal to $1$, with the elements being non-negative.
If your $b_{i,j}$'s are also non negative, then your matrix is essentially a diagonal matrix $times$ (a stochastic matrix minus $I$).
And that in brackets is a matrix that , in a Markov chain, gives the difference between the configuration at step $n+1$ wrt that at step $n$.
$endgroup$
add a comment |
$begingroup$
In your matrix the row sums are null.
In a Stochastic Matrix they are equal to $1$, with the elements being non-negative.
If your $b_{i,j}$'s are also non negative, then your matrix is essentially a diagonal matrix $times$ (a stochastic matrix minus $I$).
And that in brackets is a matrix that , in a Markov chain, gives the difference between the configuration at step $n+1$ wrt that at step $n$.
$endgroup$
In your matrix the row sums are null.
In a Stochastic Matrix they are equal to $1$, with the elements being non-negative.
If your $b_{i,j}$'s are also non negative, then your matrix is essentially a diagonal matrix $times$ (a stochastic matrix minus $I$).
And that in brackets is a matrix that , in a Markov chain, gives the difference between the configuration at step $n+1$ wrt that at step $n$.
answered Dec 14 '18 at 23:56
G CabG Cab
19.4k31238
19.4k31238
add a comment |
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%2f418310%2fdoes-this-form-of-matrix-have-a-name%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
$begingroup$
I think it's the Q-matrix of a continuous time Markov chain, but I'm not sure...
$endgroup$
– user71815
Jun 12 '13 at 11:29
$begingroup$
Sounds about right
$endgroup$
– Lucas
Jun 12 '13 at 15:50
$begingroup$
It reminds of a adjacency matrix (see wiki). Your matrix is minus the neighborhood matrix for the Besag model (slide 10).
$endgroup$
– Rafael
Dec 14 '18 at 22:58