For two independent random variables distributed uniformly on a $d$-sphere surface ($X_1,X_2\sim\operatorname{Unif}(S^d)$), it is obvious that $$\langle X_1,X_2\rangle\sim -\langle X_1,X_2\rangle$$ by symmetry of $X_1$ and linearity of the inner product. Can this notion be generalized to the joint distribution of the pairwise scalar combination of $n$ such variables by using symmetries in a clever way? Namely, does $$((1-\delta_{ij})\langle X_i,X_j\rangle)_{i,j=1}^n\sim (-(1-\delta_{ij})\langle X_i,X_j\rangle)_{i,j=1}^n$$ hold? By rotational invarince, one can derive the density of each such entry rather quick, but that does not seem helpful as the dependence/interaction is rather involved.
2026-03-25 17:42:17.1774460537
Distribution of $(\langle X_i,X_j\rangle)_{i,j=1}^n$ for $X_k\sim\operatorname{Unif}(S^d)$
55 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in PROBABILITY-DISTRIBUTIONS
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- Statistics based on empirical distribution
- Given $U,V \sim R(0,1)$. Determine covariance between $X = UV$ and $V$
- Comparing Exponentials of different rates
- Linear transform of jointly distributed exponential random variables, how to identify domain?
- Closed form of integration
- Given $X$ Poisson, and $f_{Y}(y\mid X = x)$, find $\mathbb{E}[X\mid Y]$
- weak limit similiar to central limit theorem
- Probability question: two doors, select the correct door to win money, find expected earning
- Calculating $\text{Pr}(X_1<X_2)$
Related Questions in RANDOM-GRAPHS
- Bound degrees of sparse random graphs
- Connectivity of random graphs - proof $\frac{logn}{n}$ is threshold
- In weighed random graph where the edge weight is restricted to $[0,1]$, what are the usual assumptions of edge weight distribution?
- Upper Bound on Vertices in SCC Graph of Directed Random Graph
- The degree of a vertex in $G(n,m)$ is approx. Poisson
- What is the expected length of the diameter of a special random graph?
- Clique numbers and Theorem 4.5.1 in "The Probabilistic Method" by Alon and Spencer
- Expected global clustering coefficient for Erdős–Rényi graph
- Probability of having a path of a given length in a random graph?
- Correlation for random graph (Erdos-Renyi)
Related Questions in RANDOM-MATRICES
- Distribution of min/max row sum of matrix with i.i.d. uniform random variables
- The Cauchy transform of Marchenko-Pastur law
- Is scaling (related to matrix size $n$) and eigenvalue calculation exchangeable when discussing eigenvalue distribution of random matrix
- What is an Operator Matrix for the operation which happens in the reverse direction?
- Variance of $\mathrm{Proj}_{\mathcal{R}(A^T)}(z)$ for $z \sim \mathcal{N}(0, I_m)$.
- How to simulate a random unitary matrix with the condition that each entry is a complex number with the absolute value 1 in matlab
- Explaining a model that obtain matrice A and B from M by solving optimization problem
- How to bound the L-2 norm of the product of two non-square matrices
- Expected number of operations until matrix contains no zeros.
- How should I proceed to solve the below mentioned non-convex optimisation problem?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The thing you want just isn't true: if you have $n=5$ random variables distributed uniformly on $S^1$, for instance, then it's impossible for $\langle X_i, X_j\rangle$ to be negative for all pairs $i\ne j$. However, it's perfectly possible (and happens with probability better than $\frac{1}{4^4}$: the chances that all of $X_1, X_2, \dots, X_5$ land in the same quadrant) that $\langle X_i, X_j\rangle$ is positive for all pairs $i \ne j$.
(The same thing happens in any dimension if you take $n$ large enough as a function of $d$.)