Fetching the paper…
Reading the bibliography…
As relational datasets modeled as graphs keep increasing in size and their data-acquisition is permeated by uncertainty, graph-based analysis techniques can become computationally and conceptually challenging.
C. Davis and W. M. Kahan, “The rotation of eigenvectors by a perturbation,” SIAM Journal on Numerical Analysis , vol. 7, no. 1, pp. 1–46, 1970
1970
Earlier work this paper cites.
L. C. Freeman, “A set of measures of centrality based on betweenness,” Sociometry , pp. 35–41, 1977
1977
Earlier work this paper cites.
——, “Centrality in social networks conceptual clarification,” Social Networks , vol. 1, no. 3, pp. 215–239, 1978
1978
Earlier work this paper cites.
D. N. Hoover, “Relations on probability spaces and arrays of random variables,” Preprint, Institute for Advanced Study, Princeton, NJ , vol. 2, 1979
1979
Earlier work this paper cites.
D. J. Aldous, “Representations for partially exchangeable arrays of random variables,” Journal of Multivariate Analysis , vol. 11, no. 4, pp. 581–598, 1981
1981
Earlier work this paper cites.
P. W. Holland, K. B. Laskey, and S. Leinhardt, “Stochastic blockmodels: First steps,” Social Networks , vol. 5, no. 2, pp. 109–137, 1983
1983
Earlier work this paper cites.
K. Deimling, Nonlinear Functional Analysis . Dover publications, 1985
1985
Earlier work this paper cites.
L. Devroye, Non-Uniform Random Variate Generation . Springer-Verlag, New York, 1986
1986
Earlier work this paper cites.
P. Bonacich, “Power and centrality: A family of measures,” American journal of sociology , vol. 92, no. 5, pp. 1170–1182, 1987
1987
Earlier work this paper cites.
N. E. Friedkin, “Theoretical foundations for centrality measures,” American Journal of Sociology , vol. 96, no. 6, pp. 1478–1504, 1991
1991
Earlier work this paper cites.
T. A. Snijders and K. Nowicki, “Estimation and prediction for stochastic blockmodels for graphs with latent block structure,” Journal of Classification , vol. 14, no. 1, pp. 75–100, 1997
1997
Earlier work this paper cites.
J. B. Conway, A Course In Functional Analysis . Springer Science & Business Media, 1997, vol. 96
1997
Earlier work this paper cites.
J. Kleinberg, “Authoritative sources in a hyperlinked environment,” J. ACM , vol. 46, no. 5, pp. 604–632, Sep. 1999
1999
Earlier work this paper cites.
L. Page, S. Brin, R. Motwani, and T. Winograd, “The pagerank citation ranking: Bringing order to the web.” Stanford InfoLab, Technical Report 1999-66, November 1999
1999
Earlier work this paper cites.
R. M. Dudley, Real Analysis and Probability . Cambridge University Press, 2002, vol. 74
2002
Earlier work this paper cites.
D. Bu, Y. Zhao, L. Cai, H. Xue, X. Zhu, H. Lu, J. Zhang, S. Sun, L. Ling, and N. Zhang, “Topological structure analysis of the protein–protein interaction network in budding yeast,” Nucleic acids research , vol. 31, no. 9, pp. 2443–2450, 2003
2003
Earlier work this paper cites.
D. Kempe, J. Kleinberg, and E. Tardos, “Maximizing the spread of influence through a social network,” in Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD) , 2003, pp. 137–146
2003
Earlier work this paper cites.
E. Costenbader and T. W. Valente, “The stability of centrality measures when networks are sampled,” Social Networks , vol. 25, no. 4, pp. 283–307, 2003
2003
Earlier work this paper cites.
S. P. Borgatti and M. G. Everett, “A graph-theoretic perspective on centrality,” Social Networks , vol. 28, no. 4, pp. 466–484, 2006
2006
Earlier work this paper cites.
S. P. Borgatti, K. M. Carley, and D. Krackhardt, “On the robustness of centrality measures under conditions of imperfect data,” Social Networks , vol. 28, no. 2, pp. 124–136, 2006
2006
Earlier work this paper cites.
L. Lovász and B. Szegedy, “Limits of dense graph sequences,” Journal of Combinatorial Theory, Series B , vol. 96, no. 6, pp. 933–957, 2006
2006
Earlier work this paper cites.
C. Kemp, J. B. Tenenbaum, T. L. Griffiths, T. Yamada, and N. Ueda, “Learning systems of concepts with an infinite relational model,” in Proceedings of the National Conference on Artificial Intelligence (AAAI) , 2006, pp. 381–388
2006
Earlier work this paper cites.
S. J. Young and E. R. Scheinerman, “Random dot product graph models for social networks,” in International Workshop on Algorithms and Models for the Web-Graph . Springer, 2007, pp. 138–149
2007
Earlier work this paper cites.
2007
Cited alongside, same era.
C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi, “Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing,” Advances in Mathematics , vol. 219, no. 6, pp. 1801–1851, 2008
2008
Cited alongside, same era.
P. J. Bickel and A. Chen, “A nonparametric view of network models and Newman–Girvan and other modularities,” Proceedings of the National Academy of Sciences , vol. 106, no. 50, pp. 21 068–21 073, 2009
2009
Cited alongside, same era.
K. Atkinson and W. Han, Theoretical Numerical Analysis: A Functional Analysis Framework . Springer, 2009, vol. 39
2009
Cited alongside, same era.
D. F. Gleich, “Pagerank beyond the web,” SIAM Review , vol. 57, no. 3, pp. 321–363, 2015
2015
Later among the works it cites.
M. Benzi and C. Klymko, “On the limiting behavior of parameter-dependent network centrality measures,” SIAM Journal on Matrix Analysis and Applications , vol. 36, no. 2, pp. 686–706, 2015
2015
Later among the works it cites.
P. Orbanz and D. M. Roy, “Bayesian models of graphs, arrays and other exchangeable random structures,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 37, no. 2, pp. 437–461, 2015
2015
Later among the works it cites.
L. Lovász and B. Szegedy, “The automorphism group of a graphon,” Journal of Algebra , vol. 421, pp. 136–166, 2015
2015
Later among the works it cites.
C. Borgs, J. Chayes, and A. Smith, “Private graphon estimation for sparse graphs,” in Advances in Neural Information Processing Systems , 2015, pp. 1369–1377
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
K. Lerman, R. Ghosh, and J. H. Kang, “Centrality metric for dynamic networks,” in Proceedings of the Workshop on Mining and Learning with Graphs (MLG) , 2010, pp. 70–77
2010
Cited alongside, same era.
A. Goldenberg, A. X. Zheng, S. E. Fienberg, E. M. Airoldi et al. , “A survey of statistical network models,” Foundations and Trends in Machine Learning , vol. 2, no. 2, pp. 129–233, 2010
2010
Cited alongside, same era.
C. Borgs, J. Chayes, and L. Lovász, “Moments of two-variable functions and the uniqueness of graph limits,” Geometric And Functional Analysis , vol. 19, no. 6, pp. 1597–1619, 2010
2010
Cited alongside, same era.
R. K. Pan and J. Saramäki, “Path lengths, correlations, and centrality in temporal networks,” Physical Review E , vol. 84, no. 1, p. 016105, 2011
2011
Cited alongside, same era.
P. J. Bickel, A. Chen, and E. Levina, “The method of moments and degree distributions for network models,” The Annals of Statistics , vol. 39, no. 5, pp. 2280–2301, 2011
2011
Cited alongside, same era.
P. H. Bezandry and T. Diagana, Almost Periodic Stochastic Processes . Springer Science & Business Media, 2011
2011
Cited alongside, same era.
B. Szegedy, “Limits of kernel operators and the spectral regularity lemma,” European Journal of Combinatorics , vol. 32, no. 7, pp. 1156–1167, 2011
2011
Cited alongside, same era.
2015
Later among the works it cites.
2015
Later among the works it cites.
C. Gao, Y. Lu, and H. H. Zhou, “Rate-optimal graphon estimation,” The Annals of Statistics , vol. 43, no. 6, pp. 2624–2652, 2015
2015
Later among the works it cites.
S. Segarra and A. Ribeiro, “Stability and continuity of centrality measures in weighted graphs,” IEEE Transactions on Signal Processing , vol. 64, no. 3, pp. 543–555, Feb 2016
2016
Later among the works it cites.
C. Gao, Y. Lu, Z. Ma, and H. Zhou, “Optimal estimation and completion of matrices with biclustering structures,” The Journal of Machine Learning Research , vol. 17, no. 1, pp. 5602–5630, 2016
2016
Later among the works it cites.
P. Latouche and S. Robin, “Variational Bayes model averaging for graphon functions and motif frequencies inference in W-graph models,” Statistics and Computing , vol. 26, no. 6, pp. 1173–1185, Nov 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
H. Crane, “Dynamic random networks and their graph limits,” The Annals of Applied Probability , vol. 26, no. 2, pp. 691–721, 2016
2016
Later among the works it cites.
M. Pensky, “Dynamic network models and graphon estimation,” arXiv preprint arXiv:1607.00673 , 2016
2016
Later among the works it cites.
K. Dasaratha, “Distributions of centrality on networks,” arXiv preprint arXiv:1709.10402 , 2017
2017
Closest in time.
2017
Closest in time.
M. W. Morency and G. Leus, “Signal processing on kernel-based random graphs,” in Proceedings of the European Signal Processing Conference (EUSIPCO), Kos island, Greece , 2017
2017
Closest in time.
2017
Closest in time.
S. Gao and P. E. Caines, “The control of arbitrary size networks of linear systems via graphon limits: An initial investigation,” in 2017 IEEE 56th Annual Conference on Decision and Control (CDC) , Dec 2017, pp. 1052–1057
2017
Closest in time.
Y. Zhang, E. Levina, and J. Zhu, “Estimating network edge probabilities by neighbourhood smoothing,” Biometrika , vol. 104, no. 4, pp. 771–783, 2017
2017
Closest in time.
O. Klopp, A. Tsybakov, and N. Verzelen, “Oracle inequalities for network models and sparse graphon estimation,” The Annals of Statistics , vol. 45, no. 1, pp. 316–354, 2017
2017
Closest in time.
2018
Closest in time.