Optimal connections: Strength and distance in valued graphs

Song Yang, David Knoke

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

We identify some issues in measuring the strongest path connecting pairs of actors that arise in attempts to generalize binary graph concepts to valued graphs. Neither Peay's path value nor Flament's path length indicators take into account the costs of interacting via long chains of intermediaries. We proposed two alternative measures of optimal connections between dyads, respectively, dividing each measure by the distance between a pair (number of lines in a path). We illustrate these average path value (APV) and average path length (APL) measures with a hypothetical five-actor valued graph, observing instances where an indirect path may yield a stronger connection than a direct path. Computer programs to calculate these measures out to three steps for small graphs are available on request.

Original languageEnglish (US)
Pages (from-to)285-295
Number of pages11
JournalSocial Networks
Volume23
Issue number4
DOIs
StatePublished - Oct 2001

Fingerprint

Software
Costs and Cost Analysis
data processing program
dyad
Values
costs

Keywords

  • Average path length
  • Average path value
  • C6 mathematical methods
  • Path distance
  • Path strength
  • Programming
  • Valued graph

Cite this

Optimal connections : Strength and distance in valued graphs. / Yang, Song; Knoke, David.

In: Social Networks, Vol. 23, No. 4, 10.2001, p. 285-295.

Research output: Contribution to journalArticle

@article{aa22fe71beb842dab290f39711d678c9,
title = "Optimal connections: Strength and distance in valued graphs",
abstract = "We identify some issues in measuring the strongest path connecting pairs of actors that arise in attempts to generalize binary graph concepts to valued graphs. Neither Peay's path value nor Flament's path length indicators take into account the costs of interacting via long chains of intermediaries. We proposed two alternative measures of optimal connections between dyads, respectively, dividing each measure by the distance between a pair (number of lines in a path). We illustrate these average path value (APV) and average path length (APL) measures with a hypothetical five-actor valued graph, observing instances where an indirect path may yield a stronger connection than a direct path. Computer programs to calculate these measures out to three steps for small graphs are available on request.",
keywords = "Average path length, Average path value, C6 mathematical methods, Path distance, Path strength, Programming, Valued graph",
author = "Song Yang and David Knoke",
year = "2001",
month = "10",
doi = "10.1016/S0378-8733(01)00043-0",
language = "English (US)",
volume = "23",
pages = "285--295",
journal = "Social Networks",
issn = "0378-8733",
publisher = "Elsevier BV",
number = "4",

}

TY - JOUR

T1 - Optimal connections

T2 - Strength and distance in valued graphs

AU - Yang, Song

AU - Knoke, David

PY - 2001/10

Y1 - 2001/10

N2 - We identify some issues in measuring the strongest path connecting pairs of actors that arise in attempts to generalize binary graph concepts to valued graphs. Neither Peay's path value nor Flament's path length indicators take into account the costs of interacting via long chains of intermediaries. We proposed two alternative measures of optimal connections between dyads, respectively, dividing each measure by the distance between a pair (number of lines in a path). We illustrate these average path value (APV) and average path length (APL) measures with a hypothetical five-actor valued graph, observing instances where an indirect path may yield a stronger connection than a direct path. Computer programs to calculate these measures out to three steps for small graphs are available on request.

AB - We identify some issues in measuring the strongest path connecting pairs of actors that arise in attempts to generalize binary graph concepts to valued graphs. Neither Peay's path value nor Flament's path length indicators take into account the costs of interacting via long chains of intermediaries. We proposed two alternative measures of optimal connections between dyads, respectively, dividing each measure by the distance between a pair (number of lines in a path). We illustrate these average path value (APV) and average path length (APL) measures with a hypothetical five-actor valued graph, observing instances where an indirect path may yield a stronger connection than a direct path. Computer programs to calculate these measures out to three steps for small graphs are available on request.

KW - Average path length

KW - Average path value

KW - C6 mathematical methods

KW - Path distance

KW - Path strength

KW - Programming

KW - Valued graph

UR - http://www.scopus.com/inward/record.url?scp=0041334013&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0041334013&partnerID=8YFLogxK

U2 - 10.1016/S0378-8733(01)00043-0

DO - 10.1016/S0378-8733(01)00043-0

M3 - Article

AN - SCOPUS:0041334013

VL - 23

SP - 285

EP - 295

JO - Social Networks

JF - Social Networks

SN - 0378-8733

IS - 4

ER -