# Efficient Network Structures with Separable Heterogeneous Connection Costs

arXiv: https://arxiv.org/abs/1504.06634 · HTML: https://mlsanity.com/paper/1504.06634/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Apr 2015.

## Built on by (most cited first, 2 of 2)

- [Resource Governance in Networked Systems via Integrated Variational Autoencoders and Reinforcement Learning](https://mlsanity.com/paper/2410.23393/) (2024)
- [Adaptive Network Intervention for Complex Systems: A Hierarchical Graph Reinforcement Learning Approach](https://mlsanity.com/paper/2410.23396/) (2024)

## Abstract (arXiv)

We introduce a heterogeneous connection model for network formation to capture the effect of cost heterogeneity on the structure of efficient networks. In the proposed model, connection costs are assumed to be separable, which means the total connection cost for each agent is uniquely proportional to its degree. For these sets of networks, we provide the analytical solution for the efficient network and discuss stability impli- cations. We show that the efficient network exhibits a core-periphery structure, and for a given density, we find a lower bound for clustering coefficient of the efficient network.