Generalized Blockmodeling with Pajek

Abstract One goal of blockmodeling is to reduce a large, potentially incoherent network to a smaller comprehensible structure that can be interpreted more readily. Batagelj, Doreian, and Ferligoj developed a generalized approach to blockmodeling and methods where a set of observed relations are fitted to a pre-specified blockmodel. In the paper this generalized blockmodeling approach as implemented in program Pajek is described. An overview of the blockmodeling procedures in Pajek is given and is illustrated by some examples

Animating the development of Social Networks over time using a dynamic extension of multidimensional scaling

The animation of network visualizations poses technical and theoretical challenges. Rather stable patterns are required before the mental map enables a user to make inferences over time. In order to enhance stability, we developed an extension of stress-minimization with developments over time. This dynamic layouter is no longer based on linear interpolation between independent static visualizations, but change over time is used as a parameter in the optimization. Because of our focus on structural change versus stability the attention is shifted from the relational graph to the latent eigenvectors of matrices. The approach is illustrated with animations for the journal citation environments of Social Networks, the (co-)author networks in the carrying community of this journal, and the topical development using relations among its title words. Our results are also compared with animations based on PajekToSVGAnim and SoNIA

The stability of co-authorship structures

This article examines the structure of co-authorship networks\u27 stability in time. The goal of the article is to analyse differences in the stability and size of groups of researchers that co-author with each other (core research groups) formed in disciplines from the natural and technical sciences on one hand and the social sciences and humanities on the other. The cores were obtained by a pre-specified blockmodeling procedure assuming a multi-core-semi-periphery-periphery structure. The stability of the obtained cores was measured with the Modified Adjusted Rand Index. The assumed structure was confirmed in all analysed disciplines. The average size of the cores obtained is higher in the second time period and the average core size is greater in the natural and technical sciences than in the social sciences and humanities. There are no differences in average core stability between the natural and technical sciences and the social sciences and humanities. However, if the stability of cores is defined by the splitting of cores and not also by the percentage of researchers who left the cores, the average stability of the cores is higher in disciplines from the scientific fields of Engineering sciences and technologies and Medical sciences than in disciplines of the Humanities, if controlling for the networks\u27 and disciplines\u27 characteristics. The analysis was performed on disciplinary co-authorship networks of Slovenian researchers in two time periods (1991-2000 and 2001-2010)

Clustering and Community Detection in Directed Networks: A Survey

