Generalized Path Analysis for Social Networks
Optimize All Generalized Path Values
Optimize All Probabilistic Path Values
Binary Distance of a Network Path
Find the shortest L-Inf norm paths to other vertices
Find the shortest paths to other vertices
Yang and Knoke's Average Path Length
Flament's Path Length Measure
Generate a Proximity Matrix
Generalized Path Value
sconduct: Generalized Path Analysis for Social Networks
Optimize Generalized Path Value
Optimize Probabilistic Path Value
Yang and Knoke's Average Path Value
Peay's Path Value Measure
Calculate probabilistic path value
Unpacks a Path from a Dijkstra-Format Spanning Tree
The social network literature features numerous methods for assigning value to paths as a function of their ties. 'gretel' systemizes these approaches, casting them as instances of a generalized path value function indexed by a penalty parameter. The package also calculates probabilistic path value and identifies optimal paths in either value framework. Finally, proximity matrices can be generated in these frameworks that capture high-order connections overlooked in primitive adjacency sociomatrices. Novel methods are described in Buch (2019) <https://davidbuch.github.io/analyzing-networks-with-gretel.html>. More traditional methods are also implemented, as described in Yang, Knoke (2001) <doi:10.1016/S0378-8733(01)00043-0>.