Weighted and Directed Graph Approaches

Abstract

It is interesting to look at the types of social networks that are directed or weighted, or social networks with the combination of both. In many cases, the relationship between vertices may be quantifiable (weighted) or asymmetrical (directed). In this chapter, the authors first introduce the concept of weighted social networks and present an anonymization algorithm for these networks called the anonymity generalization algorithm. After that, they discuss k-anonymous path privacy and introduce the MSP algorithm. Next, the authors introduce the (k1, k2)-shortest path privacy and a (k1, k2)-shortest path privacy algorithm. Then they introduce directed weighted social networks and present the k-multiple paths anonymization on PV+NV (KMPPN). Also, the authors present a technique to convert directed networks into undirected networks. Finally, the authors present the linear property preserving anonymization approach for social networks.