The Distribution of Path Lengths On Directed Weighted Graphs
From MaRDI portal
Publication:5118023
DOI10.1007/978-3-030-31531-3_20zbMATH Open1446.05042arXiv1608.00150OpenAlexW2506680810MaRDI QIDQ5118023
Uzy Smilansky, Avner Kiro, Yotam Smilansky
Publication date: 26 August 2020
Published in: Analysis as a Tool in Mathematical Physics (Search for Journal in Brave)
Abstract: We consider directed weighted graphs and define various families of path counting functions. Our main results are explicit formulas for the main term of the asymptotic growth rate of these counting functions, under some irrationality assumptions on the lengths of all closed orbits on the graph. In addition we assign transition probabilities to such graphs and compute statistics of the corresponding random walks. Some examples and applications are reviewed.
Full work available at URL: https://arxiv.org/abs/1608.00150
Distance in graphs (05C12) Signed and weighted graphs (05C22) Paths and cycles (05C38) Random walks on graphs (05C81)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matrix Analysis
- Aperiodic order. Volume 1. A mathematical invitation
- An analogue of the prime number theorem for closed orbits of Axiom A flows
- An analogue of the prime number theorem for closed orbits of shifts of finite type and their suspensions
- Non-negative matrices and Markov chains. 2nd ed
- Non-Archimedean equidistribution and group actions on trees
- Multiscale substitution tilings
- Substitution tilings and separated nets with similarities to the integer lattice
- Some generalizations of the pinwheel tiling
- Entropies and spectra
- Degeneracies in the length spectra of metric graphs
- Delay-time distribution in the scattering of time-narrow wave packets (II)βquantum graphs
- Delay-time distribution in the scattering of time-narrow wave packets. (I)
- A simple condition for bounded displacement
- Orbit counting in conjugacy classes for free groups acting on trees
Cited In (9)
- THE AVERAGE WEIGHTED PATH LENGTH FOR A CLASS OF HIERARCHICAL NETWORKS
- Uniform distribution of Kakutani partitions generated by substitution schemes
- Impulsive processes on the weighted directed graphs
- An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths
- Statistics and gap distributions in random Kakutani partitions and multiscale substitution tilings
- The total acquisition number of the randomly weighted path
- Title not available (Why is that?)
- Continuous-time multidimensional walks as an integrable model
- Successive shortest paths in complete graphs with random edge weights
Recommendations
- Title not available (Why is that?) π π
- Directed random graphs with given degree distributions π π
- The statistics of random directed graphs π π
- Shortest paths in random weighted graphs π π
- On the distribution of typical shortest-path lengths in connected random geometric graphs π π
- On Shortest Paths in Graphs with Random Weights π π
- The diameter of weighted random graphs π π
- Shortest-Weight Paths in Random Regular Graphs π π
- Limit theorems for the maximal path weight in a directed graph on the line with random weights of edges π π
- Distributions on graphs and walks π π
This page was built for publication: The Distribution of Path Lengths On Directed Weighted Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5118023)