Predicting triadic closure in networks using communicability distance functions (Q2943520)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6478240
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Predicting triadic closure in networks using communicability distance functions |
scientific article; zbMATH DE number 6478240 |
Statements
Predicting Triadic Closure in Networks Using Communicability Distance Functions (English)
0 references
3 September 2015
0 references
network analysis
0 references
triangles
0 references
triadic closure
0 references
communicability distance
0 references
adjacency matrix
0 references
matrix functions
0 references
0 references
0.711358904838562
0 references
0.705363392829895
0 references
0.705222487449646
0 references
0.6911315321922302
0 references
0.6873318552970886
0 references
