Constructing Banking Networks under Decreasing Fixed-Costs

The structure of networks plays a central role in the behavior of financial systems and their response to policy. Real-world networks, however, are rarely di- rectly observable: banks’ assets and liabilities are typically known, but not who is lending how much and to whom. This paper adds to the existing literature in two ways. First, it shows how to simulate realistic networks that are based on balance- sheet information. To do so, we introduce a model where links cause fixed-costs, independent of contract size; but the costs per link decrease the more connected a bank is (scale economies). Second, to approach the optimization problem, we de- velop a new algorithm inspired by the transportation planning literature and research in stochastic search heuristics. Computational experiments find that the resulting net- works are not only consistent with the balance sheets, but also resemble real-world financial networks in their density (which is sparse but not minimally dense) and in their core-periphery and disassortative structure.