Optimal Network Compression

08/20/2020
by   Hamed Amini, et al.
0

This paper introduces a formulation of the optimal network compression problem for financial systems. This general formulation is presented for different levels of network compression or rerouting allowed from the initial interbank network. We prove that this problem is, generically, NP-hard. We focus on objective functions generated by systemic risk measures under systematic shocks to the financial network. We conclude by studying the optimal compression problem for specific networks; this permits us to study the so-called robust fragility of certain network topologies more generally as well as the potential benefits and costs of network compression.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2020

Default Ambiguity: Finding the Best Solution to the Clearing Problem

We study financial networks with debt contracts and credit default swaps...
research
07/08/2019

Proof compression and NP versus PSPACE. Part 2

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]:...
research
01/06/2018

Joint Data Compression and Caching: Approaching Optimality with Guarantees

We consider the problem of optimally compressing and caching data across...
research
06/20/2023

About some compression algorithms

We use neural network algorithms for finding compression methods of imag...
research
01/25/2020

Vehicle Scheduling Problem

We define a new problem called the Vehicle Scheduling Problem (VSP). The...
research
02/25/2021

Generalized Parametric Path Problems

Parametric path problems arise independently in diverse domains, ranging...
research
10/31/2019

Edge minimization in de Bruijn graphs

This paper introduces the de Bruijn graph edge minimization problem, whi...

Please sign up or login with your details

Forgot password? Click here to reset