Related papers: Four Cubes
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…
A fuzzy Boolean function is a map $f:\cube^n\to [0,1]$, where $n\in\mathbb N$. We introduce and compare three ways of saying that such a function has bounded complexity. The first is a sampling property: the value $f(x)$ can be recovered,…
In an attempt to characterize the structure of eigenvectors of random regular graphs, we investigate the correlations between the components of the eigenvectors associated to different vertices. In addition, we provide numerical…
We show that self-dual gravity in Euclidean four-dimensional Anti-de Sitter space (AdS$_4$) can be described by a minimally coupled scalar field with a cubic interaction written in terms of a deformed Poisson bracket, providing a remarkably…
The properties of a hypergraph explored through the spectrum of its unified matrix was made by the authors in [26]. In this paper, we introduce three different hypergraph matrices: unified Laplacian matrix, unified signless Laplacian…
A new class of isospectral graphs is presented. These graphs are isospectral with respect to both the normalised Laplacian on the discrete graph and the standard differential Laplacian on the corresponding metric graph. The new class of…
The Coble cubics were discovered more than a century ago in connection with genus two Riemann surfaces and theta functions. They have attracted renewed interest ever since. Recently, they were reinterpreted in terms of alternating…
We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…
Graph Neural Networks (GNNs) conventionally rely on standard Laplacian or adjacency matrices for structural message passing. In this work, we substitute the traditional Laplacian with a Doubly Stochastic graph Matrix (DSM), derived from the…
Ahanjideh, Akbari, Fakharan and Trevisan proposed a conjecture in [Linear Algebra Appl. 632 (2022) 1--14] on the distribution of the Laplacian eigenvalues of graphs: for any connected graph of order $n$ with diameter $d\ge 2$ that is not a…
We calculate the one-electron spectral function of the attractive (negative-$U$) Hubbard model. We work in the intermediate coupling and low density regime and obtain the self-energy in an approximate analytical form. The excitation…
With the development of quantum algorithms, high-cost computations are being scrutinized in the hope of a quantum advantage. While graphs offer a convenient framework for multiple real-world problems, their analytics still comes with high…
Dynamics of a one-dimensional system of Brownian particles with short-range repulsive interaction (diameter sigma) is studied with a liquid-theoretical approach. The mean square displacement, the two-particle displacement correlation, and…
We introduce the matrix sums that represent a discrete analog of the matrix models with quartic potential. The probability space is given by the set of all simple n-vertex graphs with the Gibbs weight determined by the graph Laplacian. We…
Multimodal MRI offers complementary multi-scale information to characterize the brain structure. However, it remains challenging to effectively integrate multimodal MRI while achieving neuroscience interpretability. Here we propose to use…
In the three-dimensional flat space, a classical Hamiltonian, which has five functionally independent integrals of motion, including the Hamiltonian, is characterized as superintegrable. Kalnins, Kress and Miller (J. Math. Phys. 48 (2007),…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this paper we determine…
Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying…
We study K\"ahler-Dirac fermions on Euclidean dynamical triangulations. This fermion formulation furnishes a natural extension of staggered fermions to random geometries without requring vielbeins and spin connections. We work in the…