Close communities in social networks: boroughs and 2-clubs

Laan, Steven; Marx, Maarten; Mokken, R.J.

doi:10.1007/s13278-016-0326-0

Cited by 14 publications

(7 citation statements)

References 52 publications

(28 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2-clubs, with at most 2-step communication between their nodes. As previously noted in Laan et al (2016), such personal communication is associated with closely knit groups like cliques, coteries, peer groups, primary groups and face-to-face communities, such as small villages and artist colonies.…”

Section: Conceptual Frameworkmentioning

confidence: 80%

“…The 2-clubs of a connected network are located in its disjoint boroughs (Laan et al 2016). A borough of a connected network is a maximal sub-graph with the property that each edge is on a basic cycle [triangle (C3), rectangle (C4) or pentagon (C5)] of the network and therefore also part of one or more 2-clubs of the network.…”

Section: Boroughsmentioning

confidence: 99%

“…However, recent computational theory and technology (e.g. parallel processing) have advanced sufficiently for a plethora of algorithmic workarounds and heuristic to appear in the literature (for references see Laan et al 2016). …”

Section: Detection and Analysismentioning

confidence: 99%

“…This has been called close communication (Mokken 1980(Mokken -2011Laan et al 2016) and is defined as access and communication between nodes, directly between neighbours (1st step) or through a common neighbour (2nd step). Thus, areas of close communication between boards can be defined as sub-networks where each pair of nodes (corporations) are neighbours or have at least one common neighbour.…”

Section: Introductionmentioning

confidence: 99%

“…In a previous paper Laan et al (2016) extended this framework with the concept of the disjoint boroughs of a network. These boroughs together contain all 2-clubs of a network, forming supercommunities which together envelope all close communication in the network.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Close communication and 2-clubs in corporate networks: Europe 2010

Mokken

Heemskerk

Laan

2016

Soc. Netw. Anal. Min.

View full text Add to dashboard Cite

Corporate networks, as induced by interlocking directorates between corporations, provide structures of personal communication between their boards. This paper studies such networks using the framework of a previous paper by Laan et al. (Soc Netw Anal Min, 2016. doi:10. 1007/s13278-016-0326-0) where close communication is defined by sub-networks, so that each pair of nodes (boards of a corporation) are either neighbours or have at least one common neighbour. These correspond to sub-graphs of diameter at most 2, designated by us earlier as 2-clubs of three types (coteries, social circles and hamlets), and conform three levels of close communication in social networks. They are all contained within the disjoint boroughs of a network, supercommunities which envelope all close communication between nodes of a network. This framework is applied here to an analysis of corporate board interlocks between the top 300 European corporations 2010, using the data from an earlier study by one of us (Heemskerk in Econ Soc 42:74-101, 2013). While the results corroborate the main findings of the earlier studies, our approach also uncovers additional, thus far unrevealed patterns. A single dominant European borough with the Francophone network as its centre and that of Germany only regionally and internally connected. The UK business elite on the other hand is very present and prominent in this European structure of corporate close communication.

show abstract

Section: Conceptual Frameworkmentioning

confidence: 80%

Section: Boroughsmentioning

confidence: 99%

Section: Detection and Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Close communication and 2-clubs in corporate networks: Europe 2010

Mokken

Heemskerk

Laan

2016

Soc. Netw. Anal. Min.

View full text Add to dashboard Cite

show abstract

Top k 2-Clubs in a Network: A Genetic Algorithm

Castelli

Dondi

Manzoni

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The identification of cohesive communities (dense subgraphs) is a typical task applied to the analysis of social and biological networks. Different definitions of communities have been adopted for particular occurrences. One of these, the 2-club (dense subgraphs with diameter value at most of length 2) has been revealed of interest for applications and theoretical studies. Unfortunately, the identification of 2-clubs is a computationally intractable problem, and the search of approximate solutions (at a reasonable time) is therefore fundamental in many practical areas. In this article, we present a genetic algorithm based heuristic to compute a collection of Top k 2-clubs, i.e., a set composed by the largest k 2-clubs which cover an input graph. In particular, we discuss some preliminary results for synthetic data obtained by sampling Erdös-Rényi random graphs.

show abstract

On the Tractability of Covering a Graph with 2-Clubs

Dondi

Lafond

2019

Fundamentals of Computation Theory

View full text Add to dashboard Cite

Close communities in social networks: boroughs and 2-clubs

Cited by 14 publications

References 52 publications

Close communication and 2-clubs in corporate networks: Europe 2010

Close communication and 2-clubs in corporate networks: Europe 2010

Top k 2-Clubs in a Network: A Genetic Algorithm

On the Tractability of Covering a Graph with 2-Clubs

Contact Info

Product

Resources

About