Weighted Join Operators on Directed Trees
Sameer Chavan, Rajeev Gupta, Kalyan B. Sinha

TL;DR
This paper introduces and systematically studies weighted join operators on directed trees, exploring their properties, extensions, spectral characteristics, and conditions for closedness and compact resolvent, expanding the understanding of operator theory on graph structures.
Contribution
It develops a comprehensive framework for weighted join operators on directed trees, including their extensions, spectral analysis, and conditions for closedness and compactness, with novel insights into their structure and applications.
Findings
Weighted join operators generalize complex Jordan and n-symmetric operators.
Rank one extensions can be closed under certain compatibility conditions.
Characterization of operators with compact resolvent on leafless trees.
Abstract
A rooted directed tree with can be extended to a directed graph by adding a vertex to and declaring each vertex in as a parent of One may associate with the extended directed tree a family of semigroup structures with extreme ends being induced by the join operation and the meet operation . Each semigroup structure among these leads to a family of densely defined linear operators acting on which we refer to as weighted join operators at a given base point with prescribed vertex . The extreme ends of this family are weighted join operators and weighted meet operators . In this paper, we systematically study these operators. We also present a more involved…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpectral Theory in Mathematical Physics · Matrix Theory and Algorithms · Magnetism in coordination complexes
