Mixing
What did Silverman (1981) mean by 'critical bandwidth'?
$begingroup$
In the selection of a bandwidth for a Kernel Density Estimator, critical bandwidth according to my understanding is:
"For every integer k, where 1<k<n, we can find the minimum width h(k) such that the kernel density estimate has at most k maxima. Silverman calls these h(k) values “critical widths.”
I don't intuitively understand this concept. Any help would be appreciated.
Thank you!
econometrics kernel-smoothing
edited Jan 16 at 23:07
Glen_b♦
212k22403750
asked Jan 14 at 22:24
Miles DavisMiles Davis
354
$endgroup$
add a comment |
$begingroup$
In the selection of a bandwidth for a Kernel Density Estimator, critical bandwidth according to my understanding is:
"For every integer k, where 1<k<n, we can find the minimum width h(k) such that the kernel density estimate has at most k maxima. Silverman calls these h(k) values “critical widths.”
I don't intuitively understand this concept. Any help would be appreciated.
Thank you!
econometrics kernel-smoothing
edited Jan 16 at 23:07
Glen_b♦
212k22403750
asked Jan 14 at 22:24
Miles DavisMiles Davis
354
$endgroup$
add a comment |
$begingroup$
In the selection of a bandwidth for a Kernel Density Estimator, critical bandwidth according to my understanding is:
"For every integer k, where 1<k<n, we can find the minimum width h(k) such that the kernel density estimate has at most k maxima. Silverman calls these h(k) values “critical widths.”
I don't intuitively understand this concept. Any help would be appreciated.
Thank you!
econometrics kernel-smoothing
edited Jan 16 at 23:07
Glen_b♦
212k22403750
asked Jan 14 at 22:24
Miles DavisMiles Davis
354
$endgroup$
In the selection of a bandwidth for a Kernel Density Estimator, critical bandwidth according to my understanding is:
"For every integer k, where 1<k<n, we can find the minimum width h(k) such that the kernel density estimate has at most k maxima. Silverman calls these h(k) values “critical widths.”
I don't intuitively understand this concept. Any help would be appreciated.
Thank you!
econometrics kernel-smoothing
econometrics kernel-smoothing
edited Jan 16 at 23:07
Glen_b♦
212k22403750
asked Jan 14 at 22:24
Miles DavisMiles Davis
354
edited Jan 16 at 23:07
Glen_b♦
212k22403750
asked Jan 14 at 22:24
Miles DavisMiles Davis
354
edited Jan 16 at 23:07
Glen_b♦
212k22403750
edited Jan 16 at 23:07
Glen_b♦
212k22403750
edited Jan 16 at 23:07
Glen_b♦
212k22403750
212k22403750
asked Jan 14 at 22:24
Miles DavisMiles Davis
354
asked Jan 14 at 22:24
Miles DavisMiles Davis
354
asked Jan 14 at 22:24
Miles DavisMiles Davis
354
354
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
I hate animations in Web pages, but this question begs for an animated answer:
These are KDEs for a set of three values (near -2.5, 0.5, and 2.5). Their bandwidths continually vary, growing from small to large. Watch as three peaks become two and ultimately one.
A KDE puts a pile of "probability" at each data point. As the bandwidth widens, the pile "slumps." When you start with tiny bandwidths, each data value contributes its own discrete pile. As the bandwidths grow, the piles slump and merge and accumulate on top of each other (the thick blue line), ultimately becoming one single pile. Along the way, the maxima change discontinuously from the starting value of $n$ (assuming the kernel has a single maximum, which is almost always the case) to $1.$ The critical width for $k$ maxima is the first (smallest) width that reduces the KDE to a curve with no more than $k$ maxima.
answered Jan 14 at 22:59
whuber♦whuber
204k33443813
$endgroup$
add a comment |
$begingroup$
If you have a really wide bandwidth, you'll get one peak in your KDE. If you reduce it a bit, its still one peak. Keep reducing it until you get to the switchover point of adding a second peak. That bandwidth is $h(1)$.
Now make it smaller still, until you get to the switchover between two peaks and three. That's $h(2)$.
And so forth.
At any bandwidth between $h(i-1)$ and $h(i)$ you will have $i$ peaks in your KDE.
Silverman wanted a name for that set of $h$-values; he called them critical bandwidths.
This comes up in his test for multimodality, for example.
answered Jan 14 at 22:32
Glen_b♦Glen_b
212k22403750
$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: "65"
};
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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
},
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%2fstats.stackexchange.com%2fquestions%2f387191%2fwhat-did-silverman-1981-mean-by-critical-bandwidth%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$
I hate animations in Web pages, but this question begs for an animated answer:
These are KDEs for a set of three values (near -2.5, 0.5, and 2.5). Their bandwidths continually vary, growing from small to large. Watch as three peaks become two and ultimately one.
A KDE puts a pile of "probability" at each data point. As the bandwidth widens, the pile "slumps." When you start with tiny bandwidths, each data value contributes its own discrete pile. As the bandwidths grow, the piles slump and merge and accumulate on top of each other (the thick blue line), ultimately becoming one single pile. Along the way, the maxima change discontinuously from the starting value of $n$ (assuming the kernel has a single maximum, which is almost always the case) to $1.$ The critical width for $k$ maxima is the first (smallest) width that reduces the KDE to a curve with no more than $k$ maxima.
answered Jan 14 at 22:59
whuber♦whuber
204k33443813
$endgroup$
add a comment |
$begingroup$
I hate animations in Web pages, but this question begs for an animated answer:
These are KDEs for a set of three values (near -2.5, 0.5, and 2.5). Their bandwidths continually vary, growing from small to large. Watch as three peaks become two and ultimately one.
A KDE puts a pile of "probability" at each data point. As the bandwidth widens, the pile "slumps." When you start with tiny bandwidths, each data value contributes its own discrete pile. As the bandwidths grow, the piles slump and merge and accumulate on top of each other (the thick blue line), ultimately becoming one single pile. Along the way, the maxima change discontinuously from the starting value of $n$ (assuming the kernel has a single maximum, which is almost always the case) to $1.$ The critical width for $k$ maxima is the first (smallest) width that reduces the KDE to a curve with no more than $k$ maxima.
answered Jan 14 at 22:59
whuber♦whuber
204k33443813
$endgroup$
add a comment |
$begingroup$
I hate animations in Web pages, but this question begs for an animated answer:
These are KDEs for a set of three values (near -2.5, 0.5, and 2.5). Their bandwidths continually vary, growing from small to large. Watch as three peaks become two and ultimately one.
A KDE puts a pile of "probability" at each data point. As the bandwidth widens, the pile "slumps." When you start with tiny bandwidths, each data value contributes its own discrete pile. As the bandwidths grow, the piles slump and merge and accumulate on top of each other (the thick blue line), ultimately becoming one single pile. Along the way, the maxima change discontinuously from the starting value of $n$ (assuming the kernel has a single maximum, which is almost always the case) to $1.$ The critical width for $k$ maxima is the first (smallest) width that reduces the KDE to a curve with no more than $k$ maxima.
answered Jan 14 at 22:59
whuber♦whuber
204k33443813
$endgroup$
I hate animations in Web pages, but this question begs for an animated answer:
These are KDEs for a set of three values (near -2.5, 0.5, and 2.5). Their bandwidths continually vary, growing from small to large. Watch as three peaks become two and ultimately one.
A KDE puts a pile of "probability" at each data point. As the bandwidth widens, the pile "slumps." When you start with tiny bandwidths, each data value contributes its own discrete pile. As the bandwidths grow, the piles slump and merge and accumulate on top of each other (the thick blue line), ultimately becoming one single pile. Along the way, the maxima change discontinuously from the starting value of $n$ (assuming the kernel has a single maximum, which is almost always the case) to $1.$ The critical width for $k$ maxima is the first (smallest) width that reduces the KDE to a curve with no more than $k$ maxima.
answered Jan 14 at 22:59
whuber♦whuber
204k33443813
edited Jan 14 at 23:06
answered Jan 14 at 22:59
whuber♦whuber
204k33443813
answered Jan 14 at 22:59
whuber♦whuber
204k33443813
answered Jan 14 at 22:59
whuber♦whuber
204k33443813
204k33443813
add a comment |
add a comment |
$begingroup$
If you have a really wide bandwidth, you'll get one peak in your KDE. If you reduce it a bit, its still one peak. Keep reducing it until you get to the switchover point of adding a second peak. That bandwidth is $h(1)$.
Now make it smaller still, until you get to the switchover between two peaks and three. That's $h(2)$.
And so forth.
At any bandwidth between $h(i-1)$ and $h(i)$ you will have $i$ peaks in your KDE.
Silverman wanted a name for that set of $h$-values; he called them critical bandwidths.
This comes up in his test for multimodality, for example.
answered Jan 14 at 22:32
Glen_b♦Glen_b
212k22403750
$endgroup$
add a comment |
$begingroup$
If you have a really wide bandwidth, you'll get one peak in your KDE. If you reduce it a bit, its still one peak. Keep reducing it until you get to the switchover point of adding a second peak. That bandwidth is $h(1)$.
Now make it smaller still, until you get to the switchover between two peaks and three. That's $h(2)$.
And so forth.
At any bandwidth between $h(i-1)$ and $h(i)$ you will have $i$ peaks in your KDE.
Silverman wanted a name for that set of $h$-values; he called them critical bandwidths.
This comes up in his test for multimodality, for example.
answered Jan 14 at 22:32
Glen_b♦Glen_b
212k22403750
$endgroup$
add a comment |
$begingroup$
If you have a really wide bandwidth, you'll get one peak in your KDE. If you reduce it a bit, its still one peak. Keep reducing it until you get to the switchover point of adding a second peak. That bandwidth is $h(1)$.
Now make it smaller still, until you get to the switchover between two peaks and three. That's $h(2)$.
And so forth.
At any bandwidth between $h(i-1)$ and $h(i)$ you will have $i$ peaks in your KDE.
Silverman wanted a name for that set of $h$-values; he called them critical bandwidths.
This comes up in his test for multimodality, for example.
answered Jan 14 at 22:32
Glen_b♦Glen_b
212k22403750
$endgroup$
If you have a really wide bandwidth, you'll get one peak in your KDE. If you reduce it a bit, its still one peak. Keep reducing it until you get to the switchover point of adding a second peak. That bandwidth is $h(1)$.
Now make it smaller still, until you get to the switchover between two peaks and three. That's $h(2)$.
And so forth.
At any bandwidth between $h(i-1)$ and $h(i)$ you will have $i$ peaks in your KDE.
Silverman wanted a name for that set of $h$-values; he called them critical bandwidths.
This comes up in his test for multimodality, for example.
answered Jan 14 at 22:32
Glen_b♦Glen_b
212k22403750
edited Jan 15 at 5:41
answered Jan 14 at 22:32
Glen_b♦Glen_b
212k22403750
answered Jan 14 at 22:32
Glen_b♦Glen_b
212k22403750
answered Jan 14 at 22:32
Glen_b♦Glen_b
212k22403750
212k22403750
add a comment |
add a comment |
Thanks for contributing an answer to Cross Validated!
- 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%2fstats.stackexchange.com%2fquestions%2f387191%2fwhat-did-silverman-1981-mean-by-critical-bandwidth%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
