10 citations · 10 across the 2 of their papers we have counts for
2 papers
cs.DS2023
Efficiently matching random inhomogeneous graphs via degree profiles
Jian Ding, Yumou Fei, Yuanzheng Wang
In this paper, we study the problem of recovering the latent vertex correspondence between two correlated random graphs with vastly inhomogeneous and unknown edge probabilities bet…
cs.GT2010★ 10 cited
The Hitchhiker's Guide to Affiliation Networks: A Game-Theoretic Approach
Christian Borgs, Jennifer Chayes, Jian Ding +1
We propose a new class of game-theoretic models for network formation in which strategies are not directly related to edge choices, but instead correspond more generally to the exe…