Related papers: Pfaffians and nonintersecting paths in graphs with…
Dictionary learning is a key tool for representation learning, that explains the data as linear combination of few basic elements. Yet, this analysis is not amenable in the context of graph learning, as graphs usually belong to different…
We develop a general theory of Cartesian and non-Cartesian polynomials on products of complex spaces $\mathbb{C}^{n_1} \times \cdots \times \mathbb{C}^{n_k}$. We prove that, for any fixed degree $d \ge 2$, a (Zariski) generic polynomial is…
This paper investigates Gaussian Markov random field approximations to nonstationary Gaussian fields using graph representations of stochastic partial differential equations. We establish approximation error guarantees building on the…
Graphical models use graphs to compactly capture stochastic dependencies amongst a collection of random variables. Inference over graphical models corresponds to finding marginal probability distributions given joint probability…
We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniquely determined by their spectrum. We do so by constructing graphs that are cospectral but non-isomorphic to these graphs.
The paradigm of linear structural equation modeling readily allows one to incorporate causal feedback loops in the model specification. These appear as directed cycles in the common graphical representation of the models. However, the…
We construct the path integral for one-dimensional non-linear sigma models, starting from a given Hamiltonian operator and states in a Hilbert space. By explicit evaluation of the discretized propagators and vertices we find the correct…
We formulate a noncommutative generalization of the Ricci flow theory in the framework of spectral action approach to noncommutative geometry. Grisha Perelman's functionals are generated as commutative versions of certain spectral…
In a recent article J. Phys. Compl. 4 (2023) 035005, Kawamoto evoked statistical physics methods for the problem of counting graphs with a prescribed degree sequence. This treatment involved truncating a particular Taylor expansion at the…
The construction of Grassmannian codes in some projective space is of highly mathematical nature and requires strong computational power for the resulting searches. In this paper was constructed, using GAP System for Computational Discrete…
The $s$-point correlation function of a Gaussian Hermitian random matrix theory, with an external source tuned to generate a multi-critical singularity, provides the intersection numbers of the moduli space for the $p$-th spin curves…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
Gaussian processes are a versatile framework for learning unknown functions in a manner that permits one to utilize prior information about their properties. Although many different Gaussian process models are readily available when the…
The Feynman path integral is defined over the space $\mathbb{R}^T$ of all possible paths; it has been a powerful tool to develop Quantum Mechanics. The absolute value of Feynman's integrand is not integrable, then Lebesgue integration…
In this paper, we obtain explicit formulae for the number of 7-cycles and the total number of paths of lengths 6 and 7 those contain a specific vertex $v_{i}$ in a simple graph G, in terms of the adjacency matrix and with the help of…
The linear Arithmetic Fundamental Lemma (AFL) conjecture compares intersection numbers on Lubin--Tate deformation spaces with derivatives of orbital integrals. It has been introduced for elliptic orbits in arXiv:1803.07553 and…
In trying to generalize the classic Sylvester-Gallai theorem and De Bruijn-Erd\H{o}s theorem in plane geometry, lines and closure lines were previously defined for metric spaces and hypergraphs. Both definitions do not obey the geometric…
We present a geometric proof of the averaging theorem for perturbed dynamical systems on a Riemannian manifold, in the case where the flow of the unperturbed vector field is periodic and the $\mathbb{S}^{1}$-action associated to this vector…
For a simple graph $G$, let $n$ and $m$ denote the number of vertices and edges in $G$, respectively. The Erd\H{o}s-Gallai theorem for paths states that in a simple $P_k$-free graph, $m \leq \frac{n(k-1)}{2}$, where $P_k$ denotes a path…
Grassmann angles improve upon similar concepts of angle between subspaces that measure volume contraction in orthogonal projections, working for real or complex subspaces, and being more efficient when dimensions are different. Their…