Skip to main content
updated from distribution of certain means to F-statistics which seems more appropriate
Source Link

Central Limit Like theorem for the distribution of F-statistics on all possible partitions?

I'd be happy for simply a reference or even search terms as I feel like this has to be known*.

Suppose we have a known probability distribution $X$ and a fixed integer $n$. I am interested in the following distribution on all the set of partitions of $X$ interest into n (non-empty, if need be) sets. If $P = \amalg X_i$ is such a partition and $m_i = E(X_i)$, then the distribution's value at $P$$F_P$ is $ X_P = \frac{\sum m_i}{n}$.

Is there something like the Central Limit TheoremF statistic for this case? If I take a random partition $P$, I'd like to know something like its, can we approximate the p-value - what do we expect for $P$ and how much variation can we expectF?

This seems to be a way to define or test whether or not a division of $X$ into groups is meaningful: it is meaningful when the $X_P$ differs from a generic grouping by some fixed amountF-statistic's p-value is small. That'sThat's why I would think this is known.

Thanks!

I first asked this question yesterday on mathstackexchange here and didn't think it was appropriate since it's not a research related question. However, the suggested question/answers to this on mathoverflow and the little attention I have received on mathstatckexchange suggests this might be a more appropriate site. In either case, I will remove one of the two based on feedback.

Central Limit Like theorem for the distribution of all possible partitions?

I'd be happy for simply a reference or even search terms as I feel like this has to be known*.

Suppose we have a known probability distribution $X$ and a fixed integer $n$. I am interested in the following distribution on all the set of partitions of $X$ interest into n (non-empty, if need be) sets. If $P = \amalg X_i$ is such a partition and $m_i = E(X_i)$, then the distribution's value at $P$ is $ X_P = \frac{\sum m_i}{n}$.

Is there something like the Central Limit Theorem for this case? If I take a random partition $P$, I'd like to know something like its p-value - what do we expect for $P$ and how much variation can we expect?

This seems to be a way to define or test whether or not a division of $X$ into groups is meaningful: it is meaningful when the $X_P$ differs from a generic grouping by some fixed amount. That's why I would think this is known.

Thanks!

I first asked this question yesterday on mathstackexchange here and didn't think it was appropriate since it's not a research related question. However, the suggested question/answers to this on mathoverflow and the little attention I have received on mathstatckexchange suggests this might be a more appropriate site. In either case, I will remove one of the two based on feedback.

Central Limit Like theorem for the distribution of F-statistics on all possible partitions?

I'd be happy for simply a reference or even search terms as I feel like this has to be known*.

Suppose we have a known probability distribution $X$ and a fixed integer $n$. I am interested in the following distribution on all the set of partitions of $X$ into n (non-empty, if need be) sets. If $P = \amalg X_i$ is such a partition and $F_P$ is the F statistic for $P$,, can we approximate the p-value for F?

This seems to be a way to define or test whether or not a division of $X$ into groups is meaningful: it is meaningful when the F-statistic's p-value is small. That's why I would think this is known.

Thanks!

I first asked this question yesterday on mathstackexchange here and didn't think it was appropriate since it's not a research related question. However, the suggested question/answers to this on mathoverflow and the little attention I have received on mathstatckexchange suggests this might be a more appropriate site. In either case, I will remove one of the two based on feedback.

fixed copy/paste formatting issue
Source Link

I'd be happy for simply a reference or even search terms as I feel like this has to be known*.

Suppose we have a known probability distribution XX$X$ and a fixed integer nn$n$. I am interested in the following distribution on all the set of partitions of XX$X$ interest into n (non-empty, if need be) sets. If P=⨿XiP=⨿Xi is If $P = \amalg X_i$ is such a partition and mi=E(Xi)mi=E(Xi)$m_i = E(X_i)$, then the distribution's value at PP$P$ is XP=∑minXP=∑min$ X_P = \frac{\sum m_i}{n}$.

Is there something like the Central Limit Theorem for this case? If If I take a random partition PP$P$, I'd like to know something like its p-value - what do we expect for PP$P$ and how much variation can we expect?

This seems to be a way to define or test whether or not a division of XX$X$ into groups is meaningful: it it is meaningful when the XPXP$X_P$ differs from a generic grouping by some fixed amount. That's That's why I would think this is known.

Thanks!

I first asked this question yesterday on mathstackexchange here and didn't think it was appropriate since it's not a research related question. However, the suggested question/answers to this on mathoverflow and the little attention I have received on mathstatckexchange suggests this might be a more appropriate site. In either case, I will remove one of the two based on feedback.

I'd be happy for simply a reference or even search terms as I feel like this has to be known*.

Suppose we have a known probability distribution XX and a fixed integer nn. I am interested in the following distribution on all the set of partitions of XX interest into n (non-empty, if need be) sets. If P=⨿XiP=⨿Xi is such a partition and mi=E(Xi)mi=E(Xi), then the distribution's value at PP is XP=∑minXP=∑min.

Is there something like the Central Limit Theorem for this case? If I take a random partition PP, I'd like to know something like its p-value - what do we expect for PP and how much variation can we expect?

This seems to be a way to define or test whether or not a division of XX into groups is meaningful: it is meaningful when the XPXP differs from a generic grouping by some fixed amount. That's why I would think this is known.

Thanks!

I first asked this question yesterday on mathstackexchange here and didn't think it was appropriate since it's not a research related question. However, the suggested question/answers to this on mathoverflow and the little attention I have received on mathstatckexchange suggests this might be a more appropriate site. In either case, I will remove one of the two based on feedback.

I'd be happy for simply a reference or even search terms as I feel like this has to be known*.

Suppose we have a known probability distribution $X$ and a fixed integer $n$. I am interested in the following distribution on all the set of partitions of $X$ interest into n (non-empty, if need be) sets. If $P = \amalg X_i$ is such a partition and $m_i = E(X_i)$, then the distribution's value at $P$ is $ X_P = \frac{\sum m_i}{n}$.

Is there something like the Central Limit Theorem for this case? If I take a random partition $P$, I'd like to know something like its p-value - what do we expect for $P$ and how much variation can we expect?

This seems to be a way to define or test whether or not a division of $X$ into groups is meaningful: it is meaningful when the $X_P$ differs from a generic grouping by some fixed amount. That's why I would think this is known.

Thanks!

I first asked this question yesterday on mathstackexchange here and didn't think it was appropriate since it's not a research related question. However, the suggested question/answers to this on mathoverflow and the little attention I have received on mathstatckexchange suggests this might be a more appropriate site. In either case, I will remove one of the two based on feedback.

Source Link

Central Limit Like theorem for the distribution of all possible partitions?

I'd be happy for simply a reference or even search terms as I feel like this has to be known*.

Suppose we have a known probability distribution XX and a fixed integer nn. I am interested in the following distribution on all the set of partitions of XX interest into n (non-empty, if need be) sets. If P=⨿XiP=⨿Xi is such a partition and mi=E(Xi)mi=E(Xi), then the distribution's value at PP is XP=∑minXP=∑min.

Is there something like the Central Limit Theorem for this case? If I take a random partition PP, I'd like to know something like its p-value - what do we expect for PP and how much variation can we expect?

This seems to be a way to define or test whether or not a division of XX into groups is meaningful: it is meaningful when the XPXP differs from a generic grouping by some fixed amount. That's why I would think this is known.

Thanks!

I first asked this question yesterday on mathstackexchange here and didn't think it was appropriate since it's not a research related question. However, the suggested question/answers to this on mathoverflow and the little attention I have received on mathstatckexchange suggests this might be a more appropriate site. In either case, I will remove one of the two based on feedback.