Related papers: Extension of m-isometric weighted composition oper…
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…
We present an analog to classic potential theory on weighted graphs. With nodes partitioned into exterior, boundary and interior nodes and an appropriate decomposition of the Laplacian, we define discrete analogues to the trace operators,…
We consider discrete Schr\"odinger operators with periodic potentials on periodic graphs. Their spectra consist of a finite number of bands. We perturb a periodic graph by adding edges in a periodic way (without changing the vertex set) and…
We identify the semigroups consisting of bounded composition operators on the Hardy spaces $H^p(\U)$ of the upper half-plane. We show that any such semigroup is strongly continuous on $H^p(\U)$ but not uniformly continuous and we identify…
This paper is based on three hours of lectures given by the first author in the "Focus Program on Analytic Function Spaces and their Applications" July 1 -- December 31, 2021, organized by the Fields Institute for Research in Mathematical…
In this paper we aim to construct an abstract model of a differential operator with a fractional integro-differential operator composition in final terms, where modeling is understood as an interpretation of concrete differential operators…
We give necessary and sufficient conditions for a weight system on multiloop chord diagrams to be obtainable from a metrized Lie algebra representation, in terms of a bound on the ranks of associated connection matrices. Here a multiloop…
The boundedness and compactness of weighted composition operators from $H^\infty$ to the Bloch space in the unit ball of Cn are investigated in this paper. In particular, some new characterizations for the boundedness and the essential norm…
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,…
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we…
Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of cooperative control problems, including formation control, distributed averaging, and optimization. We refer to a digraph…
In this note, we study the expander decomposition problem in a more general setting where the input graph has positively weighted edges and nonnegative demands on its vertices. We show how to extend the techniques of Chuzhoy et al. (FOCS…
We give some new characterizations of almost weak Dunford-Pettis operators and we investigate their relationship with weak Dunford-Pettis operators.
We construct an expansion in generalized eigenfunctions for Schrodinger operators on metric graphs. We require rather minimal assumptions concerning the graph structure and the boundary conditions at the vertices.
In this paper, we treat some weighted line digraphs which are induced by a connected and undirected graph. For a given graph $G$, the adjacency matrix of the weighted line digraph $W$ is determined by a boundary operator from an arc-based…
Let $\mathbb F$ be a finite field and let $\mathcal A$ and $\mathcal B$ be vector spaces of $\mathbb F$-valued continuous functions defined on locally compact spaces $X$ and $Y$, respectively. We look at the representation of linear…
We determine the optimum topology of quasi-one dimensional nonlinear optical structures using generalized quantum graph models. Quantum graphs are relational graphs endowed with a metric and a multiparticle Hamiltonian acting on the edges,…
We obtain faster expander decomposition algorithms for directed graphs, matching the guarantees of Saranurak and Wang (SODA 2019) for expander decomposition on undirected graphs. Our algorithms are faster than prior work and also generalize…
A subset $S$ of nodes in a graph $G$ is a $k$-connected $m$-dominating set ($(k,m)$-cds) if the subgraph $G[S]$ induced by $S$ is $k$-connected and every $v \in V \setminus S$ has at least $m$ neighbors in $S$. In the $k$-Connected…
To investigate hyperbinary expansions of a nonnegative integer~$n$, an edge-labeled directed graph $A(n)$ has recently been introduced. After pointing out some new simple facts about its cyclomatic number, we give a relatively simple…