The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such clusters, or communities, can be considered as fairly independent compartments of a graph, playing a similar role like, e. g., the tissues or the organs in the human body. Detecting communities is of great importance in sociology, biology and computer science, disciplines where systems are often represented as graphs. This problem is very hard and not yet satisfactorily solved, despite the huge effort of a large interdisciplinary community of scientists working on it over the past few years. We will attempt a thorough exposition of the topic, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.

/pdf/community-detection-in-graphs-34rogm3r6p.pdf

Community detection in graphs

/pdf/introduction-to-social-network-methods-36g7099hce.pdf

Introduction to Social Network Methods

Complex networks arise in a wide range of biological and sociotechnical systems. Epidemic spreading is central to our understanding of dynamical processes in complex networks, and is of interest to physicists, mathematicians, epidemiologists, and computer and social scientists. This review presents the main results and paradigmatic models in infectious disease modeling and generalized social contagion processes.

Epidemic processes in complex networks

Spreading of information, ideas or diseases can be conveniently modelled in the context of complex networks. An analysis now reveals that the most efficient spreaders are not always necessarily the most connected agents in a network. Instead, the position of an agent relative to the hierarchical topological organization of the network might be as important as its connectivity.

/pdf/identification-of-influential-spreaders-in-complex-networks-4zv30jmeio.pdf

Identification of influential spreaders in complex networks

Network structure and minimum degree

For at least twenty‐five years, the concept of the clique has had a prominent place in sociometric and other kinds of sociological research. Recently, with the advent of large, fast computers and with the growth of interest in graph‐theoretic social network studies, research on the definition and investigation of the graph theoretic properties of clique‐like structures has grown. In the present paper, several of these formulations are examined, and their mathematical properties analyzed. A family of new clique‐like structures is proposed which captures an aspect of cliques which is seldom treated in the existing literature. The new structures, when used to complement existing concepts, provide a new means of tapping several important properties of social networks.

A graph‐theoretic generalization of the clique concept*

Three decades of active research on the teaching of introductory programming has had limited effect on classroom practice. Although relevant research exists across several disciplines including education and cognitive science, disciplinary differences have made this material inaccessible to many computing educators. Furthermore, computer science instructors have not had access to a comprehensive survey of research in this area. This paper collects and classifies this literature, identifies important work and mediates it to computing educators and professional bodies.We identify research that gives well-supported advice to computing academics teaching introductory programming. Limitations and areas of incomplete coverage of existing research efforts are also identified. The analysis applies publication and research quality metrics developed by a previous ITiCSE working group [74].

A survey of literature on the teaching of introductory programming

Previous studies dealing with the notion of brand congruence suffer from questionable methods of group determination, suspect demonstrations of brand congruence effects, and inadequate attention paid to types of social relation. To overcome these shortcomings, the present study uses graph-theoretic social network techniques to examine interpersonal relationships and brand choice behavior in natural environments. The brand choices of individuals in a social relationship were compared to those of unrelated individuals across various products, types of social relation, and types of basic sociological structure (dyad, clique, and 2-plex). While significant brand congruence effects were obtained, they were clustered in a few products mediated by types of social relation. Conspicuousness of the product, as traditionally defined, was found to be insufficient to account for these findings.

https://www.jstor.org/stable/info/2489067

Stephen B. Seidman

Papers

Network structure and minimum degree

A graph‐theoretic generalization of the clique concept*

A survey of literature on the teaching of introductory programming

Brand Congruence in Interpersonal Relations: A Social Network Analysis

The hull number of a graph