Fetching the paper…
Reading the bibliography…
Digital presence in the world of online social media entails significant privacy risks.
A new status index derived from sociometric analysis
L. Katz · 1953
Earlier work this paper cites.
Confidence limits on phylogenies: an approach using the bootstrap
J. Felsenstein · 1985
Earlier work this paper cites.
A fast algorithm for constructing trees from distance matrices
J. C. Culberson and P. Rudnicki · 1989
Earlier work this paper cites.
An algorithm for tree-realizability of distance matrices
V. Batagelj, T. Pisanski, and J. M. S. S. os Pereira · 1990
Earlier work this paper cites.
Resistance distance
D. J. Klein and M. Randić · 1993
Earlier work this paper cites.
The electrical resistance of a graph captures its commute and cover times
A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, and P. Tiwari · 1996
Earlier work this paper cites.
Inferring tree models for oncogenesis from comparative genome hybridization data
R. Desper, F. Jiang, O.-P. Kallioniemi, H. Moch, C. H. Papadimitriou, and A. A. Schäffer · 1999
Earlier work this paper cites.
The web as a graph: measurements, models, and methods
J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins · 1999
Earlier work this paper cites.
The PageRank citation ranking: Bringing order to the web
L. Page, S. Brin, R. Motwani, and T. Winograd · 1999
Earlier work this paper cites.
Simrank: a measure of structural-context similarity
G. Jeh and J. Widom · 2002
Earlier work this paper cites.
Friends and neighbors on the web
L. A. Adamic and E. Adar · 2003
Earlier work this paper cites.
Topic-sensitive PageRank: A context-sensitive ranking algorithm for web search
T. H. Haveliwala · 2003
Earlier work this paper cites.
Scaling personalized web search
G. Jeh and J. Widom · 2003
Earlier work this paper cites.
A measure of similarity between graph vertices: Applications to synonym extraction and web searching
V. D. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P. Van Dooren · 2004
Earlier work this paper cites.
Fastest mixing Markov chain on a graph
S. Boyd, P. Diaconis, and L. Xiao · 2004
Earlier work this paper cites.
Network tomography: Recent developments
R. Castro, M. Coates, G. Liang, R. Nowak, and B. Yu · 2004
Earlier work this paper cites.
The principal components analysis of a graph, and its relationships to spectral clustering
M. Saerens, F. Fouss, L. Yen, and P. Dupont · 2004
Earlier work this paper cites.
The case for anomalous link discovery
M. J. Rattigan and D. Jensen · 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.
Random walks for image segmentation
L. Grady · 2006
Earlier work this paper cites.
The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem
J. Sun, S. Boyd, L. Xiao, and P. Diaconis · 2006
Cited alongside, same era.
Fast random walk with restart and its applications
H. Tong, C. Faloutsos, and J.-Y. Pan · 2006
Cited alongside, same era.
Wherefore art thou?: Anonymized social networks, hidden patterns, and structural steganography
L. Backstrom, C. Dwork, and J. Kleinberg · 2007
Cited alongside, same era.
Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation
F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens · 2007
Cited alongside, same era.
The link-prediction problem for social networks
D. Liben-Nowell and J. Kleinberg · 2007
Cited alongside, same era.
On the longest path algorithm for reconstructing trees from distance matrices
A survey of link prediction in social networks
M. Al Hasan and M. J. Zaki · 2011
Later among the works it cites.
Estimating sizes of social networks via biased sampling
L. Katzir, E. Liberty, and O. Somekh · 2011
Later among the works it cites.
Graph sparsification by effective resistances
D. A. Spielman and N. Srivastava · 2011
Later among the works it cites.
Learning to discover social circles in ego networks
J. Leskovec and J. J. Mcauley · 2012
Later among the works it cites.
Trees and distances
D. A. Spielman · 2012
Later among the works it cites.
Privacy in social networks
E. Zheleva, E. Terzi, and L. Getoor · 2012
Later among the works it cites.
Graph reconstruction via distance oracles
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. Reyzin and N. Srivastava · 2007
Cited alongside, same era.
A tractable approach to finding closest truncated-commute-time neighbors in large graphs
P. Sarkar and A. Moore · 2007
Cited alongside, same era.
Graph nodes clustering based on the commute-time kernel
L. Yen, F. Fouss, C. Decaestecker, P. Francq, and M. Saerens · 2007
Cited alongside, same era.
Learning a hidden graph using o ( l o g n ) o(logn) queries per edge
D. Angluin and J. Chen · 2008
Cited alongside, same era.
Minimizing effective resistance of a graph
A. Ghosh, S. Boyd, and A. Saberi · 2008
Cited alongside, same era.
Link privacy in social networks
A. Korolova, R. Motwani, S. U. Nabar, and Y. Xu · 2008
Cited alongside, same era.
Class-based graph anonymization for social network data
S. Bhagat, G. Cormode, B. Krishnamurthy, and D. Srivastava · 2009
Cited alongside, same era.
C. Mathieu and H. Zhou · 2013
Later among the works it cites.
Private link prediction in social networks
R. Abebe and V. Nakos · 2014
Later among the works it cites.
Estimating network parameters using random walks
C. Cooper, T. Radzik, and Y. Siantos · 2014
Later among the works it cites.
CVX: Matlab software for disciplined convex programming, version 2.1
M. Grant and S. Boyd · 2014
Later among the works it cites.
An efficient reconciliation algorithm for social networks
N. Korula and S. Lattanzi · 2014
Later among the works it cites.
SNAP Datasets: Stanford large network dataset collection
J. Leskovec and A. Krevl · 2014
Later among the works it cites.
DeepWalk: Online learning of social representations
B. Perozzi, R. Al-Rfou, and S. Skiena · 2014
Later among the works it cites.
Hitting and commute times in large random neighborhood graphs
U. Von Luxburg, A. Radl, and M. Hein · 2014
Later among the works it cites.
Near-linear query complexity for graph inference
S. Kannan, C. Mathieu, and H. Zhou · 2015
Later among the works it cites.
How to learn a graph from smooth signals
V. Kalofolias · 2016
Later among the works it cites.
The MOSEK Optimization Suite
MOSEK ApS · 2017
Later among the works it cites.
Predicting positive and negative links with noisy queries: Theory & practice
C. E. Tsourakakis, M. Mitzenmacher, J. Błasiok, B. Lawson, P. Nakkiran, and V. Nakos · 2017
Later among the works it cites.
Estimating graph parameters via random walks with restarts
A. Ben-Hamou, R. I. Oliveira, and Y. Peres · 2018
Closest in time.