Quantum Probability and Asymptotic Spectral Analysis of Growing Roma, GraphsNovember 14, / 47
|
|
- Alfred Atkins
- 5 years ago
- Views:
Transcription
1 Quantum Probability and Asymptotic Spectral Analysis of Growing Graphs Nobuaki Obata GSIS, Tohoku University Roma, November 14, 2013 Quantum Probability and Asymptotic Spectral Analysis of Growing Roma, GraphsNovember 14, / 47
2 Plan 1 Asymptotic Spectral Analysis of Graphs 2 Quantum Probability 3 Quantum Probabilistic Approach to Spectral Graph Theory 4 Graph Products and Concepts of Independence 5 Method of Quantum Decomposition 6 Method of Quantum Decomposition for Growing Graphs presentation: Roma, November 14, 2013 Quantum Probability and Asymptotic Spectral Analysis of Growing Roma, GraphsNovember 14, / 47
3 1 Asymptotic Spectral Analysis of Graphs Quantum Probability and Asymptotic Spectral Analysis of Growing Roma, GraphsNovember 14, / 47
4 11 Graphs and Adjacency Matrices Definition (graph) A graph is a pair G = (V, E), where V is the set of vertices and E the set of edges We write x y (adjacent) if they are connected by an edge complete graph K 5 2-dim lattice homogeneous tree star graph T 4 Definition (adjacency matrix) The adjacency matrix of a graph G = (V, E) is defined by 1, x y, A = [A xy ] x,y V A xy = 0, otherwise The adjacency matrix possesses all the information of a graph Quantum Probability and Asymptotic Spectral Analysis of Growing Roma, GraphsNovember 14, / 47
5 12 Spectra of Graphs Definition (spectrum and spectral distribution) Let G be a finite graph The spectrum (eigenvalues) of G is the list of eigenvalues of the adjacency matrix A ( ) λ i Spec (G) = m i The spectral (eigenvalue) distribution of G is defined by µ G = 1 V m iδ λi 1 Spec (G) is a fundamental invariant of finite graphs 2 (isospectral problem) Non-isomorphic graphs may have the same spectra 3 Adjacency matrix, Laplacian matrix, distance matrix, Q-matrix, etc For algebraic graph theory or spectral graph theory see N Biggs: Algebraic Graph Theory, Cambridge UP, 1993 D M Cvetković, M Doob and H Sachs: Spectra of Graphs, Academic Press, 1979 i Quantum Probability and Asymptotic Spectral Analysis of Growing Roma, GraphsNovember 14, / 47
6 13 Asymptotic Spectral Analysis of Large/Growing Graphs Our Aim is to extend the spectral graph theory to cover 1 infinite graphs A is no longer a finite matrix and eigenvalues make no sense 2 growing graphs interests in the asymptotic properties (asymptotic combinatorics) G G G Then the adjacency matrix A should be studied as 1 an operator acting on a suitable Hilbert space: Af(x) = y V A xyf(y), f C 0(V ) l 2 (V ); 2 a random variable in a suitable framework of probability theory Quantum Probability and Asymptotic Spectral Analysis of Growing Roma, GraphsNovember 14, / 47
7 14 Illustration: Path Graphs P n ad n A = n 1 kπ 2 cos Spec (P n ) = n n 1 k n π 4 x Quantum Probability and Asymptotic Spectral Analysis of Growing Roma, GraphsNovember 14, / 47
8 2 Quantum Probability = Non-Commutative Probability K R Parthasarathy: An Introduction to Quantum Stochastic Calculus, Birkhäuser, 1992 P-A Meyer: Quantum Probability for Probabilists, Lect Notes in Math Vol 1538, Springer, 1993 L Accardi, Y G Lu and I Volovich: Quantum Theory and Its Stochastic Limit, Springer, 2002 Quantum Probability and Asymptotic Spectral Analysis of Growing Roma, GraphsNovember 14, / 47
9 21 Quantum Probabilistic Model for Coin-toss Traditional Model for Coin-toss A random variable X on a probability space (Ω, F, P ) satisfying the property: P (X = +1) = P (X = 1) = 1 2 More essential is the probability distribution of X: µ X = 1 2 δ δ+1 Quantum Probability and Asymptotic Spectral Analysis of Growing Roma, GraphsNovember 14, / 47
10 21 Quantum Probabilistic Model for Coin-toss Traditional Model for Coin-toss A random variable X on a probability space (Ω, F, P ) satisfying the property: P (X = +1) = P (X = 1) = 1 2 More essential is the probability distribution of X: µ X = 1 2 δ δ+1 Moment sequence is one of the most fundamental characteristics Moment sequence {M m } Probability distributions µ For a coin-toss we have M m(µ X) = Up to determinate moment problem + x m 1, if m is even, µ X(dx) = 0, otherwise Quantum Probability and Asymptotic Spectral Analysis of Growing Roma, GraphsNovember 14, / 47
11 21 Quantum Probabilistic Model for Coin-toss (cont) Let us observe: [ ] [ ] [ ] A =, e 0 =, e 1 = It is straightforward to see that { } e 0, A m 1, if m is even, e 0 = = M m (µ X ) = 0, otherwise, + x m µ X (dx) 1 In other words, we have another model of coin-toss by means of the matrix A 2 Matrices form a non-commutative algebra so we say Quantum probabilistic (or non-commutative) model for cointoss A = -algebra generated by A; φ(a) = e 0, ae 0, a A, We call A an algebraic realization of the random variable X Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
12 22 Axioms: Quantum Probability Definition (Algebraic probability space) An algebraic probability space is a pair (A, φ), where A is a -algebra over C with multiplication unit 1 A, and a state φ : A C, ie, (i) φ is linear; (ii) φ(a a) 0; (iii) φ(1 A ) = 1 Each a A is called an (algebraic) random variable Definition (Spectral distribution) For a real random variable a = a A there exists a probability measure µ on R = (, + ) such that φ(a m ) = + x m µ(dx) M m(µ), m = 1, 2, This µ is called the spectral distribution of a (with respect to the state φ) Existence of µ by Hamburger s theorem using Hanckel determinants In general, µ is not uniquely determined (indeterminate moment problem) Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
13 23 Concept of Independence and Central Limit Theorem (classical) Classical independence If two random variables X, Y are independent, we have E[XY Y XY XX] = Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
14 23 Concept of Independence and Central Limit Theorem (classical) Classical independence If two random variables X, Y are independent, we have E[XY Y XY XX] = E[X 4 Y 3 ] = E[X 4 ]E[Y 3 ] Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
15 23 Concept of Independence and Central Limit Theorem (classical) Classical independence If two random variables X, Y are independent, we have E[XY Y XY XX] = E[X 4 Y 3 ] = E[X 4 ]E[Y 3 ] Classical central limit theorem (classical CLT) If X 1, X 2, are independent, identically distributed, normalized (mean zero, variance one) random variables, then distribution) in the limit: ( lim P N 1 N 1 N N n=1 N n=1 X n obeys the standard normal law (Gaussian X n a ) = 1 2π a e x2 /2 dx, or equivalently, for all bounded continuous functions f, [ ( N )] lim E 1 f X n = 1 + f(x)e x2 /2 dx N N n=1 2π Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
16 Classical CLT in moment form If X 1, X 2, are independent, identically distributed, normalized (mean zero, variance one) random variables having moments of all orders, we have lim E N [( 1 N N n=1 X n ) m ] = 1 + x m e x2 /2 dx, m = 1, 2, 2π 1 For the proof the factorization rule is essential E[X 1 X 3 X 1 X 2 X 1 X 3 X 1 ] = E[X 4 1 X 2X 2 3 ] = E[X 4 1 ]E[X 2]E[X 2 3 ] 2 If X 1, X 2, X 2, are non-commutative, what can we do for E[X 1 X 3 X 1 X 2 X 1 X 3 X 1 ]? = E[X 4 1 X 2 X 2 3 ]? = E[X 4 1 ]E[X 2 ]E[X 2 3 ] 3 As a result, there are many different factorization rules various concepts of independence Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
17 24 Four Concepts of Independence and Quantum CLTs Consider an algebraic probability space and (A, φ) and a A 1, b A 2 commutative free Boolean monotone φ(aba) φ(a 2 )φ(b) φ(a 2 )φ(b) φ(a) 2 φ(b) φ(a 2 )φ(b) φ(bab) φ(a)φ(b 2 ) φ(a)φ(b 2 ) φ(a)φ(b) 2 φ(a)φ(b) 2 φ(a) 2 φ(b 2 ) φ(abab) φ(a 2 )φ(b 2 ) +φ(a 2 )φ(b) 2 φ(a) 2 φ(b) 2 φ(a 2 )φ(b) 2 φ(a) 2 φ(b) 2 CLM Gaussian Wigner Bernoulli arcsine Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
18 24 Four Concepts of Independence and Quantum CLTs Consider an algebraic probability space and (A, φ) and a A 1, b A 2 commutative free Boolean monotone φ(aba) φ(a 2 )φ(b) φ(a 2 )φ(b) φ(a) 2 φ(b) φ(a 2 )φ(b) φ(bab) φ(a)φ(b 2 ) φ(a)φ(b 2 ) φ(a)φ(b) 2 φ(a)φ(b) 2 φ(a) 2 φ(b 2 ) φ(abab) φ(a 2 )φ(b 2 ) +φ(a 2 )φ(b) 2 φ(a) 2 φ(b) 2 φ(a 2 )φ(b) 2 φ(a) 2 φ(b) 2 CLM Gaussian Wigner Bernoulli arcsine CLM (Central Limit Measure) µ is obtained from a sequence of normalized random variables {a n = a n} which are {commutative/free/boolean/monotone} independent: [( 1 lim φ N N N n=1 a n ) m ] = + x m µ(dx), m = 1, 2, Axiomatization: Ben Ghorbal Schürmann (2002), Muraki (2002), Franz (2003) Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
19 25 Monotone Independence Definition (monotone independence) Let (A, φ) be an algebraic probability space and {A n } a family of -subalgebras We say that {A n} is monotone independent if for a 1 A n1,, a m A nm we have φ(a 1 a m ) = φ(a i )φ(a 1 ǎ i a m ) (ǎ i stands for omission) holds when n i 1 < n i and n i > n i+1 happen for i {1, 2,, n} Computing φ(a 1a 2a 3 a m) where a 1 A 2, a 2 A 1, a 3 A 4, φ( ) = φ(4)φ(4)φ(66)φ( ) = φ(4)φ(4)φ(66)φ(44)φ(213335) = = φ(4)φ(4)φ(66)φ(44)φ(2)φ(5)φ(333)φ(1) Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
20 Monotone Central Limit Theorem (Muraki 2001) Let (A, φ) be an algebraic probability space and let {a n } n=1 be a sequence of algebraic random variables satisfying the following conditions: (i) a n are real, ie, a n = a n; (ii) a n are normalized, ie, φ(a n ) = 0, φ(a 2 n) = 1; (iii) a n have uniformly bounded mixed moments, ie, for each m 1 there exists C m 0 such that φ(a n1 a nm ) C m for any choice of n 1,, n m (iv) {a n} are monotone independent Then, lim φ N ({ 1 N N i=1 a i } m ) = 1 π x m dx, m = 1, 2, 2 x 2 The probability measure in the right hand side is the normalized arcsine law Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
21 Monotone Central Limit Theorem (Muraki 2001) Let (A, φ) be an algebraic probability space and let {a n } n=1 be a sequence of algebraic random variables satisfying the following conditions: (i) a n are real, ie, a n = a n; (ii) a n are normalized, ie, φ(a n ) = 0, φ(a 2 n) = 1; (iii) a n have uniformly bounded mixed moments, ie, for each m 1 there exists C m 0 such that φ(a n1 a nm ) C m for any choice of n 1,, n m (iv) {a n} are monotone independent Then, lim φ N ({ 1 N N i=1 a i } m ) = 1 π x m dx, m = 1, 2, 2 x 2 The probability measure in the right hand side is the normalized arcsine law Proof is to show { lim φ 1 N N N i=1 } 2m a i = (2m)! 2 m m!m! = π 2 x m 2 x 2 dx Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
22 Arcsine Law as a Central Limit Measure for Monotone Independence Arcsine law vs normal (Gaussian) law 1 π 1 e x2 /2 2 x 2 2π Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
23 3 Quantum Probabilistic Approach to Spectral Graph Theory A Hora and N Obata: Quantum Probability and Spectral Analysis of Graphs, Springer, 2007 Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
24 31 Quantum Probabilistic Approach We deal with the adjacency algebra A(G) as an algebraic probability space equipped with a state, and A as a real random variable Main Problem (I) Given a graph G = (V, E) and a state on A(G), find a probability measure µ on R satisfying A m = + x m µ(dx), m = 1, 2, µ is called the spectral distribution of A in the state Main Problem (II) Given a growing graph G (ν) = (V (ν), E (ν) ) and a state ν on A(G (ν) ), find a probability measure µ on R satisfying (A (ν) ) m ν + x m µ(dx), m = 1, 2, µ is called the asymptotic spectral distribution of G (ν) in the state ν Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
25 32 States on A(G) Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
26 32 States on A(G) (I) Trace For a finite graph G we set a tr = 1 1 Tr (a) = V V δ x, aδ x, a A(G) x V Then (A(G), tr) becomes an algebraic probability space The spectral distribution µ of A, determined (uniquely) by µ = 1 V A m tr = + x m µ(dx), m = 1, 2,, coincides with the eigenvalue distribution of A: ( m i δ λi, Spec (G) = Spec (A) = i λ i m i ) Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
27 (II) Vacuum State The vacuum state at o V is the vector state defined by a o = δ o, aδ o, a A(G) For the adjacency matrix A we have A m o = δ o, A m δ o = {m-step walks from o to o} = (III) Deformed Vacuum State The Q-matrix of G is defined by Q = Q q = [q (x,y) ] x,y V 1 q 1 Then the deformed vacuum state is defined by + x m µ(dx) a q = Qδ o, aδ o, a A(G) 1 q gives rise to a one-parameter deformation of vacuum states 2 In general, q is not necessarily positive (ie, not a state), but one may hope it is positive for q close to 0 3 (Open question) To detarmine the range of q for which Q q is positive definite Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
28 4 Graph Products and Concepts of Independence Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
29 41 Independence and Graph Structures (I) Cartesian product Definition Let G 1 = (V 1, E 1) and G 2 = (V 2, E 2) be two graphs For (x, y), (x, y ) V 1 V 2 we write (x, y) (x, y ) if one of the following conditions is satisfied: (i) x = x and y y ; (ii) x x and y = y Then V 1 V 2 becomes a graph in such a way that (x, y), (x, y ) V 1 V 2 are adjacent if (x, y) (x, y ) This graph is called the Cartesian product or direct product of G 1 and G 2, and is denoted by G 1 G 2 Example (C 4 C 3 ) (1,3 (1, (1,1 (4,1 C C C C (2,1 (3,1 Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
30 Theorem Let G = G 1 G 2 be the cartesian product of two graphs G 1 and G 2 Then the adjacency matrix of G admits a decomposition: A = A 1 I 2 + I 1 A 2 as an operator acting on l 2 (V ) = l 2 (V 1 V 2 ) = l 2 (V 1 ) l 2 (V 2 ) Moreover, the right hand side is a sum of commutative independent random variables with respect to the vacuum state The asymptotic spectral distribution is the Gaussian distribution by applying the commutative central limit theorem Example (Hamming graphs) The Hamming graph is the Cartesian product of complete graphs: H(d, N) = K N K N A d,n = n {}}{{}}{ I I B I I i=1 i 1 (d-fold cartesian power of complete graphs) where B is the adjacency matrix of K N Hora (1998) obtained the limit distribution by a direct calculation of eigenvalues n i Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
31 42 Independence and Graph Structures (II) Comb product Definition Let G 1 = (V 1, E 1) and G 2 = (V 2, E 2) be two graphs We fix a vertix o 2 V 2 For (x, y), (x, y ) V 1 V 2 we write (x, y) (x, y ) if one of the following conditions is satisfied: (i) x = x and y y ; (ii) x x and y = y = o 2 Then V 1 V 2 becomes a graph, denoted by G 1 o2 G 2, and is called the comb product or the hierarchical product Example (C 4 C 3 ) (1,3 (1,2 (4, (1,1 C C C C (2,1 (3,1 Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
32 Theorem As an operator on C 0(V 1) C 0(V 2) the adjacency matrix of G 1 o2 G 2 is given by A = A 1 P 2 + I 1 A 2 where P 2 : C 0(V 2) C 0(V 2) is the projection onto the space spanned by δ o2 and I 1 is the identity matrix acting on C 0 (V 1 ) Theorem (Accardi Ben Ghobal O IDAQP(2004)) The adjacency matrix of the comb product G (1) o2 G (2) o3 on G (n) admits a decomposition of the form: A (1) A (2) A (n) = n {}}{{}}{ I (1) I (i 1) A (i) P (i+1) P (n), i=1 i 1 where P (i) the projection from l 2 (V (i) ) onto the one-dimensional subspace spanned by δ oi Moreover, the right-hand side is a sum of monotone independent random variables with respect to ψ δ o2 δ on, where ψ is an arbitrary state on B(l 2 (V (1) )) n i Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
33 43 Independence and Graph Structures (III) Star product Definition Let G 1 = (V 1, E 1) and G 2 = (V 2, E 2) be two graphs with distinguished vertices o 1 V 1 and o 2 V 2 Define a subset of V 1 V 2 by V 1 V 2 = {(x, o 2) ; x V 1} {(o 1, y) ; y V 2} The induced subgraph of G 1 G 2 spanned by V 1 V 2 is called the star product of G 1 and G 2 (with contact vertices o 1 and o 2), and is denoted by G 1 G 2 = G 1 o1 o2 G 2 Example (C 4 C 3 ) (1,3 (1,2 (4, (1,1 C C C C (2,1 (3,1 Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
34 Theorem (O IIS(2004)) As an operator on C 0 (V 1 ) C 0 (V 2 ) the adjacency matrix of G 1 G 2 is given by A = A (1) P (2) + P (1) A (2), P (i) = Φ (i) 0 Φ (i) 0 where P (i) : C 0 (V i ) C 0 (V i ) is the projection onto the space spanned by δ oi Theorem (O IIS(2004)) The adjacency matrix of the star product G (1) G (2) G (n) admits a decomposition of the form: A (1) A (2) A (n) = n {}}{{}}{ P (1) P (i 1) A (i) P (i+1) P (n), i=1 i 1 where P (i) the projection from l 2 (V (i) ) onto the one-dimensional subspace spanned by δ oi Moreover, the right-hand side is a sum of Boolean independent random variables with respect to δ o1 δ o2 δ on n i Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
35 Asymptotic spectral distribution of graph products G (n) = G#G# #G independence monotone Boolean commutative free CLM arcsine Bernoulli Gaussian Wigner graph product comb star direct free examples comb graph star graph integer lattice homogeneous tree Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
36 5 Method of Quantum Decomposition Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
37 51 A Simple Prototype: Coin-toss [ ] [ ] Recall that the coin-toss is modelled by A = and e 0 = A prototype of quantum decomposition [ ] [ ] A = A + + A = e 0, A m e 0 = e 0, (A + + A ) m e 0 = ϵ 1,,ϵ m {±} e 0, A ϵm A ϵ 1 e 0 = Relations among non-commutative quantum components A ± are useful e 1 e 0 G A + A m e 0, A m 1, if m is even, e 0 = 0, otherwise Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
38 52 Quantum Decomposition of the Adjacency Matrix Fix an origin o V of G = (V, E) V n+1 Φ n+1 V n Φ n V n-1 Φ n-1 Γ(G) V 1 V 0 Φ Φ 1 0 Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
39 52 Quantum Decomposition of the Adjacency Matrix Fix an origin o V of G = (V, E) Stratification (Distance Partition) V n+1 Φ n+1 V = n=0 V n V n = {x V ; (o, x) = n} V n V n-1 Φ Φ n n-1 Γ(G) V 1 Φ 1 V 0 Φ 0 Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
40 52 Quantum Decomposition of the Adjacency Matrix Fix an origin o V of G = (V, E) Stratification (Distance Partition) V n+1 Φ n+1 V = n=0 V n V n Φ n V n = {x V ; (o, x) = n} V n-1 Φ n-1 Γ(G) Associated Hilbert space Γ(G) l 2 (V ) Γ(G) = CΦ n n=0 Φ n = V n 1/2 x V n δ x V 1 V 0 Φ Φ 1 0 Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
41 52 Quantum Decomposition of the Adjacency Matrix (cont) (A + ) yx =1 y V n+1 (A ) =1 yx x y V n A = A + + A + A (A + ) = A, (A ) = A (A ) yx =1 y V n 1 Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
42 52 Quantum Decomposition of the Adjacency Matrix (cont) (A + ) yx =1 y V n+1 (A ) =1 yx x y V n A = A + + A + A (A + ) = A, (A ) = A (A ) yx =1 y V n 1 In general, Γ(G) = CΦ n is not invariant under the actions of A ϵ n=0 Cases so far studied in detail 1 Γ(G) is invariant under A ϵ distance-regular graphs 2 Γ(G) is asymptotically invariant under A ϵ Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
43 53 When Γ(G) is Invariant Under A ϵ For x V n we define ω ϵ (x) = {y V n+ϵ ; y x}, Then, Γ(G) is invariant under A ϵ if and only if ( ) ω ϵ(x) is constant on each V n Typical examples: distance-regular graphs (in this case the constant in ( ) is independent of the choice of o V ) eg, homogeneous trees, Hamming graphs, Johnson graphs, odd graphs, ϵ = +,, Vn+1 Vn Vn 1 { { { ω (x) ω (x) x ω (x) Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
44 53 When Γ(G) is Invariant Under A ϵ For x V n we define ω ϵ (x) = {y V n+ϵ ; y x}, Then, Γ(G) is invariant under A ϵ if and only if ( ) ω ϵ(x) is constant on each V n Typical examples: distance-regular graphs (in this case the constant in ( ) is independent of the choice of o V ) eg, homogeneous trees, Hamming graphs, Johnson graphs, odd graphs, ϵ = +,, Vn+1 Vn Vn 1 { x { Theorem If Γ(G) is invariant under A +, A, A, there exists a pair of sequences {α n } and {ω n} such that A + Φ n = ω n+1 Φ n+1, A Φ n = ω n Φ n 1, A Φ n = α n+1 Φ n In other words, Γ {ωn },{α n } = (Γ(G), {Φ n}, A +, A, A ) is an interacting Fock space associated with Jacobi parameters ({ω n }, {α n }) { ω (x) ω (x) ω (x) Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
45 54 Computing the Spectral Distribution 1 By the interacting Fock space structure (Γ(G), A +, A, A ): AΦ n = (A + + A + A )Φ n = ω n+1 Φ n+1 + α n+1 Φ n + ω n Φ n 1 2 Associated with a probability distribution µ on R, the orthogonal polynomials {P 0(x) = 1,, P n(x) = x n + } verify the three term recurrence relation: xp n = P n+1 + α n+1p n + ω np n 1, P 0 = 1, P 1 = x α 1, where ({ω n}, {α n}) is called the Jacobi parameters of µ Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
46 54 Computing the Spectral Distribution 1 By the interacting Fock space structure (Γ(G), A +, A, A ): AΦ n = (A + + A + A )Φ n = ω n+1 Φ n+1 + α n+1 Φ n + ω n Φ n 1 2 Associated with a probability distribution µ on R, the orthogonal polynomials {P 0(x) = 1,, P n(x) = x n + } verify the three term recurrence relation: xp n = P n+1 + α n+1p n + ω np n 1, P 0 = 1, P 1 = x α 1, where ({ω n}, {α n}) is called the Jacobi parameters of µ 3 An isometry U : Γ(G) L 2 (R, µ) is defined by Φ n P n 1 P n 4 Then UAU = x (multiplication operator) and Φ 0, A m Φ 0 = UΦ 0, UA m U UΦ 0 = P 0, x m P 0 µ = + x m µ(dx) Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
47 54 Computing the Spectral Distribution 1 By the interacting Fock space structure (Γ(G), A +, A, A ): AΦ n = (A + + A + A )Φ n = ω n+1 Φ n+1 + α n+1 Φ n + ω n Φ n 1 2 Associated with a probability distribution µ on R, the orthogonal polynomials {P 0(x) = 1,, P n(x) = x n + } verify the three term recurrence relation: xp n = P n+1 + α n+1p n + ω np n 1, P 0 = 1, P 1 = x α 1, where ({ω n}, {α n}) is called the Jacobi parameters of µ 3 An isometry U : Γ(G) L 2 (R, µ) is defined by Φ n P n 1 P n 4 Then UAU = x (multiplication operator) and Φ 0, A m Φ 0 = UΦ 0, UA m U UΦ 0 = P 0, x m P 0 µ = + x m µ(dx) Theorem (Graph structure = ({ω n }, {α n }) = spectral distribution) If Γ(G) is invariant under A +, A, A, the vacuum spectral distribution µ defined by Φ 0, A m Φ 0 = + x m µ(dx), m = 1, 2,, is a probability distribution on R that has the Jacobi parameters ({ω n }, {α n }) Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
48 55 How to know µ from the Jacobi Parameters ({ω n }, {α n }) We need to find a probability distribution µ for which the orthogonal polynomials satisfy xp n = P n+1 + α n+1p n + ω np n 1, P 0 = 1, P 1 = x α 1, Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
49 55 How to know µ from the Jacobi Parameters ({ω n }, {α n }) We need to find a probability distribution µ for which the orthogonal polynomials satisfy xp n = P n+1 + α n+1p n + ω np n 1, P 0 = 1, P 1 = x α 1, Cauchy Stieltjes transform G µ (z) = + µ(dx) z x = 1 z α 1 where the right-hand side is convergent in {Im z 0} if the moment problem is determinate, eg, if ω n = O((n log n) 2 ) (Carleman s test) ω 1 ω 2 ω 3 z α 2 z α 3 z α 4 1 = ω 1 z α 1 ω 2 z α 2 ω 3 z α 3 z α 4 Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
50 55 How to know µ from the Jacobi Parameters (cont) Cauchy Stieltjes transform G µ (z) = + µ(dx) z x = 1 z α 1 ω 1 ω 2 ω 3 z α 2 z α 3 z α 4 Stieltjes inversion formula The (right-continuous) distribution function F (x) = µ((, x]) and the absolutely continuous part of µ is given by 1 2 {F (t) + F (t 0)} 1 {F (s) + F (s 0)} 2 ρ(x) = 1 π = 1 π lim y +0 t lim Im G µ(x + iy) y +0 s Im G µ (x + iy)dx, s < t, Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
51 55 Illustration: Homogeneous tree T κ (κ 2) Stratification of T 4 Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
52 55 Illustration: Homogeneous tree T κ (κ 2) Stratification of T 4 (1) Quantum decomposition: A = A + + A A + Φ 0 = κ Φ 1, A + Φ n = κ 1 Φ n+1 (n 1) A Φ 0 = 0, A Φ 1 = κ Φ 0, A Φ n = κ 1 Φ n 1 (n 2) Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
53 55 Illustration: Homogeneous tree T κ (κ 2) Stratification of T 4 (1) Quantum decomposition: A = A + + A A + Φ 0 = κ Φ 1, A + Φ n = κ 1 Φ n+1 (n 1) A Φ 0 = 0, A Φ 1 = κ Φ 0, A Φ n = κ 1 Φ n 1 (n 2) (2) Jacobi parameters: {ω 1 = κ, ω 2 = ω 3 = = κ 1}, {α n 0} Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
54 (3) Cauchy Stieltjes transform: (ω 1 = κ, ω 2 = ω 3 = = κ 1) + µ(dx) z x = G µ(z) = 1 ω 1 ω 2 ω 3 ω 4 ω 5 z z z z z z = (κ 2)z κ z 2 4(κ 1) 2(κ 2 z 2 ) Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
55 (3) Cauchy Stieltjes transform: (ω 1 = κ, ω 2 = ω 3 = = κ 1) + µ(dx) z x = G µ(z) = 1 ω 1 ω 2 ω 3 ω 4 ω 5 z z z z z z = (κ 2)z κ z 2 4(κ 1) 2(κ 2 z 2 ) (4) Spectral distribution: µ(dx) = ρ κ(x)dx ρ κ(x) = x 2 κ 1 κ 4(κ 1) x 2 2π κ 2 x 2 Kesten Measures (1959) ρ 4, ρ 8, ρ 12 Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
56 6 Method of Quantum Decomposition for Growing Graphs G G G Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
57 61 Growing Regular Graphs G (ν) = (V (ν), A (ν) ) Here Γ(G (ν) ) is not necessarily invariant but asymptotically invariant under A ϵ ν Statistics of ω ϵ (x) M(ω ϵ V n ) = 1 V n Σ 2 (ω ϵ V n) = 1 V n x V n ω ϵ (x) x V n { ωϵ(x) M(ω ϵ V n) } 2 Vn+1 Vn { ω (x) ω (x) x { L(ω ϵ V n) = max{ ω ϵ(x) ; x V n} Vn 1 { ω (x) Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
58 61 Growing Regular Graphs G (ν) = (V (ν), A (ν) ) Here Γ(G (ν) ) is not necessarily invariant but asymptotically invariant under A ϵ ν Statistics of ω ϵ (x) M(ω ϵ V n ) = 1 V n Σ 2 (ω ϵ V n) = 1 V n x V n ω ϵ (x) x V n { ωϵ(x) M(ω ϵ V n) } 2 Vn+1 Vn { ω (x) ω (x) x { L(ω ϵ V n) = max{ ω ϵ(x) ; x V n} Conditions for a growing regular graph G (ν) = (V (ν), E (ν) ) (A1) lim ν deg(g (ν) ) = (A2) for each n = 1, 2,, lim ν Vn 1 M(ω V (ν) n ) = ω n <, lim Σ 2 (ω V (ν) ν n ) = 0, sup L(ω V (ν) n ) < ν (A3) for each n = 0, 1, 2,, lim ν M(ω V (ν) n ) Σ 2 (ω V (ν) n = α n+1 <, lim ) κ(ν) ν κ(ν) = 0, sup ν { ω (x) L(ω V (ν) n ) κ(ν) < Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
59 Theorem (QCLT in a general form [Hora-Obata: TAMS (2008)]) Let {G (ν) = (V (ν), E (ν) )} be a growing regular graph satisfying (A1) lim ν κ(ν) =, where κ(ν) = deg(g (ν) ) (A2) for each n = 1, 2,, lim ν M(ω V (ν) n ) = ω n <, lim Σ 2 (ω V (ν) ν n ) = 0, sup L(ω V (ν) n ) < ν (A3) for each n = 0, 1, 2,, lim ν M(ω V (ν) n ) Σ 2 (ω V (ν) n = α n+1 <, lim ) κ(ν) ν κ(ν) = 0, sup ν L(ω V (ν) n ) κ(ν) < Then the asymptotic spectral distribution of the normalized A ν in the vacuum state is a probability distribution µ determined by ({ω n }, {α n }): lim ν ( Aν κ(ν) ) m = + x m µ(dx), m = 1, 2, Proof is to show that lim ν A ϵ ν κ(ν) = B ϵ (stochastically) where (Γ, {Ψ n }, B +, B, B ) is the interacting Fock space associated with the Jacobi parameters ({ω n}, {α n}) Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
60 Outline of Proof (1) A ϵ Φ n = γn+ϵ ϵ Φ n+ϵ + Sn+ϵ ϵ, ϵ {+,, }, n = 0, 1, 2, κ γ + n = M(ω V n) ( Vn κ V n 1 ) 1/2 (, γ n = M(ω Vn + V n) κ V n+1 ) 1/2, γ n = M(ω V n ) κ { n 1 (2) V n = M(ω V k )} κ n + O(κ n 1 ) k=1 (3) lim γ + ν n = ω n, lim γ ν n = ω n+1, lim γ ν n = α n+1 (4) A ϵm κ Aϵ 1 κ Φ n = γ ϵ 1 n+ϵ 1 γ ϵ 2 n+ϵ 1 +ϵ 2 γ ϵ m n+ϵ1 + +ϵ m Φ n+ϵ1 + +ϵ m + m k=1 γ ϵ 1 n+ϵ 1 γ ϵ k 1 n+ϵ 1 + +ϵ k 1 } {{ } (k 1) times A ϵm κ Aϵ k+1 κ } {{ } (m k) times (5) Estimate the error terms and show that lim Φ (ν) A ϵ m ν j, Aϵ k+1 S ϵ k n+ϵ1 + +ϵ = 0 κ(ν) κ(ν) k S ϵ k n+ϵ1 + +ϵ k Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
61 62 Illustration: Z N as N Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
62 62 Illustration: Z N as N 1 Asymptotic invariance of Γ(Z N ) under A ϵ : 2 Normalized adjacency matrices: A + Φ n = 2N n + 1 Φ n+1 + O(1), A Φ n = 2N n Φ n 1 + O(N 1/2 ) A ϵ κ(n) = Aϵ 2N 3 The interacting Fock space in the limit as N is the Boson Fock space: B + Ψ n = n + 1 Ψ n+1, B Φ n = n Ψ n 1, B = 0 4 The asymptotic spectral distribution is the standard Gaussian distribution: ( ) m AN lim Φ 0, Φ 0 = Ψ 0, (B + + B ) m Ψ 0 N 2N = 1 + x m e x2 /2 dx 2π Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
63 63 Some Results: Asymptotic Spectral Distributions graphs IFS vacuum state deformed vacuum state Hamming graphs ω n = n Gaussian (N/d 0) Gaussian H(d, N) (Boson) Poisson (N/d λ 1 > 0) or Poisson Johnson graphs ω n = n 2 exponential (2d/v 1) Poissonization of J(v, d) geometric (2d/v p (0, 1)) exponential distribution odd graphs ω 2n 1 = n two-sided Rayleigh? O k ω 2n = n homogeneous ω n = 1 Wigner semicircle free Poisson trees T κ (free) integer lattices ω n = n Gaussian Gaussian Z N (Boson) symmetric groups ω n = n Gaussian Gaussian S n (Coxeter) (Boson) Coxeter groups ω n = 1 Wigner semicircle free Poisson (Fendler) (free) Spidernets ω 1 = 1 free Meixner law? S(a, b, c) ω 2 = = r Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
64 Quantum Probabilistic Approach to Spectral Analysis of Graphs adjacency matrix A ν combinatorics linear algebra spectral distribution µ ν Classical scaling limit quantum decomposition A ν Aν A ν A ν A ν quantum CLT ε A ν ε B ν Z ν use of independence X X ν Quantum B quantum CLT B α asymptotic spectral distribution µ interacting Fock space Γ ( α n ) B B orthogonal polynomials P n ω n α n Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
65 Summary 1 Quantum probability is an extension of classical probability based on non-comutative algebras 1) algebraic probability space (A, φ) and random variables a A 2) various concepts of independence 3) and associated quantum central limit theorems (QCLTs) 2 Quantum probabilistic techniques are useful for spectral analysis of graphs 1) quantum decomposition and use of one-mode interacting Fock spaces 2) concepts of independence and product structures 3) asymptotic spectral distribution as a result of QCLT 3 Some future directions 1) more on product structure of graphs and independence 2) extending the method of quantum decomposition beyond one-mode interacting Fock spaces (orthogonal polynomials in one variable) 3) digraphs (directed graphs) 4) applications to dynamics on graphs, eg, coupled oscillators, random walks (or more generally Markov chains), quantum walks, etc Quantum Probability and Asymptotic Spectral Analysis of GrowingRoma, Graphs November 14, / 47
Asymptotic Spectral Analysis of Growing Graphs
Asymptotic Spectral Analysis of Growing Graphs Nobuaki Obata Graduate School of Information Sciences Tohoku University www.math.is.tohoku.ac.jp/ obata SJTU, Shanghai, China, 2018.11.15 18 Nobuaki Obata
More informationQuantum Probability and Applications to Complex Networks
typed 2008/6/16/10:7 Quantum Probability and Applications to Complex Networks Nobuaki Obata Graduate School of Information Sciences Tohoku University April June 2008 Mathematical Institute Wroc law University
More informationA simple proof for monotone CLT
A simple proof for monotone CLT Hayato Saigo Graduate School of Science, Kyoto University, Kyoto 606-8502, Japan arxiv:0912.3728v1 [math.pr] 18 Dec 2009 Abstract In the case of monotone independence, the
More informationFree Probability Theory and Random Matrices. Roland Speicher Queen s University Kingston, Canada
Free Probability Theory and Random Matrices Roland Speicher Queen s University Kingston, Canada We are interested in the limiting eigenvalue distribution of N N random matrices for N. Usually, large N
More informationFree Probability Theory and Non-crossing Partitions. Roland Speicher Queen s University Kingston, Canada
Free Probability Theory and Non-crossing Partitions Roland Speicher Queen s University Kingston, Canada Freeness Definition [Voiculescu 1985]: Let (A, ϕ) be a non-commutative probability space, i.e. A
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
More informationThe Free Central Limit Theorem: A Combinatorial Approach
The Free Central Limit Theorem: A Combinatorial Approach by Dennis Stauffer A project submitted to the Department of Mathematical Sciences in conformity with the requirements for Math 4301 (Honour s Seminar)
More informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
More information1 Tridiagonal matrices
Lecture Notes: β-ensembles Bálint Virág Notes with Diane Holcomb 1 Tridiagonal matrices Definition 1. Suppose you have a symmetric matrix A, we can define its spectral measure (at the first coordinate
More informationChapter 2: Random Variables
ECE54: Stochastic Signals and Systems Fall 28 Lecture 2 - September 3, 28 Dr. Salim El Rouayheb Scribe: Peiwen Tian, Lu Liu, Ghadir Ayache Chapter 2: Random Variables Example. Tossing a fair coin twice:
More information1 Math 241A-B Homework Problem List for F2015 and W2016
1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More informationFrom random matrices to free groups, through non-crossing partitions. Michael Anshelevich
From random matrices to free groups, through non-crossing partitions Michael Anshelevich March 4, 22 RANDOM MATRICES For each N, A (N), B (N) = independent N N symmetric Gaussian random matrices, i.e.
More informationIntroduction to Association Schemes
Introduction to Association Schemes Akihiro Munemasa Tohoku University June 5 6, 24 Algebraic Combinatorics Summer School, Sendai Assumed results (i) Vandermonde determinant: a a m =. a m a m m i
More informationThe Hierarchical Product of Graphs
The Hierarchical Product of Graphs Lali Barrière Francesc Comellas Cristina Dalfó Miquel Àngel Fiol Universitat Politècnica de Catalunya - DMA4 April 8, 2008 Outline 1 Introduction 2 Graphs and matrices
More informationLecture 22: Variance and Covariance
EE5110 : Probability Foundations for Electrical Engineers July-November 2015 Lecture 22: Variance and Covariance Lecturer: Dr. Krishna Jagannathan Scribes: R.Ravi Kiran In this lecture we will introduce
More informationIII. Quantum ergodicity on graphs, perspectives
III. Quantum ergodicity on graphs, perspectives Nalini Anantharaman Université de Strasbourg 24 août 2016 Yesterday we focussed on the case of large regular (discrete) graphs. Let G = (V, E) be a (q +
More informationHilbert Spaces. Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space.
Hilbert Spaces Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space. Vector Space. Vector space, ν, over the field of complex numbers,
More informationThe Hierarchical Product of Graphs
The Hierarchical Product of Graphs Lali Barrière Francesc Comellas Cristina Dalfó Miquel Àngel Fiol Universitat Politècnica de Catalunya - DMA4 March 22, 2007 Outline 1 Introduction 2 The hierarchical
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationhere, this space is in fact infinite-dimensional, so t σ ess. Exercise Let T B(H) be a self-adjoint operator on an infinitedimensional
15. Perturbations by compact operators In this chapter, we study the stability (or lack thereof) of various spectral properties under small perturbations. Here s the type of situation we have in mind:
More informationOn the Relation of the Square of White Noise and the Finite Difference Algebra
On the Relation of the Square of White Noise and the Finite Difference Algebra Luigi Accardi Centro Vito Volterra Università degli Studi di Roma Tor Vergata Via di Tor Vergata, s.n.c. 00133 Roma, Italia
More information1: PROBABILITY REVIEW
1: PROBABILITY REVIEW Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) Slides 1: Probability Review 1 / 56 Outline We will review the following
More informationThe Cartan Decomposition of a Complex Semisimple Lie Algebra
The Cartan Decomposition of a Complex Semisimple Lie Algebra Shawn Baland University of Colorado, Boulder November 29, 2007 Definition Let k be a field. A k-algebra is a k-vector space A equipped with
More informationExponential tail inequalities for eigenvalues of random matrices
Exponential tail inequalities for eigenvalues of random matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify
More informationMeasures, orthogonal polynomials, and continued fractions. Michael Anshelevich
Measures, orthogonal polynomials, and continued fractions Michael Anshelevich November 7, 2008 MEASURES AND ORTHOGONAL POLYNOMIALS. µ a positive measure on R. A linear functional µ[p ] = P (x) dµ(x), µ
More informationStabilization of Heat Equation
Stabilization of Heat Equation Mythily Ramaswamy TIFR Centre for Applicable Mathematics, Bangalore, India CIMPA Pre-School, I.I.T Bombay 22 June - July 4, 215 Mythily Ramaswamy Stabilization of Heat Equation
More informationLimit Laws for Random Matrices from Traffic Probability
Limit Laws for Random Matrices from Traffic Probability arxiv:1601.02188 Slides available at math.berkeley.edu/ bensonau Benson Au UC Berkeley May 9th, 2016 Benson Au (UC Berkeley) Random Matrices from
More informationKernel families of probability measures. Saskatoon, October 21, 2011
Kernel families of probability measures Saskatoon, October 21, 2011 Abstract The talk will compare two families of probability measures: exponential, and Cauchy-Stjelties families. The exponential families
More informationvon Neumann algebras, II 1 factors, and their subfactors V.S. Sunder (IMSc, Chennai)
von Neumann algebras, II 1 factors, and their subfactors V.S. Sunder (IMSc, Chennai) Lecture 3 at IIT Mumbai, April 24th, 2007 Finite-dimensional C -algebras: Recall: Definition: A linear functional tr
More informationLINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM
LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator
More informationMeasures, orthogonal polynomials, and continued fractions. Michael Anshelevich
Measures, orthogonal polynomials, and continued fractions Michael Anshelevich November 7, 2008 MEASURES AND ORTHOGONAL POLYNOMIALS. MEASURES AND ORTHOGONAL POLYNOMIALS. µ a positive measure on R. 2 MEASURES
More informationRecitation 2: Probability
Recitation 2: Probability Colin White, Kenny Marino January 23, 2018 Outline Facts about sets Definitions and facts about probability Random Variables and Joint Distributions Characteristics of distributions
More informationFree coherent states and distributions on p-adic numbers
Free coherent states and distributions on p-adic numbers S.V.Kozyrev June 9, 0 arxiv:q-alg/970305v 5 Mar 997 Abstract Free coherent states for a system with two degrees of freedom is defined. A linear
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. Research Awards Screening Test. February 25, Time Allowed: 90 Minutes Maximum Marks: 40
NATIONAL BOARD FOR HIGHER MATHEMATICS Research Awards Screening Test February 25, 2006 Time Allowed: 90 Minutes Maximum Marks: 40 Please read, carefully, the instructions on the following page before you
More informationMath 123 Homework Assignment #2 Due Monday, April 21, 2008
Math 123 Homework Assignment #2 Due Monday, April 21, 2008 Part I: 1. Suppose that A is a C -algebra. (a) Suppose that e A satisfies xe = x for all x A. Show that e = e and that e = 1. Conclude that e
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationELEMENTS OF PROBABILITY THEORY
ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable
More informationTridiagonal pairs in algebraic graph theory
University of Wisconsin-Madison Contents Part I: The subconstituent algebra of a graph The adjacency algebra The dual adjacency algebra The subconstituent algebra The notion of a dual adjacency matrix
More informationCombinatorial semigroups and induced/deduced operators
Combinatorial semigroups and induced/deduced operators G. Stacey Staples Department of Mathematics and Statistics Southern Illinois University Edwardsville Modified Hypercubes Particular groups & semigroups
More informationPart IA Probability. Definitions. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Definitions Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More informationTheoretical and Mathematical Physics
Theoretical and Mathematical Physics The series founded in 1975 and formerly (until 2005) entitled Texts and Monographs in Physics (TMP) publishes high-level monographs in theoretical and mathematical
More informationQuantum Stochastic Maps and Frobenius Perron Theorem
Quantum Stochastic Maps and Frobenius Perron Theorem Karol Życzkowski in collaboration with W. Bruzda, V. Cappellini, H.-J. Sommers, M. Smaczyński Institute of Physics, Jagiellonian University, Cracow,
More informationCharacterizations of free Meixner distributions
Characterizations of free Meixner distributions Texas A&M University March 26, 2010 Jacobi parameters. Matrix. β 0 γ 0 0 0... 1 β 1 γ 1 0.. m n J =. 0 1 β 2 γ.. 2 ; J n =. 0 0 1 β.. 3............... A
More information1 Presessional Probability
1 Presessional Probability Probability theory is essential for the development of mathematical models in finance, because of the randomness nature of price fluctuations in the markets. This presessional
More informationQualifying Exams I, 2014 Spring
Qualifying Exams I, 2014 Spring 1. (Algebra) Let k = F q be a finite field with q elements. Count the number of monic irreducible polynomials of degree 12 over k. 2. (Algebraic Geometry) (a) Show that
More informationQuantum algorithms. Andrew Childs. Institute for Quantum Computing University of Waterloo
Quantum algorithms Andrew Childs Institute for Quantum Computing University of Waterloo 11th Canadian Summer School on Quantum Information 8 9 June 2011 Based in part on slides prepared with Pawel Wocjan
More informationCourse Notes. Part IV. Probabilistic Combinatorics. Algorithms
Course Notes Part IV Probabilistic Combinatorics and Algorithms J. A. Verstraete Department of Mathematics University of California San Diego 9500 Gilman Drive La Jolla California 92037-0112 jacques@ucsd.edu
More informationQuantum Chaos and Nonunitary Dynamics
Quantum Chaos and Nonunitary Dynamics Karol Życzkowski in collaboration with W. Bruzda, V. Cappellini, H.-J. Sommers, M. Smaczyński Phys. Lett. A 373, 320 (2009) Institute of Physics, Jagiellonian University,
More informationCOMPUTING MOMENTS OF FREE ADDITIVE CONVOLUTION OF MEASURES
COMPUTING MOMENTS OF FREE ADDITIVE CONVOLUTION OF MEASURES W LODZIMIERZ BRYC Abstract. This short note explains how to use ready-to-use components of symbolic software to convert between the free cumulants
More information1. Stochastic Processes and filtrations
1. Stochastic Processes and 1. Stoch. pr., A stochastic process (X t ) t T is a collection of random variables on (Ω, F) with values in a measurable space (S, S), i.e., for all t, In our case X t : Ω S
More informationBulletin T.CXXII de l Académie Serbe des Sciences et des Arts Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 26
Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts - 001 Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 6 SOME SPECTRAL PROPERTIES OF STARLIKE TREES M. LEPOVIĆ, I.
More informationDifferent quantum f-divergences and the reversibility of quantum operations
Different quantum f-divergences and the reversibility of quantum operations Fumio Hiai Tohoku University 2016, September (at Budapest) Joint work with Milán Mosonyi 1 1 F.H. and M. Mosonyi, Different quantum
More information08a. Operators on Hilbert spaces. 1. Boundedness, continuity, operator norms
(February 24, 2017) 08a. Operators on Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2016-17/08a-ops
More informationVertex subsets with minimal width and dual width
Vertex subsets with minimal width and dual width in Q-polynomial distance-regular graphs University of Wisconsin & Tohoku University February 2, 2011 Every face (or facet) of a hypercube is a hypercube...
More informationSpectral Properties of the Hata Tree
Spectral Properties of the Hata Tree Antoni Brzoska University of Connecticut March 20, 2016 Antoni Brzoska Spectral Properties of the Hata Tree March 20, 2016 1 / 26 Table of Contents 1 A Dynamical System
More informationCauchy-Stieltjes kernel families
Cauchy-Stieltjes kernel families Wlodek Bryc Fields Institute, July 23, 2013 NEF versus CSK families The talk will switch between two examples of kernel families K(µ) = {P θ (dx) : θ Θ} NEF versus CSK
More informationRadial eigenvectors of the Laplacian of the nonbinary hypercube
Radial eigenvectors of the Laplacian of the nonbinary hypercube Murali K. Srinivasan Department of Mathematics Indian Institute of Technology, Bombay Powai, Mumbai 400076, INDIA mks@math.iitb.ac.in murali.k.srinivasan@gmail.com
More informationOn the concentration of eigenvalues of random symmetric matrices
On the concentration of eigenvalues of random symmetric matrices Noga Alon Michael Krivelevich Van H. Vu April 23, 2012 Abstract It is shown that for every 1 s n, the probability that the s-th largest
More information. Find E(V ) and var(v ).
Math 6382/6383: Probability Models and Mathematical Statistics Sample Preliminary Exam Questions 1. A person tosses a fair coin until she obtains 2 heads in a row. She then tosses a fair die the same number
More informationA Glimpse of Quantum Computation
A Glimpse of Quantum Computation Zhengfeng Ji (UTS:QSI) QCSS 2018, UTS 1. 1 Introduction What is quantum computation? Where does the power come from? Superposition Incompatible states can coexist Transformation
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationMeixner matrix ensembles
Meixner matrix ensembles W lodek Bryc 1 Cincinnati April 12, 2011 1 Based on joint work with Gerard Letac W lodek Bryc (Cincinnati) Meixner matrix ensembles April 12, 2011 1 / 29 Outline of talk Random
More informationQuantum walk algorithms
Quantum walk algorithms Andrew Childs Institute for Quantum Computing University of Waterloo 28 September 2011 Randomized algorithms Randomness is an important tool in computer science Black-box problems
More informationThe spectra of super line multigraphs
The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology
More informationseries. Utilize the methods of calculus to solve applied problems that require computational or algebraic techniques..
1 Use computational techniques and algebraic skills essential for success in an academic, personal, or workplace setting. (Computational and Algebraic Skills) MAT 203 MAT 204 MAT 205 MAT 206 Calculus I
More informationThe Hilbert Space of Random Variables
The Hilbert Space of Random Variables Electrical Engineering 126 (UC Berkeley) Spring 2018 1 Outline Fix a probability space and consider the set H := {X : X is a real-valued random variable with E[X 2
More informationEigenvalues, random walks and Ramanujan graphs
Eigenvalues, random walks and Ramanujan graphs David Ellis 1 The Expander Mixing lemma We have seen that a bounded-degree graph is a good edge-expander if and only if if has large spectral gap If G = (V,
More information5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing.
5 Measure theory II 1. Charges (signed measures). Let (Ω, A) be a σ -algebra. A map φ: A R is called a charge, (or signed measure or σ -additive set function) if φ = φ(a j ) (5.1) A j for any disjoint
More informationIntroduction to orthogonal polynomials. Michael Anshelevich
Introduction to orthogonal polynomials Michael Anshelevich November 6, 2003 µ = probability measure on R with finite moments m n (µ) = R xn dµ(x)
More informationLectures 2 3 : Wigner s semicircle law
Fall 009 MATH 833 Random Matrices B. Való Lectures 3 : Wigner s semicircle law Notes prepared by: M. Koyama As we set up last wee, let M n = [X ij ] n i,j= be a symmetric n n matrix with Random entries
More informationDEFINABLE OPERATORS ON HILBERT SPACES
DEFINABLE OPERATORS ON HILBERT SPACES ISAAC GOLDBRING Abstract. Let H be an infinite-dimensional (real or complex) Hilbert space, viewed as a metric structure in its natural signature. We characterize
More information18.175: Lecture 14 Infinite divisibility and so forth
18.175 Lecture 14 18.175: Lecture 14 Infinite divisibility and so forth Scott Sheffield MIT 18.175 Lecture 14 Outline Infinite divisibility Higher dimensional CFs and CLTs Random walks Stopping times Arcsin
More informationThe Terwilliger algebra of a Q-polynomial distance-regular graph with respect to a set of vertices
The Terwilliger algebra of a Q-polynomial distance-regular graph with respect to a set of vertices Hajime Tanaka (joint work with Rie Tanaka and Yuta Watanabe) Research Center for Pure and Applied Mathematics
More information1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N
Applied Analysis prelim July 15, 216, with solutions Solve 4 of the problems 1-5 and 2 of the problems 6-8. We will only grade the first 4 problems attempted from1-5 and the first 2 attempted from problems
More informationGlobal Maxwellians over All Space and Their Relation to Conserved Quantites of Classical Kinetic Equations
Global Maxwellians over All Space and Their Relation to Conserved Quantites of Classical Kinetic Equations C. David Levermore Department of Mathematics and Institute for Physical Science and Technology
More informationVectors and Matrices Statistics with Vectors and Matrices
Vectors and Matrices Statistics with Vectors and Matrices Lecture 3 September 7, 005 Analysis Lecture #3-9/7/005 Slide 1 of 55 Today s Lecture Vectors and Matrices (Supplement A - augmented with SAS proc
More informationOperator-Valued Free Probability Theory and Block Random Matrices. Roland Speicher Queen s University Kingston
Operator-Valued Free Probability Theory and Block Random Matrices Roland Speicher Queen s University Kingston I. Operator-valued semicircular elements and block random matrices II. General operator-valued
More informationCOUNTEREXAMPLES TO THE COARSE BAUM-CONNES CONJECTURE. Nigel Higson. Unpublished Note, 1999
COUNTEREXAMPLES TO THE COARSE BAUM-CONNES CONJECTURE Nigel Higson Unpublished Note, 1999 1. Introduction Let X be a discrete, bounded geometry metric space. 1 Associated to X is a C -algebra C (X) which
More informationMath Exam 2, October 14, 2008
Math 96 - Exam 2, October 4, 28 Name: Problem (5 points Find all solutions to the following system of linear equations, check your work: x + x 2 x 3 2x 2 2x 3 2 x x 2 + x 3 2 Solution Let s perform Gaussian
More informationCompression, Matrix Range and Completely Positive Map
Compression, Matrix Range and Completely Positive Map Iowa State University Iowa-Nebraska Functional Analysis Seminar November 5, 2016 Definitions and notations H, K : Hilbert space. If dim H = n
More informationPCMI LECTURE NOTES ON PROPERTY (T ), EXPANDER GRAPHS AND APPROXIMATE GROUPS (PRELIMINARY VERSION)
PCMI LECTURE NOTES ON PROPERTY (T ), EXPANDER GRAPHS AND APPROXIMATE GROUPS (PRELIMINARY VERSION) EMMANUEL BREUILLARD 1. Lecture 1, Spectral gaps for infinite groups and non-amenability The final aim of
More informationChapter 1 Statistical Reasoning Why statistics? Section 1.1 Basics of Probability Theory
Chapter 1 Statistical Reasoning Why statistics? Uncertainty of nature (weather, earth movement, etc. ) Uncertainty in observation/sampling/measurement Variability of human operation/error imperfection
More informationThe expansion of random regular graphs
The expansion of random regular graphs David Ellis Introduction Our aim is now to show that for any d 3, almost all d-regular graphs on {1, 2,..., n} have edge-expansion ratio at least c d d (if nd is
More informationProbability & Computing
Probability & Computing Stochastic Process time t {X t t 2 T } state space Ω X t 2 state x 2 discrete time: T is countable T = {0,, 2,...} discrete space: Ω is finite or countably infinite X 0,X,X 2,...
More informationarxiv:math/ v1 [math.qa] 3 Jun 2002
What is Stochastic Independence? arxiv:math/0206017v1 [math.qa] 3 Jun 2002 Uwe Franz Institut für Mathematik und Informatik Ernst-Moritz-Arndt-Universität Greifswald Friedrich-Ludwig-Jahn-Str. 15 a D-17487
More information18.440: Lecture 19 Normal random variables
18.440 Lecture 19 18.440: Lecture 19 Normal random variables Scott Sheffield MIT Outline Tossing coins Normal random variables Special case of central limit theorem Outline Tossing coins Normal random
More information18.175: Lecture 3 Integration
18.175: Lecture 3 Scott Sheffield MIT Outline Outline Recall definitions Probability space is triple (Ω, F, P) where Ω is sample space, F is set of events (the σ-algebra) and P : F [0, 1] is the probability
More informationLecture 11. Probability Theory: an Overveiw
Math 408 - Mathematical Statistics Lecture 11. Probability Theory: an Overveiw February 11, 2013 Konstantin Zuev (USC) Math 408, Lecture 11 February 11, 2013 1 / 24 The starting point in developing the
More informationAsymptotics for posterior hazards
Asymptotics for posterior hazards Pierpaolo De Blasi University of Turin 10th August 2007, BNR Workshop, Isaac Newton Intitute, Cambridge, UK Joint work with Giovanni Peccati (Université Paris VI) and
More informationMIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:???
MIT 6.972 Algebraic techniques and semidefinite optimization May 9, 2006 Lecture 2 Lecturer: Pablo A. Parrilo Scribe:??? In this lecture we study techniques to exploit the symmetry that can be present
More information1 Probability Spaces and Random Variables
1 Probability Saces and Random Variables 1.1 Probability saces Ω: samle sace consisting of elementary events (or samle oints). F : the set of events P: robability 1.2 Kolmogorov s axioms Definition 1.2.1
More informationApplications and fundamental results on random Vandermon
Applications and fundamental results on random Vandermonde matrices May 2008 Some important concepts from classical probability Random variables are functions (i.e. they commute w.r.t. multiplication)
More informationA note on the σ-algebra of cylinder sets and all that
A note on the σ-algebra of cylinder sets and all that José Luis Silva CCM, Univ. da Madeira, P-9000 Funchal Madeira BiBoS, Univ. of Bielefeld, Germany (luis@dragoeiro.uma.pt) September 1999 Abstract In
More informationI. ANALYSIS; PROBABILITY
ma414l1.tex Lecture 1. 12.1.2012 I. NLYSIS; PROBBILITY 1. Lebesgue Measure and Integral We recall Lebesgue measure (M411 Probability and Measure) λ: defined on intervals (a, b] by λ((a, b]) := b a (so
More informationFREE PROBABILITY THEORY AND RANDOM MATRICES
FREE PROBABILITY THEORY AND RANDOM MATRICES ROLAND SPEICHER Abstract. Free probability theory originated in the context of operator algebras, however, one of the main features of that theory is its connection
More informationULTRASPHERICAL TYPE GENERATING FUNCTIONS FOR ORTHOGONAL POLYNOMIALS
ULTRASPHERICAL TYPE GENERATING FUNCTIONS FOR ORTHOGONAL POLYNOMIALS arxiv:083666v [mathpr] 8 Jan 009 Abstract We characterize, up to a conjecture, probability distributions of finite all order moments
More informationAn introduction to some aspects of functional analysis
An introduction to some aspects of functional analysis Stephen Semmes Rice University Abstract These informal notes deal with some very basic objects in functional analysis, including norms and seminorms
More informationMA/ST 810 Mathematical-Statistical Modeling and Analysis of Complex Systems
MA/ST 810 Mathematical-Statistical Modeling and Analysis of Complex Systems Review of Basic Probability The fundamentals, random variables, probability distributions Probability mass/density functions
More informationLet (Ω, F) be a measureable space. A filtration in discrete time is a sequence of. F s F t
2.2 Filtrations Let (Ω, F) be a measureable space. A filtration in discrete time is a sequence of σ algebras {F t } such that F t F and F t F t+1 for all t = 0, 1,.... In continuous time, the second condition
More information