id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_f3fuzpnijvc6nk5axrr6bsjkce	Mary E. Helander	The gravity of an edge	2018	35	.pdf	application/pdf	13793	1140	68	k-Gravity, Node centrality, Path enumeration, Social network analysis, Strength of weak A local bridge is an edge whose removal would not necessarily disconnect the network but would still be significantly disruptive to information flow. as a natural metric that can be computed algorithmically as the number of paths in a network that rely on a particular edge. We exploit these properties of k-shortest path algorithms for computing the Edge Gravity metric exactly, or finding a lower bound (called, k-Gravity) to indicate the relative Edge Gravity and its implications for structural importance of social network components the Edge Gravity Algorithm and associated methodology to four well-known social networks: two of Granovetter's examples (Granovetter 1973), the Florentine families network have found the Edge Gravity ranking while not enumerating all network paths. Fig. 17 Edge Gravity solutions for the Florentine families network, with bridges to nowhere removed, when	./cache/work_f3fuzpnijvc6nk5axrr6bsjkce.pdf	./txt/work_f3fuzpnijvc6nk5axrr6bsjkce.txt