Efficient network structures with separable heterogeneous connection costs

DOI10.1016/J.ECONLET.2015.06.014MaRDI QIDQ529825zbMATH OpenOpenAlexWikidataFDO

Authors Babak Heydari, Mohsen Mosleh, Kia Dalili

Publication date 9 June 2017

Published in Economics Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1504.06634

zbMATH Keywords

complex networksconnection modelcore-peripherydistance-based utilityefficient networks

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Abstract: 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.

Recommendations

• Network formation with heterogeneous players
• Efficient networks in games with local complementarities
• One-way flow networks: the role of heterogeneity
• Forming efficient networks
• Efficient structure of noisy communication networks

Cites work

• A strategic model of social and economic networks
• Anti-coordination and social interactions
• Core-periphery structure in networks
• Network formation with heterogeneous players
• Social and economic networks.

Cited in

(7)

• Impact of utilities on the structures of stable networks with ordered group partitioning
• Not all bridges connect: integration in multi-community networks
• On cost allocation in hub-like networks
• Efficient structure of noisy communication networks
• Listen before you link: optimal monitoring rules for communication networks
• Dominance of weighted nested split graph networks in connections models
• In search of efficient network structures: the needle in the haystack

This page was built for publication: Efficient network structures with separable heterogeneous connection costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q529825)