Abstract
We carry out comparative studies of random walks on deterministic Apollonian networks (DANs) and random Apollonian networks (RANs). We perform computer simulations for the mean first-passage time, the average return time, the mean-square displacement, and the network coverage for the unrestricted random walk. The diffusions both on DANs and RANs are proved to be sublinear. The effects of the network structure on the dynamics and the search efficiencies of walks with various strategies are also discussed. Contrary to intuition, it is shown that the self-avoiding random walk, which has been verified as an optimal local search strategy in networks, is not the best strategy for the DANs in the large size limit.
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 callDisclaimer: 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.
