Skip to main content
MathOverflow

Return to Question

deleted 1 characters in body
Source Link
John Jiang
John Jiang
  • 4.5k
  • 25
  • 47

The statement of Hoeffding's combinatorial central limit theorem is as follows: given for each $n$, an $n \times n$ matrix $A = (a_{ij})$, one can consider the random diagonal sum: $$\displaystyle f(\sigma) = \sum_{i=1}^n a_{i,\sigma(i)}$$ where $\sigma$ is a uniformly chosen element in $S_n$. Then after appropriate centering and linear scaling, $f(\sigma)$ converges to the standard normal random variable in distribution. The sharpest result in this direction is presumably given by Bolthausen. There has been an extension by Zhao, Bai, Chao, and Liang of this result to the case of doubly indexed matrix $A= (a_{ij,kl})$, and the associated random diagonal $f(\sigma) = \sum_{i \neq j} (a_{ij, \sigma(i) \sigma(j)}$$f(\sigma) = \sum_{i \neq j} a_{ij, \sigma(i) \sigma(j)}$, which is also Gaussian in the limit after centering and scaling. But I only know this one extension. It seems that the statement is true for a wide variety of other group actions (the previous two examples correspond to $S_n$ acting on elements in a $n$-object set or on pairs of elements in that set). So for instance one surmises that the action of $GL(n,q)$ would give a q-analogue of combinatorial CLT, or even the action of $SO(n)$ on $S^{n-1}$. But I haven't been able to find any result in these directions. It would be supreme to even prove a result that establishes CLT under a general condition about the group action itself.

The statement of Hoeffding's combinatorial central limit theorem is as follows: given for each $n$, an $n \times n$ matrix $A = (a_{ij})$, one can consider the random diagonal sum: $$\displaystyle f(\sigma) = \sum_{i=1}^n a_{i,\sigma(i)}$$ where $\sigma$ is a uniformly chosen element in $S_n$. Then after appropriate centering and linear scaling, $f(\sigma)$ converges to the standard normal random variable in distribution. The sharpest result in this direction is presumably given by Bolthausen. There has been an extension by Zhao, Bai, Chao, and Liang of this result to the case of doubly indexed matrix $A= (a_{ij,kl})$, and the associated random diagonal $f(\sigma) = \sum_{i \neq j} (a_{ij, \sigma(i) \sigma(j)}$, which is also Gaussian in the limit after centering and scaling. But I only know this one extension. It seems that the statement is true for a wide variety of other group actions (the previous two examples correspond to $S_n$ acting on elements in a $n$-object set or on pairs of elements in that set). So for instance one surmises that the action of $GL(n,q)$ would give a q-analogue of combinatorial CLT, or even the action of $SO(n)$ on $S^{n-1}$. But I haven't been able to find any result in these directions. It would be supreme to even prove a result that establishes CLT under a general condition about the group action itself.

The statement of Hoeffding's combinatorial central limit theorem is as follows: given for each $n$, an $n \times n$ matrix $A = (a_{ij})$, one can consider the random diagonal sum: $$\displaystyle f(\sigma) = \sum_{i=1}^n a_{i,\sigma(i)}$$ where $\sigma$ is a uniformly chosen element in $S_n$. Then after appropriate centering and linear scaling, $f(\sigma)$ converges to the standard normal random variable in distribution. The sharpest result in this direction is presumably given by Bolthausen. There has been an extension by Zhao, Bai, Chao, and Liang of this result to the case of doubly indexed matrix $A= (a_{ij,kl})$, and the associated random diagonal $f(\sigma) = \sum_{i \neq j} a_{ij, \sigma(i) \sigma(j)}$, which is also Gaussian in the limit after centering and scaling. But I only know this one extension. It seems that the statement is true for a wide variety of other group actions (the previous two examples correspond to $S_n$ acting on elements in a $n$-object set or on pairs of elements in that set). So for instance one surmises that the action of $GL(n,q)$ would give a q-analogue of combinatorial CLT, or even the action of $SO(n)$ on $S^{n-1}$. But I haven't been able to find any result in these directions. It would be supreme to even prove a result that establishes CLT under a general condition about the group action itself.

Source Link
John Jiang
John Jiang
  • 4.5k
  • 25
  • 47

Where can I find analogues of combinatorial central limit theorems for other groups

The statement of Hoeffding's combinatorial central limit theorem is as follows: given for each $n$, an $n \times n$ matrix $A = (a_{ij})$, one can consider the random diagonal sum: $$\displaystyle f(\sigma) = \sum_{i=1}^n a_{i,\sigma(i)}$$ where $\sigma$ is a uniformly chosen element in $S_n$. Then after appropriate centering and linear scaling, $f(\sigma)$ converges to the standard normal random variable in distribution. The sharpest result in this direction is presumably given by Bolthausen. There has been an extension by Zhao, Bai, Chao, and Liang of this result to the case of doubly indexed matrix $A= (a_{ij,kl})$, and the associated random diagonal $f(\sigma) = \sum_{i \neq j} (a_{ij, \sigma(i) \sigma(j)}$, which is also Gaussian in the limit after centering and scaling. But I only know this one extension. It seems that the statement is true for a wide variety of other group actions (the previous two examples correspond to $S_n$ acting on elements in a $n$-object set or on pairs of elements in that set). So for instance one surmises that the action of $GL(n,q)$ would give a q-analogue of combinatorial CLT, or even the action of $SO(n)$ on $S^{n-1}$. But I haven't been able to find any result in these directions. It would be supreme to even prove a result that establishes CLT under a general condition about the group action itself.