Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with random-matrices
Search options questions only
not deleted
user 6094
Statistics of spectral properties of matrix-valued random variables.
19
votes
2
answers
568
views
Repeated random two-steps in $\mathbb{R}^3$: unbounded?
I created a random isometry $T$ of $\mathbb{R}^3$ by generating
a random orthogonal matrix $M$,
uniformly distributed among all such,
and a random displacement $v$, whose coordinates
are drawn from a …
- 151k
13
votes
1
answer
882
views
Probability that random nonnegative integer matrix is singular
Q. What is the probability that an $n \times n$ matrix, whose elements
are independent uniformly random integers in $\{0,1,\ldots,k\}$, is singular?
For example, for $n=3$ and $k=2$, the first …
- 151k
10
votes
1
answer
425
views
Complexity of the union of randomly rotated unit cubes
It is a remarkable fact that the union of congrent cubes
has only at most near-quadratic combinatorial complexity,
$O^*(n^2)$ for $n$ cubes, known to be almost tight.
This contrasts with the union of …
- 151k