Related papers: First order operators on shrinking graph-like spac…
In this article, we will consider second order uniformly elliptic operators of divergence form defined on R^n with measurable coefficients. Mainly, we will give estimates on the dimension of space of solutions that grow at most polynomially…
We consider vector lattices endowed with locally solid convergence structures, which are not necessarily topological. We show that such a convergence is defined by the convergence to $0$ on the positive cone. Some results on unbounded…
In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set (m,n)-graphs (i.e. graphs with n vertices and m edges) and some operations on graphs that are monotone with respect to…
We prove several negative results about first-order transducibility for classes of sparse graphs: - for every $t \in \mathbb{N}$, the class of graphs of treewidth at most $t+1$ is not transducible from the class of graphs of treewidth at…
We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph . Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…
In the inhomogeneous random graph model, each vertex $i\in\{1,\ldots,n\}$ is assigned a weight $W_i\sim\text{Unif}(0,1)$, and an edge between any two vertices $i,j$ is present with probability $k(W_i,W_j)/\lambda_n\in[0,1]$, where $k$ is a…
Graph Neural Networks (GNNs) address two key challenges in applying deep learning to graph-structured data: they handle varying size input graphs and ensure invariance under graph isomorphism. While GNNs have demonstrated broad…
We introduce and study a new class of generalized convex functions termed star quasiconvex functions. This class includes convex, star-convex, quasiconvex, quasar-convex, and positively homogeneous functions of any degree $p>0$ as special…
We prove a formula for a characteristic polynomial of an operator expressed as a polynomial of rank 1 operators. The formula uses a discrete analog of path integration and implies a generalization of the Forman-Kenyon's formula [4,6] for a…
A class of graphs is structurally nowhere dense if it can be constructed from a nowhere dense class by a first-order transduction. Structurally nowhere dense classes vastly generalize nowhere dense classes and constitute important examples…
Guerrero et al. \cite{GBSO} propose a novel approach to building first-order integer-valued autoregressive (\inar1) models based on the concept of thinning. The standard approach requires that the thinning operator be defined first and…
This paper presents a general definition of pseudo-differential operators of type $1,1$; the definition is shown to be the largest one that is both compatible with negligible operators and stable under vanishing frequency modulation.…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…
In this paper, we study the graph-theoretic analogues of vector Laplacian (or Helmholtz operator) and vector Laplace equation. We determine the graph matrix representation of vector Laplacian and obtain the dimension of solution space of…
Based on \cite{DH94}, we introduce a bijective correspondence between first order differential calculi and the graph structure of the symmetric lattice that allows one to encode completely the interconnection structure of the graph in the…
This is the first part of a series of two papers where we study perturbations of divergence form second order elliptic operators $-\mathop{\operatorname{div}} A \nabla$ by first and zero order terms, whose coefficients lie in critical…
The $p$-Laplacian for graphs, as well as the vertex Laplace operator and the hyperedge Laplace operator for the general setting of oriented hypergraphs, are generalized. In particular, both a vertex $p$-Laplacian and a hyperedge…
We consider first order expressible properties of random perfect graphs. That is, we pick a graph $G_n$ uniformly at random from all (labelled) perfect graphs on $n$ vertices and consider the probability that it satisfies some graph…
It is well known that increasing functions do not preserve operator order in general; nor do decreasing functions reverse operator order. However, operator monotone increasing or operator monotone decreasing do. In this article, we employ a…
The first order form of a Maxwell theory and U(1) gauge theory in which a gauge invariant mass term appears is analyzed using the Dirac procedure. The form of the gauge transformation which leaves the action invariant is derived from the…