Network design method boosts connectivity using density graphs and learning

Toward Maximizing Algebraic Connectivity via Density-Dependent Backbone Construction and Reinforcement Learning Completion

Machine Learning

Summary

Finding the best way to connect points in a network with a fixed number of connections is hard. The authors propose building a strong basic structure depending on how dense the network is, then using learning techniques to add remaining connections wisely. This two-step approach achieves better overall connectivity and runs efficiently, beating some earlier methods. It shows that starting with a good main structure helps make large networks perform better.

What this means in practice

Authors

Zeru Zhu, Marco Gamarra, Ji Liu

Abstract

This paper studies an open network design problem of constructing graph topologies with maximum algebraic connectivity under fixed numbers of vertices and edges. A density-dependent approach is proposed that decomposes the design task into two stages: a high-quality, low-cost structural backbone construction and a reinforcement learning completion stage. The method selects the backbone based on density, using complete multipartite graphs in dense regimes and Cayley graphs in low-to-intermediate regimes, and then refines the remaining edges through a learning-based procedure. Numerical results show that the proposed method achieves high algebraic connectivity with favorable runtime scalability, outperforming existing methods. These results support a structural-family-first strategy for scalable network design.