Predicting affinity ties in a surname network
Not on the map. Why?
Abstract (arXiv)
From administrative registers of last names in Santiago, Chile, we create a surname affinity network that encodes socioeconomic data. This network is a multi-relational graph with nodes representing surnames and edges representing the prevalence of interactions between surnames by socioeconomic decile. We model the prediction of links as a knowledge base completion problem, and find that sharing neighbors is highly predictive of the formation of new links. Importantly, We distinguish between grounded neighbors and neighbors in the embedding space, and find that the latter is more predictive of tie formation. The paper discusses the implications of this finding in explaining the high levels of elite endogamy in Santiago.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 9 of its 29 references that are in the map. First posted on arXiv 2 Jun 2023.
Builds on
9 of 29 references.
References · 9
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2014Embedding Entities and Relations for Learning and Inference in Knowledge Basescited by 932
- 2016Complex Embeddings for Simple Link Predictioncited by 902
- 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 898
- 2017Convolutional 2D Knowledge Graph Embeddingscited by 730
- 2019TuckER: Tensor Factorization for Knowledge Graph Completioncited by 290
- 2018End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completioncited by 136
- 2019Interaction Embeddings for Prediction and Explanation in Knowledge Graphscited by 40
- 2023Surname affinity in Santiago, Chile: A network-based approach that uncovers urban segregationcited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.