Roland Speicher
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Roland Speicher has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- James A. Mingo
Department of Mathematics and Statistics, Queen’s University, Jeffery Hall, Kingston, Ontario, K7L 3N6, Canada
12 shared publications - Alexandru Nica
Department of Pure Mathematics, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
3 shared publications - Dimitri Shlyakhtenko
University of California, Los Angeles, USA
3 shared publications - Piotr Śniady
Institute of Mathematics, Polish Academy of Sciences
3 shared publications Reza Rashidi Far
3 shared publications- Stephen Curran
Department of Mathematics, University of California, Berkeley, California 94720
3 shared publications
Latest Publications
- 27 June 2017
- Published by Springer Nature
- p. 93-120
Asymptotic Freeness for Gaussian, Wigner, and Unitary Random Matrices
- 27 June 2017
- Published by Springer Nature
- p. 93-120
Asymptotic Freeness for Gaussian, Wigner, and Unitary Random Matrices
- 27 June 2017
- Published by Springer Nature
- p. 159-174
Free Group Factors and Freeness
- 27 June 2017
- Published by Springer Nature
- p. 281-318
Solutions to Exercises
- Open Access
Quantum invariant families of matrices in free probability
We consider (self-adjoint) families of infinite matrices of noncommutative random variables such that the joint distribution of their entries is invariant under conjugation by a free quantum group. For the free orthogonal and hyperoctahedral groups, we obtain complete characterizations of the invariant families in terms of an operator-valued $R$-cyclicity condition. This is a surprising contrast with the Aldous-Hoover characterization of jointly exchangeable arrays.
Open AccessQuantum invariant families of matrices in free probability
We consider (self-adjoint) families of infinite matrices of noncommutative random variables such that the joint distribution of their entries is invariant under conjugation by a free quantum group. For the free orthogonal and hyperoctahedral groups, we obtain complete characterizations of the invariant families in terms of an operator-valued $R$-cyclicity condition. This is a surprising contrast with the Aldous-Hoover characterization of jointly exchangeable arrays.
- 30 November 2010
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 117 (8) , 1158-1166
The Non-Commutative Cycle Lemma
- 30 November 2010
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 117 (8) , 1158-1166
The Non-Commutative Cycle Lemma
- Open Access
- 7 July 2010
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 362 (11) , 6029-6064
Resolvents of ℛ-diagonal operators
We consider the resolvent ( λ − a ) − 1 (\lambda -a)^{-1} of any R \mathscr {R} -diagonal operator a a in a I I 1 \mathrm {II}_1 -factor. Our main theorem (Theorem 1.1) gives a universal asymptotic formula for the norm of such a resolvent. En route to its proof, we calculate the R \mathscr {R} -transform of the operator | λ − c | 2 |\lambda -c|^2 where c c is Voiculescu’s circular operator, and we give an asymptotic formula for the negative moments of | λ − a | 2 |\lambda -a|^2 for any R \mathscr {R} -diagonal a a . We use a mixture of complex analytic and combinatorial techniques, each giving finer information where the other can give only coarse detail. In particular, we introduce partition structure diagrams in Section 4, a new combinatorial structure arising in free probability.
- 7 July 2010
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 362 (11) , 6029-6064
Open AccessResolvents of ℛ-diagonal operators
We consider the resolvent ( λ − a ) − 1 (\lambda -a)^{-1} of any R \mathscr {R} -diagonal operator a a in a I I 1 \mathrm {II}_1 -factor. Our main theorem (Theorem 1.1) gives a universal asymptotic formula for the norm of such a resolvent. En route to its proof, we calculate the R \mathscr {R} -transform of the operator | λ − c | 2 |\lambda -c|^2 where c c is Voiculescu’s circular operator, and we give an asymptotic formula for the negative moments of | λ − a | 2 |\lambda -a|^2 for any R \mathscr {R} -diagonal a a . We use a mixture of complex analytic and combinatorial techniques, each giving finer information where the other can give only coarse detail. In particular, we introduce partition structure diagrams in Section 4, a new combinatorial structure arising in free probability.
- Open Access
- 4 February 2010
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 149 (3-4) , 435-462
Stochastic aspects of easy quantum groups
- 4 February 2010
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 149 (3-4) , 435-462
Open AccessStochastic aspects of easy quantum groups
- Open Access
Asymptotic infinitesimal freeness with amalgamation for Haar quantum unitary random matrices
We consider the limiting distribution of $U_NA_NU_N^*$ and $B_N$ (and more general expressions), where $A_N$ and $B_N$ are $N \times N$ matrices with entries in a unital C$^*$-algebra $\mathcal B$ which have limiting $\mathcal B$-valued distributions as $N \to \infty$, and $U_N$ is a $N \times N$ Haar distributed quantum unitary random matrix with entries independent from $\mathcal B$. Under a boundedness assumption, we show that $U_NA_NU_N^*$ and $B_N$ are asymptotically free with amalgamation over $\mathcal B$. Moreover, this also holds in the stronger infinitesimal sense of Belinschi-Shlyakhtenko. We provide an example which demonstrates that this example may fail for classical Haar unitary random matrices when the algebra $\mathcal B$ is infinite-dimensional.Open AccessAsymptotic infinitesimal freeness with amalgamation for Haar quantum unitary random matrices
We consider the limiting distribution of $U_NA_NU_N^*$ and $B_N$ (and more general expressions), where $A_N$ and $B_N$ are $N \times N$ matrices with entries in a unital C$^*$-algebra $\mathcal B$ which have limiting $\mathcal B$-valued distributions as $N \to \infty$, and $U_N$ is a $N \times N$ Haar distributed quantum unitary random matrix with entries independent from $\mathcal B$. Under a boundedness assumption, we show that $U_NA_NU_N^*$ and $B_N$ are asymptotically free with amalgamation over $\mathcal B$. Moreover, this also holds in the stronger infinitesimal sense of Belinschi-Shlyakhtenko. We provide an example which demonstrates that this example may fail for classical Haar unitary random matrices when the algebra $\mathcal B$ is infinite-dimensional. - Open Access
The Non-Commutative Cycle Lemma
We present a non-commutative version of the cycle lemma of Dvoretsky and Motzkin that applies to free groups and use this result to solve a number of problems involving cyclic reduction in the free group. We also describe an application to random matrices, in particular the fluctuations of Kesten's Law.
Open AccessThe Non-Commutative Cycle Lemma
We present a non-commutative version of the cycle lemma of Dvoretsky and Motzkin that applies to free groups and use this result to solve a number of problems involving cyclic reduction in the free group. We also describe an application to random matrices, in particular the fluctuations of Kesten's Law.
- Open Access
Sharp Bounds for Sums Associated to Graphs of Matrices
We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form S_pi(N) := sum_{j_1, ..., j_2m = 1}^N t^1_{j_1 j_2} t^2_{j_3 j_4} ... t^m_{j_2m-1 j_2m} where some of the summation indices are constrained to be equal. The upper bound is easily obtained from a graph G associated to the constraints in the sum.
Open AccessSharp Bounds for Sums Associated to Graphs of Matrices
We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form S_pi(N) := sum_{j_1, ..., j_2m = 1}^N t^1_{j_1 j_2} t^2_{j_3 j_4} ... t^m_{j_2m-1 j_2m} where some of the summation indices are constrained to be equal. The upper bound is easily obtained from a graph G associated to the constraints in the sum.