Searcharxiv⌕ Search

arXiv subjects

Nobuaki Obata

Publications and source records attributed to Nobuaki Obata.

At least 19 recordsLinked to original sources
arXiv2025

Quadratic Embedding Constants of Corona Graphs

The quadratic embedding constant (QEC) of a connected graph is defined to be the maximum of the quadratic function associated with its distance matrix on a certain unit sphere of codimension two. In this paper we derive a formula for the QEC of a corona graph $G\odot H$. It is shown that $\mathrm{QEC}(G\odot H)=\psi_{H*}^{-1}(\mathrm{QEC}(G))$ holds under some spectral assumptions on $H$, where $\psi_{H*}^{-1}$ is the inverse function of the most right branch of the analytic function $\psi_H$ defined by means of the main eigenvalues of the adjacency matrix of $H$. Moreover, if $H$ is a regular graph of which the adjacency matrix has the smallest eigenvalue $-2$, then the formula is written down explicitly.

math.CO↗
arXiv2025

Partial Chebyshev Polynomials and Fan Graphs

Motivated by the product formula of the Chebyshev polynomials of the second kind $U_n(x)$, we newly introduce the partial Chebyshev polynomials $U^{\mathrm{e}}_n(x)$ and $U^{\mathrm{o}}_n(x)$ and derive their basic properties, relations to the classical Chebyshev polynomials, and new factorization formulas for $U_n(x)$. In order to calculate the quadratic embedding constant (QEC) of a fan graph $K_1+P_n$, we derive a new polynomial $ϕ_n(x)$ which is factorized by partial Chebyshev polynomial $U^{\mathrm{e}}_n(x)$. We prove that $\mathrm{QEC}(K_1+P_n)$ is given in terms of the minimal zero of $ϕ_n(x)$, and obtain the explicit value of $\mathrm{QEC}(K_1+P_n)$ for an even $n$ and its reasonable exstimate for an odd $n$.

math.CO↗
arXiv2025

Quadratic Embedding Constants of Strongly Regular Graphs

We obtain an explicit formula for the quadratic embedding constant (QEC) of a strongly regular graph $\mathrm{srg}(n,k,λ,μ)$ with $μ\ge1$. By using QEC we give a necessary and sufficient condition for a strongly regular graph to admit a quadratic embeddingin a Euclidean space.

math.CO↗
arXiv2024

Quadratic embedding constants of fan graphs and graph joins

We derive a general formula for the quadratic embedding constant of a graph join $\bar{K}_m+G$, where $\bar{K}_m$ is the empty graph on $m\ge1$ vertices and $G$ is an arbitrary graph. Applying our formula to a fan graph $K_1+P_n$, where $K_1=\bar{K}_1$ is the singleton graph and $P_n$ is the path on $n\ge1$ vertices, we show that $\mathrm{QEC}(K_1+P_n)=-\tildeα_n-2$, where $\tildeα_n$ is the minimal zero of a new polynomial $Φ_n(x)$ related to Chebyshev polynomials of the second kind. Moreover, for an even $n$ we have $\tildeα_n=\min\mathrm{ev}(A_n)$, where the right-hand side is the An minimal eigenvalue of the adjacency matrix $A_n$ of $P_n$. For an odd $n$ we show that $\min\mathrm{ev}(A_{n+1})\le\tildeα_n<\min\mathrm{ev}(A_n)$.

math.CO↗
arXiv2024

Meixner random variables and their quantum operators

We find the position-momentum decomposition of the quantum operators of the classic Meixner random variables. The position-momentum decomposition involves translation operators, which are used to give a new characterization of the Meixner random variables.

math.PR↗
arXiv2024

A Classification of Graphs through Quadratic Embedding Constants and Clique Graph Insights

The quadratic embedding constant (QEC) of a graph $G$ is a new numeric invariant, which is defined in terms of the distance matrix and is denoted by $\mathrm{QEC}(G)$. By observing graph structure of the maximal cliques (clique graph), we show that a graph $G$ with $\mathrm{QEC}(G)<-1/2$ admits a ``cactus-like'' structure. We derive a formula for the quadratic embedding constant of a graph consisting of two maximal cliques. As an application we discuss characterization of graphs along the increasing sequence of $\mathrm{QEC}(P_d)$, where $P_d$ is the path on $d$ vertices. In particular, we determine graphs $G$ satisfying $\mathrm{QEC}(G)<\mathrm{QEC}(P_5)$.

math.CO↗
arXiv2023

Complete Multipartite Graphs of Non-QE Class

We derive a formula for the QE constant of a complete multipartite graph and determine the complete multipartite graphs of non-QE class, namely, those which do not admit quadratic embeddings in a Euclidean space. Moreover, the primary non-QE graphs are specified among the complete multipartite graphs.

math.CO↗
arXiv2022

Primary Non-QE Graphs on Six Vertices

A connected graph is called of non-QE class if it does not admit a quadratic embedding in a Euclidean space. A non-QE graph is called primary if it does not contain a non-QE graph as an isometrically embedded proper subgraph. The graphs on six vertices are completely classified into the classes of QE graphs, of non-QE graphs, and of primary non-QE graphs.

math.CO↗
arXiv2022

Quadratic Embedding Constants of Graph Joins

The quadratic embedding constant (QE constant) of a graph is a new characteristic value of a graph defined through the distance matrix. We derive formulae for the QE constants of the join of two regular graphs, double graphs and certain lexicographic product graphs. Examples include complete bipartite graphs, wheel graphs, friendship graphs, completely split graph, and some graphs associated to strongly regular graphs.

math.CO↗
arXiv2021

