Abstract
In this paper, we focus on how to improve transportation efficiency of scale-free networks via edge increments. Based on analyzing the correlation between algebraic connectivity, which is the second smallest eigenvalue of the graph Laplacian matrix, and traffic capacity, we propose an effective edge-addition strategy called maximum algebraic connectivity increment edge (MACIE). Existing approaches are based on topological structure parameters, such as path and degree of a network, which require expensive computation. Different from existing edge-addition strategies, MACIE enhances transport efficiency by maximizing algebraic connectivity, and thus has a shorter running time. Simulation results show that MACIE is efficient and performs better than the previous strategy of reduction structural hole (RSH).
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.
