Abstract
The investigation of social networks is often hindered by their size as such networks often consist of at least thousands of vertices and edges. Hence, it is of major interest to derive compact structures that represent important connections of the original network. In this work, we derive such structures with orometric methods that are originally designed to identify outstanding mountain peaks and relationships between them. By adapting these methods to social networks, it is possible to derive family trees of important vertices. Our approach consists of two steps. We first apply a novel method for discarding edges that stand for weak connections. This is done such that the connectivity of the network is preserved. Then, we identify the important “peaks” in the network and the “key cols”, i.e., the lower points that connect them. This gives us a compact network that displays which peaks are connected through which cols. Thus, a natural hierarchy on the peaks arises by the question which higher peak comes behind the col, yielding to chains of peaks with increasing heights. The resulting “line parent hierarchy” displays dominance relations between important vertices. We show that networks with hundreds or thousands of edges can be condensed to a small set of vertices and key connections between them.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
This is assumed for simplicity. The following foundations can be applied to unconnected graphs by studying every connected component for itself.
- 3.
To simplify notations, our definition of cols allow only one col per path which differs from the definition in geography,.
- 4.
- 5.
We use \(1 - w(e)\) instead of w(e) because we assume edge weights to be distances, not similarities.
References
Agarwal, P.K., Matousek, J.: Relative neighborhood graphs in three dimensions. In: Annual Symposium on Discrete Algorithms (1992)
Ammar, W., et al.: Construction of the literature graph in semantic scholar. In: NAACL (2018)
Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: WWW (2011)
Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: WWW (2004)
Clauset, A., Moore, C., Newman, M.E.: Hierarchical structure and the prediction of missing links in networks. Nature 453, 98–101 (2008)
Gupte, M., Shankar, P., Li, J., Muthukrishnan, S., Iftode, L.: Finding hierarchy in directed online social networks. In: WWW (2011)
Jaromczyk, J.W., Kowaluk, M.: A note on relative neighborhood graphs. In: Annual Symposium on Computational Geometry, Waterloo (1987)
Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proc. IEEE 80, 1502–1517 (1992)
Karatzoglou, A.: Applying topographic features for identifying speed patterns using the example of critical driving. In: ACM SIGSPATIAL International Workshop on Computational Transportation Science (2020)
Krishnamurthy, V., Sun, J., Faloutsos, M., Tauro, S.L.: Sampling internet topologies: how small can we go? In: International Conference on Internet Computing (2003)
Kwak, H., Lee, C., Park, H., Moon, S.B.: What is twitter, a social network or a news media? In: WWW (2010)
Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: KDD (2006)
Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014). http://snap.stanford.edu/data
Li, F., Zou, Z., Li, J., Li, Y.: Graph compression with stars. In: Yang, Q., Zhou, Z.-H., Gong, Z., Zhang, M.-L., Huang, S.-J. (eds.) PAKDD 2019. LNCS (LNAI), vol. 11440, pp. 449–461. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-16145-3_35
Li, R., Yu, J.X., Qin, L., Mao, R., Jin, T.: On random walk based graph sampling. In: IEEE International Conference on Data Engineering (2015)
Li, Y., et al.: Walking with perception: efficient random walk sampling via common neighbor awareness. In: IEEE International Conference on Data Engineering (2019)
Lu, C., Yu, J.X., Li, R., Wei, H.: Exploring hierarchies in online social networks. IEEE Trans. Knowl. Data Eng. 28, 2086–2100 (2016)
Maiya, A.S., Berger-Wolf, T.Y.: Inferring the maximum likelihood hierarchy in social networks. In: IEEE International Conference on Computational Science and Engineering (2009)
Nelson, G.D., McKeon, R.: Peaks of people: using topographic prominence as a method for determining the ranked significance of population centers. Prof. Geogr. 71, 342–354 (2019)
Pavlík, J.: Topographic spaces over ordered monoids. Math. Appl. 4, 31–59 (2015)
Rafiei, D., Curial, S.: Effectively visualizing large networks through sampling. In: IEEE Visualization Conference (2005)
Royer, L., Reimann, M., Andreopoulos, B., Schroeder, M.: Unraveling protein networks with power graph analysis. PLoS Comput. Biol. 4, e1000108 (2008)
Schmidt, A., Stumme, G.: Prominence and dominance in networks. In: Faron Zucker, C., Ghidini, C., Napoli, A., Toussaint, Y. (eds.) EKAW 2018. LNCS (LNAI), vol. 11313, pp. 370–385. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-03667-6_24
Stubbemann, M., Hanika, T., Stumme, G.: Orometric methods in bounded metric data. In: IDA (2020)
Toivonen, H., Zhou, F., Hartikainen, A., Hinkka, A.: Compression of weighted graphs. In: KDD (2011)
Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recognit. 12, 261–268 (1980)
Acknowledgment
This work is partially funded by the German Federal Ministry of Education and Research (BMBF) under grant 01PU17012A.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Stubbemann, M., Stumme, G. (2023). The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks. In: Koutra, D., Plant, C., Gomez Rodriguez, M., Baralis, E., Bonchi, F. (eds) Machine Learning and Knowledge Discovery in Databases: Research Track. ECML PKDD 2023. Lecture Notes in Computer Science(), vol 14171. Springer, Cham. https://doi.org/10.1007/978-3-031-43418-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-031-43418-1_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-43417-4
Online ISBN: 978-3-031-43418-1
eBook Packages: Computer ScienceComputer Science (R0)