ISSN 1944-9488
Articles in Vol. 10, Issue 1, 2013
Vol. 10, Issue 1, 2013
- Some Properties of Random Apollonian NetworksCharalampos E. TsourakakisAlan Frieze
- Some Typical Properties of the Spatial Preferred Attachment ModelColin CooperPaweł PrałatAlan Frieze
- Quick Detection of Nodes with Large DegreesNelly LitvakMarina SokolDon TowsleyKonstantin Avrachenkov
- Ranking and Sparsifying a Connection GraphFan ChungWenbo ZhaoMark Kempton
- Multiscale Matrix Sampling and Sublinear-Time PageRank ComputationChristian BorgsShang-Hua TengJennifer ChayesMichael Brautbar
- A Dynamical System for PageRank with Time-Dependent TeleportationDavid F. GleichRyan A. Rossi
- A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree SequenceTomasz RadzikYiannis SiantosColin Cooper
- Multicommodity Allocation for Dynamic Demands Using PageRank VectorsJacob HughesPaul HornFan Chung
- Hypergraph Coloring Games and Voter ModelsAlexander TsiatasFan Chung
Chung, Fan, Wenbo Zhao, and Mark Kempton. 2014. “Ranking and Sparsifying a Connection Graph.” Internet Mathematics 10 (1). https://doi.org/10.1080/15427951.2013.800005.
