SpaceBook A Case Study of Social Network Analysis in Adjacency Graphs
نویسندگان
چکیده
In this paper, we have adopted methods from Social Network Analysis in order to analyze adjacency graphs. Our intent was to uncover as much hidden structures as possible so as to improve adjacency requirements before they are used further on during the design process. To that end, we have conducted a case study using two readily available software packages (Gephi, Pajek), concluding that these could benefit from being more transparent about the underlying algorithms and more geared towards the problem domain 'adjacency analysis' when it comes to data entry and visualization. As a matter of fact, we produced an open-source prototype called SpaceBook, which customizes computation and visualization in the aforementioned spirit.
منابع مشابه
Sparse random graphs: regularization and concentration of the Laplacian
We study random graphs with possibly different edge probabilities in the challenging sparse regime of bounded expected degrees. Unlike in the dense case, neither the graph adjacency matrix nor its Laplacian concentrate around their expectations due to the highly irregular distribution of node degrees. It has been empirically observed that simply adding a constant of order 1/n to each entry of t...
متن کاملfinding influential individual in Social Network graphs using CSCS algorithm and shapley value in game theory
In recent years, the social networks analysis gains great deal of attention. Social networks have various applications in different areas namely predicting disease epidemic, search engines and viral advertisements. A key property of social networks is that interpersonal relationships can influence the decisions that they make. Finding the most influential nodes is important in social networks b...
متن کاملComparative analysis of organizational processes by the use of the social network concepts
This study presents a comparative analysis of redesigned models of organizational processes by making use of social network concepts. After doing re-engineering of organizational processes which had been conducted in the headquarters of Mazandaran Province Education Department, different methods were used which included the alpha algorithm, alpha⁺, genetics and heuristics. Every one of these me...
متن کاملModeling Social Networks with Overlapping Communities Using Hypergraphs and Their Line Graphs
We propose that hypergraphs can be used to model social networks with overlapping communities. The nodes of the hypergraphs represent the communities. The hyperlinks of the hypergraphs denote the individuals who may participate in multiple communities. The hypergraphs are not easy to analyze, however, the line graphs of hypergraphs are simple graphs or weighted graphs, so that the network theor...
متن کاملTypicality Matching for Pairs of Correlated Graphs
In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network deanonymization, study of biological data, web graphs, etc. An achievable region for successful matching is derived by analyzing a new matching algorithm that we r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016