Building on the line of work [DIRT15a], [DIRT15b], [NS17a], [DT17], [HLS18], [HS18] we continue the study of particle systems with singular interaction through hitting times. In contrast to the previous research, we (i) consider very general driving processes  , (ii) allow for inhomogeneous connection structures, and (iii) analyze a game in which the particles determine their connections strategically. Hereby, we uncover two completely new phenomena. First, we characterize the "times of fragility" of such systems (e.g., the times when a macroscopic part of the population defaults or gets infected simultaneously, or when the neuron cells "synchronize") explicitly in terms of the dynamics of the driving processes, the current distribution of the particles' values, and the topology of the underlying network (represented by its Perron-Frobenius eigenvalue). Second, we use such systems to describe a dynamic credit-network game and show that, in equilibrium, the system regularizes: i.e., the times of fragility never occur, as the particles avoid them by adjusting their connections strategically. Two auxiliary mathematical results, useful in their own right, are uncovered during our investigation: a generalization of Schauder's fixed-point theorem for the Skorokhod space with the M1 topology, and the application of the max-plus algebra to the equilibrium problem for credit networks .
Building on the line of work [DIRT15a], [DIRT15b], [NS17a], [DT17], [HLS18], [HS18] we continue the study of particle systems with singular interaction through hitting times. In contrast to the previous research, we (i) consider very general driving processes and interaction functions , (ii) allow for inhomogeneous connection structures, and (iii) analyze a game in which the particles determine their connections strategically. Hereby, we uncover two completely new phenomena. First, we characterize the "times of fragility" of such systems (e.g., the times when a macroscopic part of the population defaults or gets infected simultaneously, or when the neuron cells "synchronize") explicitly in terms of the dynamics of the driving processes, the current distribution of the particles' values, and the topology of the underlying network (represented by its Perron-Frobenius eigenvalue). Second, we use such systems to describe a dynamic credit-network game and show that, in equilibrium, the system regularizes: i.e., the times of fragility never occur, as the particles avoid them by adjusting their connections strategically. Two auxiliary mathematical results, useful in their own right, are uncovered during our investigation: a generalization of Schauder's fixed-point theorem for the Skorokhod space with the M1 topology, and the application of the max-plus algebra to the equilibrium version of the network flow problem .
A
and interaction functions
R
problem for credit networks
version of the network flow problem