Name
Abstract | ||
|---|---|---|
Network statistics such as node degree distributions, average path lengths, diameters, or clustering coefficients are widely used to characterize networks. One statistic that received considerable attention is the distance distribution — the number of pairs of nodes for each shortest-path distance — in undirected networks. It captures important properties of the network, reflecting on the dynamics of network spreading processes, and incorporates parameters such as node centrality and (effective) diameter. So far, however, no parameterization of the distance distribution is known that applies to a large class of networks. Here we develop such a closed-form distribution by applying maximum entropy arguments to derive a general, physically plausible model of path length histograms. Based on the model, we then establish the generalized Gamma as a three-parameter distribution for shortest-path distance in strongly-connected, undirected networks. Extensive experiments corroborate our theoretical results, which thus provide new approaches to network analysis. |
Year | Venue | Field |
|---|---|---|
2015 | UAI | Discrete mathematics,Histogram,Topology,Mathematical optimization,Parametrization,Path length,Computer science,Centrality,Degree distribution,Principle of maximum entropy,Network analysis,Cluster analysis |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
14 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christian Bauckhage | 1 | 1979 | 195.86 |
| Kristian Kersting | 2 | 1932 | 154.03 |
| Fabian Hadiji | 3 | 99 | 8.45 |