Related papers: $p$-Laplace Operators for Oriented Hypergraphs
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
We study higher-order elliptic operators on one-dimensional ramified structures (networks). We introduce a general variational framework for fourth-order operators that allows us to study features of both hyperbolic and parabolic equations…
Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other…
We consider an arbitrary selfadjoint operator on a separable Hilbert space. To this operator we construct an expansion in generalized eigenfunctions in which the original Hilbert space is decomposed as a direct integral of Hilbert spaces…
A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…
Consider the following iterated process on a hypergraph $H$. Each vertex $v$ has an initial vertex weight. At each step, we uniformly at random select an edge $F$ in $H$, and for each vertex $v$ in $F$ we replace the weight of $v$ by the…
Laplacian operators are classical objects that are fundamental in both pure and applied mathematics and are becoming increasingly prominent in modern computational and data science fields such as applied and computational topology and…
A $p$-centered coloring of a graph $G$, where $p$ is a positive integer, is a coloring of the vertices of $G$ in such a way that every connected subgraph of $G$ either contains a vertex with a unique color or contains more than $p$…
Starting with an isolated vertex, here we construct a threshold hypergraph by repeatedly adding an isolated vertex or a $k$-dominating vertex set. We represent a threshold hypergraph by a string of non-negative integers and find the…
We solve the following problem: to describe in geometric terms all differential operators of the second order with a given principal symbol. Initially the operators act on scalar functions. Operator pencils acting on densities of arbitrary…
The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of…
We discuss ways in which momentum operators can be introduced on an oriented metric graph. A necessary condition appears to the balanced property, or a matching between the numbers of incoming and outgoing edges; we show that a graph…
We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such graphs by boundary conditions in the vertices given by…
We consider first order symmetry operators for the equations of motion of differential $p$-form fields in general $D$-dimensional background geometry of any signature for both massless and massive cases. For $p=1$ and $p=2$ we give the…
The power graph $P(\Omega)$ of a group $\Omega$ is a graph with the vertex set $\Omega$ such that two distinct vertices form an edge if and only if one of them is an integral power of the other. In this article, we determine the power graph…
An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…
We construct explicit minimal models for the (hyper)operads governing modular, cyclic and ordinary operads, and wheeled properads, respectively. Algebras for these models are homotopy versions of the corresponding structures.
Here we have investigated a few properties of the eigenvalues of normalized (geometric) graph Laplacian in different graphs. Preservation of eigenvalue 1 from a particular subgraph to the entire graph, the spectrum of the graph constructed…
We define and investigate properties of universal operator algebras of directed graphs. Results include free products decomposition and continuity of the construction with respect to direct limits. Lastly we prove some K-theoretic results…
This paper aims to compute and estimate the eigenvalues of the Hodge Laplacians on directed graphs. We have devised a new method for computing Hodge spectra with the following two ingredients. (I) We have observed that the product rule does…