9 citations · 12 across the 3 of their papers we have counts for
3 papers
cs.SI2012
A Dynamical System for PageRank with Time-Dependent Teleportation
David F. Gleich, Ryan A. Rossi
We propose a dynamical system that captures changes to the network centrality of nodes as external interest in those nodes vary. We derive this system by adding time-dependent tele…
cs.SI2012★ 9 cited
What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks
Ryan A. Rossi, David F. Gleich, Assefaw H. Gebremedhin +1
Exact maximum clique finders have progressed to the point where we can investigate cliques in million-node social and information networks, as well as find strongly connected compo…
stat.ML2011★ 3 cited
Moment based estimation of stochastic Kronecker graph parameters
David F. Gleich, Art B. Owen
Stochastic Kronecker graphs supply a parsimonious model for large sparse real world graphs. They can specify the distribution of a large random graph using only three or four param…