arXiv subjects

Yichen Feng

Publications and source records attributed to Yichen Feng.

22 records · Page 2Linked to original sources

arXiv2022

Systemic Risk Models for Disjoint and Overlapping Groups with Equilibrium Strategies

We analyze the systemic risk for disjoint and overlapping groups (e.g., central clearing counterparties (CCP)) by proposing new models with realistic game features. Specifically, we generalize the systemic risk measure proposed in [F. Biagini, J.-P. Fouque, M. Frittelli, and T. Meyer-Brandis, Finance and Stochastics, 24(2020), 513--564] by allowing individual banks to choose their preferred groups instead of being assigned to certain groups. We introduce the concept of Nash equilibrium for these new models, and analyze the optimal solution under Gaussian distribution of the risk factor. We also provide an explicit solution for the risk allocation of the individual banks, and study the existence and uniqueness of Nash equilibrium both theoretically and numerically. The developed numerical algorithm can simulate scenarios of equilibrium, and we apply it to study the bank-CCP structure with real data and show the validity of the proposed model.

q-fin.MF↗

arXiv2020

Linear-Quadratic Stochastic Differential Games on Random Directed Networks

The study of linear-quadratic stochastic differential games on directed networks was initiated in Feng, Fouque \& Ichiba \cite{fengFouqueIchiba2020linearquadratic}. In that work, the game on a directed chain with finite or infinite players was defined as well as the game on a deterministic directed tree, and their Nash equilibria were computed. The current work continues the analysis by first developing a random directed chain structure by assuming the interaction between every two neighbors is random. We solve explicitly for an open-loop Nash equilibrium for the system and we find that the dynamics under equilibrium is an infinite-dimensional Gaussian process described by a Catalan Markov chain introduced in \cite{fengFouqueIchiba2020linearquadratic}. The discussion about stochastic differential games is extended to a random two-sided directed chain and a random directed tree structure.

math.PR↗

arXiv2020

Linear-Quadratic Stochastic Differential Games on Directed Chain Networks

We study linear-quadratic stochastic differential games on directed chains inspired by the directed chain stochastic differential equations introduced by Detering, Fouque, and Ichiba. We solve explicitly for Nash equilibria with a finite number of players and we study more general finite-player games with a mixture of both directed chain interaction and mean field interaction. We investigate and compare the corresponding games in the limit when the number of players tends to infinity. The limit is characterized by Catalan functions and the dynamics under equilibrium is an infinite-dimensional Gaussian process described by a Catalan Markov chain, with or without the presence of mean field interaction.

math.PR↗

arXiv2019

Meta-Graph Based HIN Spectral Embedding: Methods, Analyses, and Insights

In this work, we propose to study the utility of different meta-graphs, as well as how to simultaneously leverage multiple meta-graphs for HIN embedding in an unsupervised manner. Motivated by prolific research on homogeneous networks, especially spectral graph theory, we firstly conduct a systematic empirical study on the spectrum and embedding quality of different meta-graphs on multiple HINs, which leads to an efficient method of meta-graph assessment. It also helps us to gain valuable insight into the higher-order organization of HINs and indicates a practical way of selecting useful embedding dimensions. Further, we explore the challenges of combining multiple meta-graphs to capture the multi-dimensional semantics in HIN through reasoning from mathematical geometry and arrive at an embedding compression method of autoencoder with $\ell_{2,1}$-loss, which finds the most informative meta-graphs and embeddings in an end-to-end unsupervised manner. Finally, empirical analysis suggests a unified workflow to close the gap between our meta-graph assessment and combination methods. To the best of our knowledge, this is the first research effort to provide rich theoretical and empirical analyses on the utility of meta-graphs and their combinations, especially regarding HIN embedding. Extensive experimental comparisons with various state-of-the-art neural network based embedding methods on multiple real-world HINs demonstrate the effectiveness and efficiency of our framework in finding useful meta-graphs and generating high-quality HIN embeddings.

cs.LG↗