Determining Geodesic Distance on Arbitrary-order Subdivision of Tree with Applications
Fei Ma, Xiaomin Wang, Ping Wang

TL;DR
This paper introduces new techniques for calculating geodesic distance and mean first-passage time on complex tree models, enabling more efficient analysis of diffusion processes on treelike structures.
Contribution
The paper develops generalized mapping techniques for exact formulas of geodesic distance and MFPT on subdivided tree models, surpassing previous matrix-based methods.
Findings
Derived exact formulas for geodesic distance and MFPT on subdivided trees.
Techniques are more general and easier to implement than existing methods.
Applied methods to Cayley and exponential trees, demonstrating effectiveness.
Abstract
The problem of how to estimate diffusion on a graph effectively is of importance both theoretically and practically. In this paper, we make use of two widely studied indices, geodesic distance and mean first-passage time () for random walk, to consider such a problem on some treelike models of interest. To this end, we first introduce several types of operations, for instance, th-order subdivision and ()-star-fractal operation, to generate the potential candidate models. And then, we develop a class of novel techniques based on mapping for calculating the exact formulas of the both quantities above on our models. Compared to those previous tools including matrix-based methods for addressing the issue of this type, the techniques proposed here are more general mainly because we generalize the initial condition for creating these models. Meantime, in order to show…
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 · Advanced Graph Theory Research · Graph theory and applications
