OPTIMAL CONNECTIONS: STRENGTH AND DISTANCE IN VALUED GRAPHS. Yang, Song and David Knoke RESEARCH QUESTION: How to identify optimal connections, that is, direct or indirect paths between dyads that permit the highest exchange volumes while taking into account the actors’ costs of interaction?.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
How to determine the path value/optimal connection when multiple paths/path values present between two nodes.
How to account for the transaction costs of exchanges involving many go-betweens.
C52 = 5!/3!*2!=10, which is the maximum number of dyad relationships for 10 actors.