Abstract
Motivated by the desire to model internet traffic we consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. We present and test two techniques to analyse these walks. On Erdős–Rényi random graphs where the probability of a walk decays exponentially with its length, the methods give indistinguishable results for the decay exponent. This simple form of decay is not apparent on heterogeneous networks such as Barabási–Albert scale free networks and in this case each technique is demonstrated to have a different strength.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