Networks (or graphs) appear as dominant structures in diverse domains, including sociology, biology, neuroscience and computer science. In most of the aforementioned cases graphs are directed - in the sense that there is directionality on the edges, making the semantics of the edges non symmetric. An interesting feature that real networks present is the clustering or community structure property, under which the graph topology is organized into modules commonly called communities or clusters. The essence here is that nodes of the same community are highly similar while on the contrary, nodes across communities present low similarity. Revealing the underlying community structure of directed complex networks has become a crucial and interdisciplinary topic with a plethora of applications. Therefore, naturally there is a recent wealth of research production in the area of mining directed graphs - with clustering being the primary method and tool for community detection and evaluation. The goal of this paper is to offer an in-depth review of the methods presented so far for clustering directed networks along with the relevant necessary methodological background and also related applications. The survey commences by offering a concise review of the fundamental concepts and methodological base on which graph clustering algorithms capitalize on. Then we present the relevant work along two orthogonal classifications. The first one is mostly concerned with the methodological principles of the clustering algorithms, while the second one approaches the methods from the viewpoint regarding the properties of a good cluster in a directed network. Further, we present methods and metrics for evaluating graph clustering results, demonstrate interesting application domains and provide promising future research directions.Comment: 86 pages, 17 figures. Physics Reports Journal (To Appear

Mining complex trees for hidden fruit : a graph–based computational solution to detect latent criminal networks : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Information Technology at Massey University, Albany, New Zealand.

The detection of crime is a complex and difficult endeavour. Public and private organisations – focusing on law enforcement, intelligence, and compliance – commonly apply the rational isolated actor approach premised on observability and materiality. This is manifested largely as conducting entity-level risk management sourcing ‘leads’ from reactive covert human intelligence sources and/or proactive sources by applying simple rules-based models. Focusing on discrete observable and material actors simply ignores that criminal activity exists within a complex system deriving its fundamental structural fabric from the complex interactions between actors - with those most unobservable likely to be both criminally proficient and influential. The graph-based computational solution developed to detect latent criminal networks is a response to the inadequacy of the rational isolated actor approach that ignores the connectedness and complexity of criminality. The core computational solution, written in the R language, consists of novel entity resolution, link discovery, and knowledge discovery technology. Entity resolution enables the fusion of multiple datasets with high accuracy (mean F-measure of 0.986 versus competitors 0.872), generating a graph-based expressive view of the problem. Link discovery is comprised of link prediction and link inference, enabling the high-performance detection (accuracy of ~0.8 versus relevant published models ~0.45) of unobserved relationships such as identity fraud. Knowledge discovery uses the fused graph generated and applies the “GraphExtract” algorithm to create a set of subgraphs representing latent functional criminal groups, and a mesoscopic graph representing how this set of criminal groups are interconnected. Latent knowledge is generated from a range of metrics including the “Super-broker” metric and attitude prediction. The computational solution has been evaluated on a range of datasets that mimic an applied setting, demonstrating a scalable (tested on ~18 million node graphs) and performant (~33 hours runtime on a non-distributed platform) solution that successfully detects relevant latent functional criminal groups in around 90% of cases sampled and enables the contextual understanding of the broader criminal system through the mesoscopic graph and associated metadata. The augmented data assets generated provide a multi-perspective systems view of criminal activity that enable advanced informed decision making across the microscopic mesoscopic macroscopic spectrum

Flow-Based Network Analysis of the Caenorhabditis elegans Connectome

We exploit flow propagation on the directed neuronal network of the nematode C. elegans to reveal dynamically relevant features of its connectome. We find flow-based groupings of neurons at different levels of granularity, which we relate to functional and anatomical constituents of its nervous system. A systematic in silico evaluation of the full set of single and double neuron ablations is used to identify deletions that induce the most severe disruptions of the multi-resolution flow structure. Such ablations are linked to functionally relevant neurons, and suggest potential candidates for further in vivo investigation. In addition, we use the directional patterns of incoming and outgoing network flows at all scales to identify flow profiles for the neurons in the connectome, without pre-imposing a priori categories. The four flow roles identified are linked to signal propagation motivated by biological input-response scenarios

Collaboration Among Human Service Nonprofit Organizations: Mapping Formal and Informal Networks of Exchange

Much of the current debates in the social service delivery have focused on the blurring boundaries between three sectors - the nonprofit, business and public sector. Surprisingly no empirical research has been given to this phenomenon from macro and comparative perspectives. First contribution of the study to is the conceptual and methodological model to link organization and strategic management theory with network theory. The study calls this new framework as collaboration network. Second, this survey of 33 nonprofit organizations in the Allegheny County, Pittsburgh, Pennsylvania uncovers the hidden patterns of collaboration between the sectors including empirical evidence of blurring boundaries. In order to reveal the hidden patterns of collaboration, the study adopts blockmodel from network analysis that is useful to reduce complex networks into concise and easily understandable forms. Major findings uncovered by network analysis are; 1) Network structures are different according to specific types of collaboration relationships. Network structures become less dense as the collaborative relationships intensify. While nonprofits do not have to spend much of their valuable resources such as time and money on maintaining informal or infrequent information sharing or work referral relations, nonprofits should commit themselves to maintaining intensive relations such as formal contract or joint program. In addition, the types of six network structures are different from each other. For example, while formal contract network is shaped as a cohesive subgroup structure, resource sharing network shows a central-periphery system. 2) When three sector organizations are participated in the work referral network, the social service system emerges. Three sectors play a unique role respectively - a sender for public agencies, a service provider for businesses. As a major actor in the social service field, nonprofits not only play these two roles, but also play a coordinating or broker role between three sectors. 3) When either of the business or public sector is introduced in the collaboration network, new network structures replace the network structure which is composed exclusively of nonprofits. For example, when the public sector is involved in the formal contract network, the network structure changes from a cohesive subgroup system to a hierarchy system