Scaling Limits for the Gibbs States on Distance-Regular Graphs with Classical Parameters

We determine the possible scaling limits in the quantum central limit theorem with respect to the Gibbs state, for a growing distance-regular graph that has so-called classical parameters with base unequal to one. We also describe explicitly the corresponding weak limits of the normalized spectral distribution of the adjacency matrix. We demonstrate our results with the known infinite families of distance-regular graphs having classical parameters and with unbounded diameter.

math.CO↗
arXiv2019

Determining Finite Connected Graphs Along the Quadratic Embedding Constants of Paths

The QE constant of a finite connected graph $G$, denoted by $\mathrm{QEC}(G)$, is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two. We prove that the QE constants of paths $P_n$ form a strictly increasing sequence converging to $-1/2$. Then we formulate the problem of determining all the graphs $G$ satisfying $\mathrm{QEC}(P_n)\le\mathrm{QEC}(G)<\mathrm{QEC}(P_{n+1})$. The answer is given for $n=2$ and $n=3$ by exploiting forbidden subgraphs for $\mathrm{QEC}(G)<-1/2$ and the explicit QE constants of star products of the complete graphs.

math.CO↗
arXiv2018

Multivariate orthogonal polynomials: quantum decomposition, deficiency rank and support of measure

In this paper we investigate the multivariate orthogonal polynomials based on the theory of interacting Fock spaces. Our framework is on the same stream line of the recent paper by Accardi, Barhoumi, and Dhahri \cite{ABD}. The (classical) coordinate variables are decomposed into non-commuting (quantum) operators called creation, annihilation, and preservation operators, in the interacting Fock spaces. Getting the commutation relations, which follow from the commuting property of the coordinate variables between themselves, we can develop the reconstruction theory of the measure, namely the Favard's theorem. We then further develop some related problems including the marginal distributions and the rank theory of the Jacobi operators. We will see that the deficiency rank of the Jacobi operator implies that the underlying measure is supported on some algebraic surface and vice versa. We will provide with some examples.

math-ph↗
arXiv2018

Asymptotic joint spectra of Cartesian powers of strongly regular graphs and bivariate Charlier-Hermite polynomials

Generalizing previous work of Hora (1998) on the asymptotic spectral analysis for the Hamming graph $H(n,q)$ which is the $n^{\mathrm{th}}$ Cartesian power $K_q^{\square n}$ of the complete graph $K_q$ on $q$ vertices, we describe the possible limits of the joint spectral distribution of the pair $(G^{\square n},\overline{G}\vphantom{G}^{\square n})$ of the $n^{\mathrm{th}}$ Cartesian powers of a strongly regular graph $G$ and its complement $\overline{G}$, where we let $n\rightarrow\infty$, and $G$ may vary with $n$. This result is an analogue of the bivariate central limit theorem, and we obtain in this way the bivariate Poisson distributions and the standard bivariate Gaussian distribution, together with the product measures of univariate Poisson and Gaussian distributions. We also report a family of bivariate hypergeometric orthogonal polynomials with respect to the last distributions, which we call the bivariate Charlier-Hermite polynomials, and prove basic formulas for them. This family of orthogonal polynomials seems previously unnoticed, possibly because of its peculiarity.

math.CO↗
arXiv2018

On Quadratic Embedding Constants of Star Product Graphs

A connected graph $G$ is of QE class if it admits a quadratic embedding in a Hilbert space, or equivalently if the distance matrix is conditionally negative definite, or equivalently if the quadratic embedding constant $\mathrm{QEC}(G)$ is non-positive. For a finite star product of (finite or infinite) graphs $G=G_1\star\dotsb \star G_r$ an estimate of $\mathrm{QEC}(G)$ is obtained after a detailed analysis of the minimal solution of a certain algebraic equation. For the path graph $P_n$ an implicit formula for $\mathrm{QEC}(P_n)$ is derived, and by limit argument $\mathrm{QEC}(\mathbb{Z})=\mathrm{QEC}(\mathbb{Z}_+)=-1/2$ is shown. During the discussion a new integer sequence is found.

math.CO↗
arXiv2016

Kronecker Product Graphs and Counting Walks in Restricted Lattices

Formulas are derived for counting walks in the Kronecker product of graphs, and the associated spectral distributions are obtained by the Mellin convolution of probability distributions. Two-dimensional restricted lattices admitting the Kronecker product structure are listed, and their spectral distributions are calculated in terms of elliptic integrals.

math.CO↗
arXiv2013

Asymptotic Spectral Distributions of Distance $k$-Graphs of Cartesian Product Graphs

Let $G$ be a finite connected graph on two or more vertices and $G^{[N,k]}$ the distance $k$-graph of the $N$-fold Cartesian power of $G$. For a fixed $k\ge1$, we obtain explicitly the large $N$ limit of the spectral distribution (the eigenvalue distribution of the adjacency matrix) of $G^{[N,k]}$. The limit distribution is described in terms of the Hermite polynomials. The proof is based on asymptotic combinatorics along with quantum probability theory.

math.FA↗
arXiv2012

Localization of the Grover walks on spidernets and free Meixner laws

A spidernet is a graph obtained by adding large cycles to an almost regular tree and considered as an example having intermediate properties of lattices and trees in the study of discrete-time quantum walks on graphs. We introduce the Grover walk on a spidernet and its one-dimensional reduction. We derive an integral representation of the $n$-step transition amplitude in terms of the free Meixner law which appears as the spectral distribution. As an application we determine the class of spidernets which exhibit localization. Our method is based on quantum probabilistic spectral analysis of graphs.

quant-ph↗