Related papers: Momentum operators on graphs
We study the approximation of nonlinear operators between function spaces by transformers. Our approach is to lift functions to measures supported on their graphs and leverage a recently introduced measure-theoretic view of transformers. A…
We study the behavior of averages for functions defined on finite graphs $G$, in terms of the Hardy-Littlewood maximal operator $M_G$. We explore the relationship between the geometry of a graph and its maximal operator and prove that $M_G$…
An instance of the maximum mixed graph orientation problem consists of a mixed graph and a collection of source-target vertex pairs. The objective is to orient the undirected edges of the graph so as to maximize the number of pairs that…
Weighted shift operators $B$ in space $L^2(X,\mu)$ that are induced by Morse-Smale type of mappings are considered. A description of the properties of $B-\lambda I$ for $\lambda$ belonging to spectrum $\Sigma(B)$ is given. In particular,…
In this article we give an in depth overview of the recent advances in the field of equilibrium networks. After outlining this topic, we provide a novel way of defining equilibrium graph (network) ensembles. We illustrate this concept on…
We establish new bounds on the minimum number of distinct eigenvalues among real symmetric matrices with nonzero off-diagonal pattern described by the edges of a graph and apply these to determine the minimum number of distinct eigenvalues…
We present a new approach to graph limit theory which unifies and generalizes the two most well developed directions, namely dense graph limits (even the more general $L^p$ limits) and Benjamini--Schramm limits (even in the stronger…
A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers specific queries pertinent to the problem at hand. In this work, we address the fully dynamic edge orientation problem, also…
We introduce the notion of balance for directed graphs: a weighted directed graph is $\alpha$-balanced if for every cut $S \subseteq V$, the total weight of edges going from $S$ to $V\setminus S$ is within factor $\alpha$ of the total…
The paper is a continuation of the study started in \cite{Yorzh1}. Schrodinger operators on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of $\delta$ type. Either an…
An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit…
Developing further Stein's recent notion of relative end degrees in infinite graphs, we investigate which degree assumptions can force a locally finite graph to contain a given finite minor, or a finite subgraph of given minimum degree.…
In this paper, we discuss k-quasi-m-isometric composition operators and weighted composition operators on directed graphs with one circuit and more than one branching vertex.
We present a counterexample showing that the graphical limit of maximally monotone operators might not be maximally monotone. We also characterize the directional differentiability of the resolvent of an operator $B$ in terms of existence…
A successive vertex ordering of a graph is a linear ordering of its vertices in which every vertex except the first has at least one neighbour appearing earlier. Such orderings arise naturally in incremental growth and…
Erd\H{o}s introduced the noncommuting graph, in order to study the number of commuting elements in a finite group. Despite the use of combinatorial ideas, his methods involved several techniques of classical analysis. The interest for this…
We present some applications of ideas from partial differential equations and differential geometry to the study of difference equations on infinite graphs. All operators that we consider are examples of "elliptic operators" as defined by…
A path $P$ in a graph $G$ is said to be a degree monotone path if the sequence of degrees of the vertices of $P$ in the order in which they appear on $P$ is monotonic. The length of the longest degree monotone path in $G$ is denoted by…
A graph $X$ is said to be {\it distance--balanced} if for any edge $uv$ of $X$, the number of vertices closer to $u$ than to $v$ is equal to the number of vertices closer to $v$ than to $u$. A graph $X$ is said to be {\it strongly…
A graph $G$ is $1$-extendible if every edge belongs to at least one $1$-factor of $G$. Let $G$ be a graph with a $1$-factor $F$. Then an even $F$-orientation of $G$ is an orientation in which each $F$-alternating cycle has exactly an even…