Triadic closure

Known as: Strong Triadic Closure 
Triadic closure is a concept in social network theory, first suggested by German sociologist Georg Simmel in his 1908 book Soziologie [Sociology… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Network embedding, which aims to learn the lowdimensional representations of vertices, is an important task and has attracted… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2018
2018
The social triad—a group of three people—is one of the simplest and most fundamental social groups. Extensive network and social… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
2015
2015
We propose a communication-driven mechanism for predicting triadic closure in complex networks. It is mathematically formulated… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
2015
2015
The triad is one of the most basic human groups in social networks. Understanding factors affecting the formation of triads will… (More)
Is this relevant?
2014
2014
A closed triad is a group of three people who are connected with each other. It is the most basic unit for studying group… (More)
  • figure 3
  • figure 1
  • figure 4
  • figure 2
  • figure 5
Is this relevant?
2014
2014
In the past few years there has been an explosion of social networks in the online world. Users flock these networks, creating… (More)
  • table 1
  • table 3
  • table 2
  • table 4
  • figure 1
Is this relevant?
2013
2013
Social networks exhibit scaling laws for several structural characteristics, such as degree distribution, scaling of the… (More)
Is this relevant?
2012
2012
We propose and analyse a class of evolving network models suitable for describing a dynamic topological structure. Applications… (More)
Is this relevant?
2011
2011
This paper inquires into structural explanations for triadic closure in networks of confidants with whom one discusses important… (More)
  • table 2
  • table 1
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
It has often been taken as a working assumption that directed links in information networks are frequently formed by “short… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?