Related papers: Multi-linear forms, graphs, and $L^p$-improving me…
In this paper we study stationary graphs for functionals of geometric nature defined on currents or varifolds. The point of view we adopt is the one of differential inclusions, introduced in this context in the recent paper [De Lellis, De…
This paper explores the observability and estimation capability of dynamical systems using predominantly relative measurements of the system's state-space variables, with minimal to no reliance on absolute measurements of these variables.…
Let $G$ be a simple finite connected graph. The line graph $L(G)$ of graph $G$ is the graph whose vertices are the edges of $G$, where $ef \in E(L(G))$ when $e \cap f \neq \emptyset$. Iteratively, the higher order line graphs are defined…
Graph Neural Networks usually rely on the assumption that the graph topology is available to the network as well as optimal for the downstream task. Latent graph inference allows models to dynamically learn the intrinsic graph structure of…
The aim of this paper is to obtain mixed weak-type inequalities for multilinear fractional operators, extending results by F. Berra, M. Carena and G. Pradolini \cite{BCP}. We prove that, under certain conditions on the weights, there exists…
In statistical physics, the multivariate hard-core model describes a system of particles, each of which receives its own fugacity. In graph-theoretic language, the partition function of the model translates to the multivariate independence…
The fusion of language models (LMs) and knowledge graphs (KGs) is widely used in commonsense question answering, but generating faithful explanations remains challenging. Current methods often overlook path decoding faithfulness, leading to…
In this paper, we propose a class of quantum Markov fields QMF on a graphs $G= (V,E)$. The Markov structure of the considered QMF is investigated in the finer structure of a quasi-local algebrav $\mathcal{A}_V$ of observables based over a…
Knowledge graph (KG) embedding aims at embedding entities and relations in a KG into a lowdimensional latent representation space. Existing KG embedding approaches model entities andrelations in a KG by utilizing real-valued ,…
The problem of the description of finite factor representations of the infinite-dimensional unitary group, investigated by Voiculescu in 1976, is equivalent to the description of all totally positive Toeplitz matrices. Vershik-Kerov showed…
We study the multicritical behavior for the semimetal-insulator transitions on graphene's honeycomb lattice using the Gross-Neveu-Yukawa effective theory with two order parameters: the SO(3) (Heisenberg) order parameter describes the…
Kirchhoff index, Kf(G), introduced by Klein and Randic in 1993, represents the total effective resistances between all pairs of vertices in a graph G, where each edge is regarded as a resistor. In this paper, the Kirchhoff indices of a…
In this article, we continue the structural study of factor maps betweeen symbolic dynamical systems and the relative thermodynamic formalism. Here, one is studying a factor map from a shift of finite type $X$ (equipped with a potential…
We study systems of nonlinear partial differential equations of parabolic type, in which the elliptic operator is replaced by the first order divergence operator acting on a flux function, which is related to the spatial gradient of the…
Let $G$ be a graph with vertex set $V(G)$. For any two distinct vertices $x$ and $y$ of $G$, let $R\{x, y\}$ denote the set of vertices $z$ such that the distance from $x$ to $z$ is not equal to the distance from $y$ to $z$ in $G$. For a…
Dynamical sampling, as introduced by Aldroubi et al., deals with frame properties of sequences of the form $\{T^i f_1\}_{i\in \mathbb{N}}$, where $f_1$ belongs to Hilbert space $\h$ and $T:\h\rightarrow\h$ belongs to certain classes of the…
Measuring similarity between complex objects is a fundamental task in many scientific fields. When objects are represented as graphs, graph similarity/distance measures offer a powerful framework for quantifying structural resemblance.…
The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple…
Networks are often modeled using graphs, and within this setting we introduce the notion of $k$-fault-tolerant mutual visibility. Informally, a set of vertices $X \subseteq V(G)$ in a graph $G$ is a $k$-fault-tolerant mutual-visibility set…
We give an approximate Menger-type theorem for when a graph $G$ contains two $X-Y$ paths $P_1$ and $P_2$ such that $P_1 \cup P_2$ is an induced subgraph of $G$. More generally, we prove that there exists a function $f(d) \in O(d)$, such…