Pfaltz, J.L. A Set-Theoretic Approach to Modeling Network Structure. Algorithms2021, 14, 153.
Pfaltz, J.L. A Set-Theoretic Approach to Modeling Network Structure. Algorithms 2021, 14, 153.
Three computer algorithms are presented. One reduces a network $\CALN$ to its interior, $\CALI$. Another counts all the triangles in the network, and the last randomly generates networks similar to $\CALN$ given just its interior $\CALI$. But these algorithms are not the usual numeric programs that manipulate a matrix representation of the network; they are set-based. Union and meet are essential binary operators; contained_in is the basic relational comparator. The interior $\CALI$ is shown to have desirable formal properties and to provide an effective way of revealing ``communities'' in social networks.
MATHEMATICS & COMPUTER SCIENCE, Algebra & Number Theory
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.