You are currently browsing the category archive for the ‘Probability Theory’ category.

Just back from a great workshop at Seoul National University, I am just going to use this piece to outline in a relaxed manner my key goals for my work on random walks on quantum groups for the near future.

In the very short term I want to try and get a much sharper lower bound for my random walk on the Sekine family of quantum groups. I believe the projection onto the ‘middle’ of the M_n(\mathbb{C}) might provide something of use. On mature reflection, recognising that the application of the upper bound lemma is dominated by one set of terms in particular, it should be possible to use cruder but more elegant estimates to get the same upper bound except with lighter calculations (and also a smaller \alpha — see Section 5.7).

I also want to understand how sharp (or otherwise) the order n^n convergence for the random walk on the dual of S_n is — n^n sounds awfully high. Furthermore it should be possible to get a better lower bound that what I have.

It should also be possible to redefine the quantum total variation distance as a supremum over projections \sim subsets via G \supset S\leftrightarrow \mathbf{1}_S. If I can show that for a positive linear functional \rho that |\rho(a)|\leq \rho(|a|) then using these ideas I can. More on this soon hopefully. No, this approach won’t work.

The next thing I might like to do is look at a random walk on the Sekine quantum groups with an n-dependent driving probability and see if I can detect the cut-off phenomenon (Chapter 4). This will need good lower bounds for k\ll t_n, some cut-off time.

Going back to the start, the classical problem began around 1904 with the question of Markov:

Which card shuffles mix up a deck of cards and cause it to ‘go random’?

For example, the perfect riffle shuffle does not mix up the cards at all while a riffle shuffle done by an amateur will.

In the context of random walks on classical groups this question is answered by the Ergodic Theorem 1.3.2: when the driving probability is not concentrated on a subgroup (irreducibility) nor the coset of a normal subgroup (aperiodicity).

Necessary and sufficient conditions on the driving probability \nu\in M_p(\mathbb{G}) for the random walk on a quantum group to converge to random are required. It is expected that the conditions may be more difficult than the classical case. However, it may be possible to use Diaconis-Van Daele theory to get some results in this direction. It should be possible to completely analyse some examples (such as the Kac-Paljutkin quantum group of order 8).

This will involve a study of subgroups of quantum groups as well as normal quantum subgroups.

It should be straightforward to extend the Upper Bound Lemma (Lemma 5.3.8) to the case of compact Kac algebras. Once that is done I will want to look at quantum generalisations of ‘natural’ random walks and shuffles.

I intend also to put the PhD thesis on the Arxiv. After this I have a number of options as regard to publishing what I have or maybe waiting a little while until I solve the above problems — this will all depend on how my further study progresses.

 

Advertisements

Slides of a talk given at the Topological Quantum Groups and Harmonic Analysis workshop at Seoul National University, May 2017.

Abstract A central tool in the study of ergodic random walks on finite groups is the Upper Bound Lemma of Diaconis & Shahshahani. The Upper Bound Lemma uses the representation theory of the group to generate upper bounds for the distance to random and thus can be used to determine convergence rates for ergodic walks. These ideas are generalised to the case of finite quantum groups.

Taken from Condition Expectation in Quantum Probabilty by Denes Petz.

In quantum probability there are a number of fundamental questions that ask how faithfully can one quantise classical probability. Suppose that (\Omega,\mathcal{S},P) is a (classical) probability space and \mathcal{G}\subset\mathcal{A} a sub-\sigma-algebra. The conditional expectation of some integrable function f (with respect to some L-space) relative to \mathcal{G} is the orthogonal projection onto the closed subspace L(\mathcal{G}):

\mathbb{E}^{\mathcal{G}}:L(\mathcal{A})\rightarrow L(\mathcal{G})f\mapsto \mathbb{E}(f|\mathcal{G}).

Suppose now that (A,\rho) is a quantum probability space and that B is some C*-subalgebra of A. Can we always define a conditional expectation with respect to B? The answer turns out to be not always, although this paper gives sufficient conditions for the existence of such a projection. Briefly, things work the other way around. Distinguished states give rise to quantum conditional expectations — and these conditional expectations define a subalgebra. We can’t necessarily start with a subalgebra and find the state which gives rise to it — Theorem 2 gives necessary conditions in which this approach does work.

Read the rest of this entry »

Taken from Real Analysis and Probability by R.M. Dudley.

For a sequence of n repeated, independent trials of an experiment, some probability distributions and variables converge as n tends to infinity. In proving such limit theorems, it is useful to be able to construct a probability space on which a sequence of independent random variables is defined in a natural way; specifically, as coordinates for a countable Cartesian product.

The Cartesian product of finitely many \sigma-finite measure spaces gives a \sigma-finite measure space. For example, Cartesian products of Lesbesgue measure on the line give Lesbesgue measure on finite-dimensional Euclidean spaces. But suppose we take a measure space \{0,1\} with two points each having measure 1\mu(\{0\})=1=\mu(\{1\}), and form a countable Cartesian product of copies of this space, so that the measure of any countable product of sets equals the product of their measures. Then we would get an uncountable space in which all singletons have measure 1, giving the measure usually called counting measure. An uncountable set with counting measure is not a \sigma-finite space, although in this example it was a countable product of finite measure spaces. By contrast, the the countable product of probability measures will again be a probability space. Here are some definitions.

For each n=1,2,\dots let (\Omega_n,S_n,P_n) be a probability space. Let \Omega be the Cartesian product \displaystyle \prod_{n\geq 1}\Omega_n, that is, the set of all sequences \{\omega_n\}_{n\geq 1} with \omega_n\in\Omega_n for all n. Let \pi_n be the natural projection of \Omega onto \Omega_n for each n\pi_n\left(\{\omega_m\}_{m\geq 1}\right)=\omega_n for all n. Let S be the smallest \sigma-algebra of subsets of \Omega such that for all m\pi_m is measurable from (\Omega,S) to (\Omega_m,S_m). In other words, S is the smallest \sigma-algebra containing all sets \pi_n^{-1}(A) for all n and all A\in S_n.

Let \mathcal{R} be the collection of all sets \displaystyle \prod_{n\geq 1}A_n\subset\Omega where A_n\in \mathcal{S}_n for all n and A_m=\Omega_m except for at most finitely many values of n. Elements of \mathcal{R} will be called rectangles. Now recall the notion of semiring. \mathcal{R} has this property.

Read the rest of this entry »

%d bloggers like this: