Strength of Connections in a Random Graph: Definition, Characterization, and Estimation
arXiv:1412.1530
Abstract
How can the `affinity' or `strength' of ties of a random graph be characterized and compactly represented? How can concepts like Fourier and inverse-Fourier like transform be developed for graph data? To do so, we introduce a new graph-theoretic function called `Graph Correlation Density Field' (or in short GraField), which differs from the traditional edge probability density-based approaches, to completely characterize tie-strength between graph nodes. Our approach further allows frequency domain analysis, applicable for both directed and undirected random graphs.
arXiv comment18 pages, 6 Figures. Third version
References in corpus (6)
- Finding community structure in networks using the eigenvectors of matrices
- Matrix estimation by Universal Singular Value Thresholding
- Network histograms and universality of blockmodel approximation
- Stochastic blockmodel approximation of a graphon: Theory and consistent estimation
- LP Approach to Statistical Modeling
- United Statistical Algorithm, Small and Big Data: Future OF Statistician