Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2019
DOI: 10.1145/3341161.3342926
|View full text |Cite
|
Sign up to set email alerts
|

Quantifying triadic closure in multi-edge social networks

Abstract: Multi-edge networks capture repeated interactions between individuals. In social networks, such edges often form closed triangles, or triads. Standard approaches to measure this triadic closure, however, fail for multi-edge networks, because they do not consider that triads can be formed by edges of different multiplicity. We propose a novel measure of triadic closure for multi-edge networks of social interactions based on a shared partner statistic. We demonstrate that our operalization is able to detect mean… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1
1
1

Relationship

3
4

Authors

Journals

citations
Cited by 12 publications
(12 citation statements)
references
References 29 publications
0
12
0
Order By: Relevance
“…To compare online and o ine political support among MPs, we use a gHypEG regression model (Casiraghi, 2017;Brandenberger et al, 2019). This is an inferential network model that allows for unbiased estimates of parameters when the independence assumption is violated (Casiraghi et al, 2016(Casiraghi et al, , 2017Casiraghi, 2019).…”
Section: /26mentioning
confidence: 99%
See 1 more Smart Citation
“…To compare online and o ine political support among MPs, we use a gHypEG regression model (Casiraghi, 2017;Brandenberger et al, 2019). This is an inferential network model that allows for unbiased estimates of parameters when the independence assumption is violated (Casiraghi et al, 2016(Casiraghi et al, , 2017Casiraghi, 2019).…”
Section: /26mentioning
confidence: 99%
“…where refers to each of shared partners MP and have. Since there are multiple edges between pairs, we take the minimum between and to ensure that only closed triads are counted (see Brandenberger et al, 2019).…”
Section: Control Variablesmentioning
confidence: 99%
“…To illustrate this, we employ the gHypEG (generalized hypergeometric ensemble of random graphs) [9,12] to model multi-edge network data. The gHypEG allows the encoding of di erent types of hypotheses in a model, from simple ones like block structures [8] to more complex ones, akin to statistical regression models [5,7]. Such models can then be used to evaluate di erent hypotheses about the data [4].…”
Section: Overviewmentioning
confidence: 99%
“…Alternatively, we can specify Ω Ω Ω to encode endogenous network properties. E.g., Ω Ω Ω can be utilized to encode triadic closure [5], to verify whether pairs whose interactions will close triads in the network are more likely than others. Finally, di erent e ects contributing to the odds of observing some interactions instead of others can be composed together to formulate more complex hypotheses [7].…”
Section: Encoding Hypothesesmentioning
confidence: 99%
“…Evidence of triadic closure in primates has been reported by Borgeaud et al (2016) in three groups of vervet monkeys, finding that two individuals are more likely to be associated if they are both linked with a mutual third party associate. The notion of triadic closure is however limited to binary associations (a link is either present or not) and does not consider that links can be weighted or of different types (see however Brandenberger et al (2019) for a recent extension to multi-edge social networks).…”
Section: Introductionmentioning
confidence: 99%