Fetching the paper…
Reading the bibliography…
The heat kernel is a particular type of graph diffusion that, like the much-used personalized PageRank diffusion, is useful in identifying a community nearby a starting seed node.
A new status index derived from sociometric analysis
L. Katz · 1953
Earlier work this paper cites.
A novel method of evaluating transient response
M. Liou · 1966
Earlier work this paper cites.
Algebraic connectivity of graphs
M. Fiedler · 1973
Earlier work this paper cites.
Nineteen dubious ways to compute the exponential of a matrix
C. Moler and C. Van Loan · 1978
Earlier work this paper cites.
λ 1 \lambda_{1} , isoperimetric inequalities for graphs, and superconcentrators
N. Alon and V. D. Milman · 1985
Earlier work this paper cites.
On the convergence of the coordinate descent method for convex differentiable minimization
Z. Q. Luo and P. Tseng · 1992
Earlier work this paper cites.
Characterization of 3d molecular structure
E. Estrada · 2000
Earlier work this paper cites.
The structure of scientific collaboration networks
M. E. J. Newman · 2001
Earlier work this paper cites.
Marvel universe looks almost like a real social network
R. Alberich, J. Miro-Julia, and F. Rosselló · 2002
Earlier work this paper cites.
Diffusion kernels on graphs and other discrete input spaces
R. I. Kondor and J. D. Lafferty · 2002
Earlier work this paper cites.
Scaling personalized web search
G. Jeh and J. Widom · 2003
Earlier work this paper cites.
Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later
C. Moler and C. Van Loan · 2003
Earlier work this paper cites.
Models of social networks based on social distance attachment
M. Boguñá, R. Pastor-Satorras, A. Díaz-Guilera, and A. Arenas · 2004
Earlier work this paper cites.
A uniform approach to accelerated PageRank computation
F. McSherry · 2005
Earlier work this paper cites.
Norges teknisk-naturvitenskapelige universitet
B. V. Minchev and W. M. Wright · 2005
Earlier work this paper cites.
Network datasets
C. (The Cooperative Association for Internet Data Analyais) · 2005
Earlier work this paper cites.
Local graph partitioning using PageRank vectors
R. Andersen, F. Chung, and K. Lang · 2006
Earlier work this paper cites.
Authority rankings from HITS, PageRank, and SALSA: Existence, uniqueness, and effect of initialization
A. Farahat, T. LoFaro, J. C. Miller, G. Rae, and L. A. Ward · 2006
Earlier work this paper cites.
Network datasets
M. Newman · 2006
Earlier work this paper cites.
Modularity and community structure in networks
M. E. J. Newman · 2006
Cited alongside, same era.
Monte carlo methods in pagerank computation: When one iteration is sufficient
K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova · 2007
Cited alongside, same era.
The heat kernel as the PageRank of a graph
F. Chung · 2007
Cited alongside, same era.
Weighted graph cuts without eigenvectors a multilevel approach
I. S. Dhillon, Y. Guan, and B. Kulis · 2007
Cited alongside, same era.
Graph evolution: Densification and shrinking diameters
J. Leskovec, J. Kleinberg, and C. Faloutsos · 2007
Cited alongside, same era.
Measurement and analysis of online social networks
A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee · 2007
Cited alongside, same era.
Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks
P. Boldi, M. Rosa, M. Santini, and S. Vigna · 2011
Later among the works it cites.
Beyond ‘caveman communities’: Hubs and spokes for graph compression and mining
U. Kang and C. Faloutsos · 2011
Later among the works it cites.
Implementing regularization implicitly via approximate eigenvector computation
L. Orecchia and M. W. Mahoney · 2011
Later among the works it cites.
On the separability of structural classes of communities
B. Abrahao, S. Soundarajan, J. Hopcroft, and R. Kleinberg · 2012
Later among the works it cites.
Fast matrix computations for pairwise and columnwise commute times and Katz scores
F. Bonchi, P. Esfandiar, D. F. Gleich, C. Greif, and L. V. Lakshmanan · 2012
Later among the works it cites.
Approximating the exponential, the Lanczos method and an Otilde(m)-time spectral algorithm for balanced separator
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Graph clustering
S. E. Schaeffer · 2007
Cited alongside, same era.
An algorithm for improving graph partitions
R. Andersen and K. Lang · 2008
Cited alongside, same era.
Functions of Matrices: Theory and Computation
N. J. Higham · 2008
Cited alongside, same era.
A local graph partitioning algorithm using heat kernel pagerank
F. Chung · 2009
Cited alongside, same era.
Learning spectral graph transformations for link prediction
J. Kunegis and A. Lommatzsch · 2009
Cited alongside, same era.
Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters
J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney · 2009
Cited alongside, same era.
L. Orecchia, S. Sachdeva, and N. K. Vishnoi · 2012
Later among the works it cites.
Defining and evaluating network communities based on ground-truth
J. Yang and J. Leskovec · 2012
Later among the works it cites.
Multi-scale matrix sampling and sublinear-time pagerank computation
C. Borgs, M. Brautbar, J. Chayes, and S.-H. Teng · 2013
Later among the works it cites.
Solving linear systems with boundary conditions using heat kernel pagerank
F. Chung and O. Simpson · 2013
Later among the works it cites.
A fast relaxation method for computing a column of the matrix exponential of stochastic matrices from large, sparse networks
K. Kloster and D. F. Gleich · 2013
Later among the works it cites.
A nearly-sublinear method for approximating a column of the matrix exponential for matrices from large, sparse networks
K. Kloster and D. F. Gleich · 2013
Later among the works it cites.
Parallel clustered low-rank approximation of graphs and its application to link prediction
X. Sui, T.-H. Lee, J. Whang, B. Savas, S. Jain, K. Pingali, and I. Dhillon · 2013
Later among the works it cites.
Programming with personalized pagerank: A locally groundable first-order probabilistic logic
W. Y. Wang, K. Mazaitis, and W. W. Cohen · 2013
Later among the works it cites.
Overlapping community detection using seed set expansion
J. J. Whang, D. F. Gleich, and I. S. Dhillon · 2013
Later among the works it cites.
A local algorithm for finding well-connected clusters
Z. A. Zhu, S. Lattanzi, and V. Mirrokni · 2013
Later among the works it cites.
Heat kernel based community detection
K. Kloster and D. F. Gleich · 2014
Closest in time.
Flow-based algorithms for local graph clustering
L. Orecchia and Z. A. Zhu · 2014
Closest in time.
Graph diffusions and matrix functions: Fast algorithms and localization results
K. Kloster · 2016
Closest in time.