Guest
The talk “Growing scale-free simplices“ by Karin Alfaro-Bittner on the Moscow Conference on Combinatorics and Applications at MIPT. Annotation: Pairwise interactions have had a principal role in the understanding of real-world networks and in the establishment of generative models that recover their observed macroscopic patterns. However, pairwise interactions provide limited insight into higher-order structures. Simplicial complexes can represent these high-order interactions. In this talk, I will discuss a model to grow simplicial complexes of order two, i.e., nodes, links, and triangles, using preferential and/or non-preferential attachment mechanisms. The proposed model always yields a power-law scaling in P(k), recovering the observed scale-free property and allows full control over the generalized degree distribution. The full schedule of the conference -
