Is it possible to compute the variance without computing the mean first?
$begingroup$
I have a list of values of a random variable $x in mathbb R$. Is it possible to find the varience $overline{(x - overline x)^2}$ without computing the mean $overline x$ first? That is to process the list only once.
probability statistics
$endgroup$
add a comment |
$begingroup$
I have a list of values of a random variable $x in mathbb R$. Is it possible to find the varience $overline{(x - overline x)^2}$ without computing the mean $overline x$ first? That is to process the list only once.
probability statistics
$endgroup$
add a comment |
$begingroup$
I have a list of values of a random variable $x in mathbb R$. Is it possible to find the varience $overline{(x - overline x)^2}$ without computing the mean $overline x$ first? That is to process the list only once.
probability statistics
$endgroup$
I have a list of values of a random variable $x in mathbb R$. Is it possible to find the varience $overline{(x - overline x)^2}$ without computing the mean $overline x$ first? That is to process the list only once.
probability statistics
probability statistics
edited Jan 24 '12 at 16:42
user21436
asked Jan 24 '12 at 16:39
YrogirgYrogirg
1,7361545
1,7361545
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
You can use that the variance is $overline{x^2} - overline {x}^2$, which takes only one pass (computing the mean and the mean of the squares simultaneously), but can be more prone to roundoff error if the variance is small compared with the mean.
$endgroup$
$begingroup$
oh, how could I forget this.
$endgroup$
– Yrogirg
Jan 24 '12 at 17:24
$begingroup$
And should have stated from wikipedia en.wikipedia.org/wiki/Algorithms_for_calculating_variance At first I thought it would be impossible and there would be no such algorithm.
$endgroup$
– Yrogirg
Jan 24 '12 at 18:48
add a comment |
$begingroup$
How about sum of squared pairwise differences ? Indeed, you can check by direct computation that
$$
2v_X = frac{1}{n(n-1)}sum_{1 le i < j le n}(x_i - x_j)^2.
$$
Disclaimer: This is not meant to be efficient, just another way to represent the variance, without first computing the mean.
$endgroup$
add a comment |
$begingroup$
The sample variance with mean is calculated as:
$$ v_{X}=frac{1}{n-1}sum_{i=1}^{n}(x_{i}-overline{x})^{2} $$
And the sample variance without mean as:
$$ v_{X}=frac{1}{n-1}left [ sum_{i=1}^{n}x_{i}^{2}-frac{1}{n}left ( sum_{i=1}^{n}x_{i} right ) ^{2}right ] $$
$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%2f102006%2fis-it-possible-to-compute-the-variance-without-computing-the-mean-first%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You can use that the variance is $overline{x^2} - overline {x}^2$, which takes only one pass (computing the mean and the mean of the squares simultaneously), but can be more prone to roundoff error if the variance is small compared with the mean.
$endgroup$
$begingroup$
oh, how could I forget this.
$endgroup$
– Yrogirg
Jan 24 '12 at 17:24
$begingroup$
And should have stated from wikipedia en.wikipedia.org/wiki/Algorithms_for_calculating_variance At first I thought it would be impossible and there would be no such algorithm.
$endgroup$
– Yrogirg
Jan 24 '12 at 18:48
add a comment |
$begingroup$
You can use that the variance is $overline{x^2} - overline {x}^2$, which takes only one pass (computing the mean and the mean of the squares simultaneously), but can be more prone to roundoff error if the variance is small compared with the mean.
$endgroup$
$begingroup$
oh, how could I forget this.
$endgroup$
– Yrogirg
Jan 24 '12 at 17:24
$begingroup$
And should have stated from wikipedia en.wikipedia.org/wiki/Algorithms_for_calculating_variance At first I thought it would be impossible and there would be no such algorithm.
$endgroup$
– Yrogirg
Jan 24 '12 at 18:48
add a comment |
$begingroup$
You can use that the variance is $overline{x^2} - overline {x}^2$, which takes only one pass (computing the mean and the mean of the squares simultaneously), but can be more prone to roundoff error if the variance is small compared with the mean.
$endgroup$
You can use that the variance is $overline{x^2} - overline {x}^2$, which takes only one pass (computing the mean and the mean of the squares simultaneously), but can be more prone to roundoff error if the variance is small compared with the mean.
answered Jan 24 '12 at 16:53
Ross MillikanRoss Millikan
297k23198371
297k23198371
$begingroup$
oh, how could I forget this.
$endgroup$
– Yrogirg
Jan 24 '12 at 17:24
$begingroup$
And should have stated from wikipedia en.wikipedia.org/wiki/Algorithms_for_calculating_variance At first I thought it would be impossible and there would be no such algorithm.
$endgroup$
– Yrogirg
Jan 24 '12 at 18:48
add a comment |
$begingroup$
oh, how could I forget this.
$endgroup$
– Yrogirg
Jan 24 '12 at 17:24
$begingroup$
And should have stated from wikipedia en.wikipedia.org/wiki/Algorithms_for_calculating_variance At first I thought it would be impossible and there would be no such algorithm.
$endgroup$
– Yrogirg
Jan 24 '12 at 18:48
$begingroup$
oh, how could I forget this.
$endgroup$
– Yrogirg
Jan 24 '12 at 17:24
$begingroup$
oh, how could I forget this.
$endgroup$
– Yrogirg
Jan 24 '12 at 17:24
$begingroup$
And should have stated from wikipedia en.wikipedia.org/wiki/Algorithms_for_calculating_variance At first I thought it would be impossible and there would be no such algorithm.
$endgroup$
– Yrogirg
Jan 24 '12 at 18:48
$begingroup$
And should have stated from wikipedia en.wikipedia.org/wiki/Algorithms_for_calculating_variance At first I thought it would be impossible and there would be no such algorithm.
$endgroup$
– Yrogirg
Jan 24 '12 at 18:48
add a comment |
$begingroup$
How about sum of squared pairwise differences ? Indeed, you can check by direct computation that
$$
2v_X = frac{1}{n(n-1)}sum_{1 le i < j le n}(x_i - x_j)^2.
$$
Disclaimer: This is not meant to be efficient, just another way to represent the variance, without first computing the mean.
$endgroup$
add a comment |
$begingroup$
How about sum of squared pairwise differences ? Indeed, you can check by direct computation that
$$
2v_X = frac{1}{n(n-1)}sum_{1 le i < j le n}(x_i - x_j)^2.
$$
Disclaimer: This is not meant to be efficient, just another way to represent the variance, without first computing the mean.
$endgroup$
add a comment |
$begingroup$
How about sum of squared pairwise differences ? Indeed, you can check by direct computation that
$$
2v_X = frac{1}{n(n-1)}sum_{1 le i < j le n}(x_i - x_j)^2.
$$
Disclaimer: This is not meant to be efficient, just another way to represent the variance, without first computing the mean.
$endgroup$
How about sum of squared pairwise differences ? Indeed, you can check by direct computation that
$$
2v_X = frac{1}{n(n-1)}sum_{1 le i < j le n}(x_i - x_j)^2.
$$
Disclaimer: This is not meant to be efficient, just another way to represent the variance, without first computing the mean.
edited Dec 14 '18 at 7:21
answered Dec 14 '18 at 7:10
dohmatobdohmatob
3,672629
3,672629
add a comment |
add a comment |
$begingroup$
The sample variance with mean is calculated as:
$$ v_{X}=frac{1}{n-1}sum_{i=1}^{n}(x_{i}-overline{x})^{2} $$
And the sample variance without mean as:
$$ v_{X}=frac{1}{n-1}left [ sum_{i=1}^{n}x_{i}^{2}-frac{1}{n}left ( sum_{i=1}^{n}x_{i} right ) ^{2}right ] $$
$endgroup$
add a comment |
$begingroup$
The sample variance with mean is calculated as:
$$ v_{X}=frac{1}{n-1}sum_{i=1}^{n}(x_{i}-overline{x})^{2} $$
And the sample variance without mean as:
$$ v_{X}=frac{1}{n-1}left [ sum_{i=1}^{n}x_{i}^{2}-frac{1}{n}left ( sum_{i=1}^{n}x_{i} right ) ^{2}right ] $$
$endgroup$
add a comment |
$begingroup$
The sample variance with mean is calculated as:
$$ v_{X}=frac{1}{n-1}sum_{i=1}^{n}(x_{i}-overline{x})^{2} $$
And the sample variance without mean as:
$$ v_{X}=frac{1}{n-1}left [ sum_{i=1}^{n}x_{i}^{2}-frac{1}{n}left ( sum_{i=1}^{n}x_{i} right ) ^{2}right ] $$
$endgroup$
The sample variance with mean is calculated as:
$$ v_{X}=frac{1}{n-1}sum_{i=1}^{n}(x_{i}-overline{x})^{2} $$
And the sample variance without mean as:
$$ v_{X}=frac{1}{n-1}left [ sum_{i=1}^{n}x_{i}^{2}-frac{1}{n}left ( sum_{i=1}^{n}x_{i} right ) ^{2}right ] $$
answered Sep 3 '17 at 16:34
FreemanFreeman
1184
1184
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%2f102006%2fis-it-possible-to-compute-the-variance-without-computing-the-mean-first%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