Graph-indexed random walks on special classes of graphs
Jan Bok

TL;DR
This paper studies the average range of M-Lipschitz mappings on specific graph classes, providing formulas and asymptotic behavior for paths, complete graphs, bipartite graphs, and cycles.
Contribution
It offers explicit formulas and asymptotic analysis for the average range of M-Lipschitz mappings on well-known graph classes.
Findings
Closed formulas for average range on paths, complete graphs, bipartite graphs, and cycles.
Asymptotic behavior of the average range on these graph classes.
Insights into the structure of Lipschitz mappings on special graphs.
Abstract
We investigate the paramater of the average range of -Lipschitz mapping of a given graph. We focus on well-known classes such as paths, complete graphs, complete bipartite graphs and cycles and show closed formulas for computing this parameter and also we conclude asymptotics of this parameter on these aforementioned classes.
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
TopicsLimits and Structures in Graph Theory · Mathematical Dynamics and Fractals · Topological and Geometric Data Analysis
