Rotation-invariant operators on white noise functional.
Constructing One-Parameter Transformations on White Noise Functions in Terms of Equicontinuous Generators.
Integral expression of some indecomposable characters of the infinite symmetric group in terms of irreducible repesentations.
Some remarks on induced representations of infinite discrete groups.
Markov product of positive definite kernels and applications to Q-matrices of graph products
We show positivity of the Q-matrix of four kinds of graph products: direct product (Cartesian product), star product, comb product, and free product. During the discussion we give an alternative simple proof of the Markov product theorem on positive definite kernels.
Positive Q-matrices of graphs
The Q-matrix of a connected graph = (V,E) is , where ∂(x,y) is the graph distance. Let q() be the range of q ∈ (-1,1) for which the Q-matrix is strictly positive. We obtain a sufficient condition for the equality q(̃) = q() where ̃ is an extension of a finite graph by joining a square. Some concrete examples are discussed.
Asymptotic spectral distributions of distance k-graphs of large-dimensional hypercubes
We derive the asymptotic spectral distribution of the distance k-graph of N-dimensional hypercube as N → ∞.
Asymptotic spectral analysis of growing graphs: odd graphs and spidernets
Two new examples are given for illustrating the method of quantum decomposition in the asymptotic spectral analysis for a growing family of graphs. The odd graphs form a growing family of distance-regular graphs and the two-sided Rayleigh distribution appears in the limit of vacuum spectral distribution of the adjacency matrix. For a spidernet as well as for a growing family of spidernets the vacuum distribution of the adjacency matrix is the free Meixner law. These distributions are calculated...
Singleton independence
Motivated by the central limit problem for algebraic probability spaces arising from the Haagerup states on the free group with countably infinite generators, we introduce a new notion of statistical independence in terms of inequalities rather than of usual algebraic identities. In the case of the Haagerup states the role of the Gaussian law is played by the Ullman distribution. The limit process is realized explicitly on the finite temperature Boltzmannian Fock space. Furthermore, a functional...
Asymptotic spectral analysis of generalized Erdős-Rényi random graphs
Motivated by the Watts-Strogatz model for a complex network, we introduce a generalization of the Erdős-Rényi random graph. We derive a combinatorial formula for the moment sequence of its spectral distribution in the sparse limit.
Asymptotic spectral distributions of distance-k graphs of Cartesian product graphs
Let G be a finite connected graph on two or more vertices, and the distance-k graph of the N-fold Cartesian power of G. For a fixed k ≥ 1, we obtain explicitly the large N limit of the spectral distribution (the eigenvalue distribution of the adjacency matrix) of . The limit distribution is described in terms of the Hermite polynomials. The proof is based on asymptotic combinatorics along with quantum probability theory.
Page 1