A dynamic network model with persistent links and node-specific latent variables, with an application to the interbank market
We propose a dynamic network model where two mechanisms control the probability of a link between two nodes: (i) the existence or absence of this link in the past, and (ii) node-specific latent variables (dynamic fitnesses) describing the propensity of each node to create links. Assuming a Markov dynamics for both mechanisms, we propose an Expectation-Maximization algorithm for model estimation and inference of the latent variables. The estimated parameters and fitnesses can be used to forecast the presence of a link in the future. We apply our methodology to the e-MID interbank network for which the two linkage mechanisms are associated with two different trading behaviors in the process of network formation, namely preferential trading and trading driven by node-specific characteristics. The empirical results allow to recognise preferential lending in the interbank market and indicate how a method that does not account for time-varying network topologies tends to overestimate preferential linkage.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Continuous-time Graph Representation with Sequential Survival Process
Over the past two decades, there has been a tremendous increase in the growth of representation learning methods for graphs, with numerous applications across various fields, including bioinformatics, chemistry, and the …
Link PredictionRepresentation LearningTopology Learning of Linear Dynamical Systems with Latent Nodes using Matrix Decomposition
In this article, we present a novel approach to reconstruct the topology of networked linear dynamical systems with latent nodes. The network is allowed to have directed loops and bi-directed edges. The main approach rel…
RetrievalPersistence in Financial Connectedness and Systemic Risk
This paper characterises dynamic linkages arising from shocks with heterogeneous degrees of persistence. Using frequency domain techniques, we introduce measures that identify smoothly varying links of a transitory and p…
Predicting Drug-Drug Interactions using Deep Generative Models on Graphs
Latent representations of drugs and their targets produced by contemporary graph autoencoder-based models have proved useful in predicting many types of node-pair interactions on large networks, including drug-drug, drug…
Link PredictionTowards Effective, Stealthy, and Persistent Backdoor Attacks Targeting Graph Foundation Models
Graph Foundation Models (GFMs) are pre-trained on diverse source domains and adapted to unseen targets, enabling broad generalization for graph machine learning. Despite that GFMs have attracted considerable attention re…