Related papers: Distance k-graphs of hypercube and q-Hermite polyn…
The continuous big $q$-Hermite polynomials are shown to realize a basis for a representation space of an extended $q$-oscillator algebra. An expansion formula is algebraically derived using this model.
We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…
Properties of certain $q$-orthogonal polynomials are connected to the $q$-oscillator algebra. The Wall and $q$-Laguerre polynomials are shown to arise as matrix elements of $q$-exponentials of the generators in a representation of this…
In many real-world applications data come as discrete metric spaces sampled around 1-dimensional filamentary structures that can be seen as metric graphs. In this paper we address the metric reconstruction problem of such filamentary…
A unit cube in $k$ dimensional space (or \emph{$k$-cube} in short) is defined as the Cartesian product $R_1\times R_2\times...\times R_k$ where $R_i$(for $1\leq i\leq k$) is a closed interval of the form $[a_i,a_i+1]$ on the real line. A…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…
To each quadratic number field $K$ and each quadratic polynomial $f$ with $K$-coefficients, one can associate a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points for $f$, and whose edges reflect the…
The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in…
Finding the k-medianin a network involves identifying a subset of k vertices that minimize the total distance to all other vertices in a graph. This problem has been extensively studied in computer science, graph theory, operations…
Pairwise comparison of graphs is key to many applications in Machine learning ranging from clustering, kernel-based classification/regression and more recently supervised graph prediction. Distances between graphs usually rely on…
In this note we investigate under which conditions the dual of the flow polytope (henceforth referred to as the `dual flow polytope') of a quiver is k-neighborly, for generic weights near the canonical weight. We provide a lower bound on k,…
Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…
We investigate the metric structure of the intersection lattice L(B(n,k)) of the discriminantal arrange ment using circuit supports. We show that the cover graph associated with L(B(n,k)) is isometrically embedded into a hypercube, making…
We study the k-median and k-center problems in probabilistic graphs. We analyze the hardness of these problems, and propose several algorithms with improved approximation ratios compared with the existing proposals.
In this paper, we study graph distances in the geometric random graph models scale-free percolation SFP, geometric inhomogeneous random graphs GIRG, and hyperbolic random graphs HRG. Despite the wide success of the models, the parameter…
A conjugate skew gain graph is a skew gain graph with the labels (also called, the conjugate skew gains) from the field of complex numbes on the oriented edges such that they get conjugated when we reverse the orientation. In this paper we…
An algorithm for approximating the p-Wasserstein distance between histograms defined on unstructured discrete grids is presented. It is based on the computation of a barycenter constrained to be supported on a low dimensional subspace,…
We introduce two q-analogues of the 2D-Hermite polynomials which are functions of two complex variables. We derive explicit formulas, orthogonality relations, raising and lowering operator relations, generating functions, and Rodrigues…
Orthogonal polynomials are of fundamental importance in many fields of mathematics and science, therefore the study of a particular family is always relevant. In this manuscript, we present a survey of some general results of the Hermite…