Estimating PageRank on graph streams

No abstract is available for this paper.

• Publication year

  2008

• Venue

  ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

• Publication date

  2008-06-09

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/1376916.1376928
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Proceedings of the forty-first annual ACM symposium on Theory of computing

  2009cited by this paper
• Trading off space for passes in graph streaming problems

  2009influential reference
• Parallelizing the Computation of PageRank

  2007cited by this paper
• Space-Efficient Sampling

  2007cited by this paper
• Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming

  2007cited by this paper
• Simpler algorithm for estimating frequency moments of data streams

  2006cited by this paper
• Estimating Entropy over Data Streams

  2006cited by this paper
• To randomize or not to randomize: space optimal summaries for hyperlink analysis

  2006cited by this paper
• Trading off space for passes in graph streaming problems

  2006cited by this paper
• Local Graph Partitioning using PageRank Vectors

  2006cited by this paper
• On the Complexity of Processing Massive, Unordered, Distributed Data

  2006cited by this paper
• Approximate quantiles and the order of the stream

  2006cited by this paper
• Counting triangles in data streams

  2006cited by this paper
• Graph distances in the streaming model: the value of space

  2005cited by this paper
• Streaming and sublinear approximation of entropy and information distances

  2005cited by this paper
• New Streaming Algorithms for Counting Triangles in Graphs

  2005cited by this paper
• Optimal approximations of the frequency moments of data streams

  2005cited by this paper
• A uniform approach to accelerated PageRank computation

  2005cited by this paper
• Space efficient mining of multigraph streams

  2005cited by this paper
• Finding Graph Matchings in Data Streams

  2005cited by this paper
• Optimal space lower bounds for all frequency moments

  2004cited by this paper
• Algorithms for dynamic geometric problems over data streams

  2004cited by this paper
• Reductions in streaming algorithms, with an application to counting triangles in graphs

  2002cited by this paper
• Space-efficient online computation of quantile summaries

  2001cited by this paper
• Testing random variables for independence and identity

  2001influential reference
• Random sampling techniques for space efficient online computation of order statistics of large datasets

  1999cited by this paper
• Computing on data streams

  1999cited by this paper
• The Anatomy of a Large-Scale Hypertextual Web Search Engine

  1998cited by this paper
• SL ⊆L4/3

  1997cited by this paper
• A Spectrum of Time-Space Trade-Offs for Undirected s-t Connectivity

  1997cited by this paper
• The space complexity of approximating the frequency moments

  1996cited by this paper
• Approximating the Permanent

  1989cited by this paper

• PageRank Centrality in Directed Graphs with Bounded In-Degree

  2025cites this paper
• Universally Optimal Streaming Algorithm for Random Walks in Dense Graphs

  2025cites this paper
• New Algorithms and Lower Bounds for Streaming Tournaments

  2024cites this paper
• Efficient Algorithms for Personalized PageRank Computation: A Survey

  2024cites this paper
• LSketch: A Label-Enabled Graph Stream Sketch Toward Time-Sensitive Queries

  2023cites this paper
• PageRank Algorithm Based on Dynamic Damping Factor

  2023cites this paper
• Arya: Arbitrary Graph Pattern Mining with Decomposition-based Sampling

  2023cites this paper
• Distributed PageRank computation with improved round complexities

  2022cites this paper
• Towards PageRank Update in a Streaming Graph by Incremental Random Walk

  2022cites this paper
• Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut

  2022cites this paper
• Space-Efficient Random Walks on Streaming Graphs

  2022cites this paper
• On the Distributed Complexity of Large-Scale Graph Computations

  2021cites this paper
• Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs

  2021cites this paper
• Efficient and Local Parallel Random Walks

  2021cites this paper
• Simulating Random Walks in Random Streams

  2021cites this paper
• Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms

  2020cites this paper
• Using an Evaluator Fixed Structure Learning Automata in Sampling of Social Networks

  2020cites this paper
• Vertex Ordering Problems in Directed Graph Streams

  2020cites this paper
• Two Player Hidden Pointer Chasing and Multi-Pass Lower Bounds in Turnstile Streams

  2020cites this paper
• Benchmarking Graph Data Management and Processing Systems: A Survey

  2020cites this paper
• M-PageRank: a Novel Centrality Measure for multilayer Networks

  2020cites this paper
• Massive Scale Streaming Graphs: Evolving Network Analysis and Mining

  2020cites this paper
• Accelerating parallel graph computing with speculation

  2019cites this paper
• Walking Randomly, Massively, and Efficiently

  2019cites this paper
• Visitor Mobility and Spatial Structure in a Local Urban Tourism Destination: GPS Tracking and Network analysis

  2019cites this paper
• Cluster-preserving sampling from fully-dynamic streaming graphs

  2019cites this paper
• Scalable Systems for Large Scale Dynamic Connected Data Processing

  2019cites this paper
• Distributed PageRank Computation: An Improved Theoretical Study

  2019influential citation
• Adaptive Shrinkage Estimation for Streaming Graphs

  2019cites this paper
• Two-Hop Walks Indicate PageRank Order

  2019cites this paper
• Walking randomly, massively, and efficiently

  2019cites this paper
• N ov 2 01 9 Walking Randomly , Massively , and Efficiently

  2019cites this paper
• A new method for graph stream summarization based on both the structure and concepts

  2019cites this paper
• Polynomial pass lower bounds for graph streaming algorithms

  2019cites this paper
• Node embeddings in dynamic graphs

  2019cites this paper
• Network Shrinkage Estimation

  2019cites this paper
• Massive Graph Analysis in the Data Stream Model

  2019cites this paper
• Deterministic Coresets for Stochastic Matrices with Applications to Scalable Sparse PageRank

  2019cites this paper
• Recent Advancements in Event Processing

  2018cites this paper
• Chapter 7 Evolving Networks and Social Network Analysis Methods and Techniques

  2018cites this paper
• Temporal walk based centrality metric for graph streams

  2018cites this paper
• 1 . 1 Model of Computation : Register Input Model [ 19 ]

  2018cites this paper
• Combinatorial Optimization On Massive Datasets: Streaming, Distributed, And Massively Parallel Computation

  2018cites this paper
• Towards Fast and Scalable Graph Pattern Mining

  2018cites this paper
• Processing of RDF Stream Data

  2018cites this paper
• Big Provenance Stream Processing for Data Intensive Computations

  2018cites this paper
• Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs

  2018cites this paper
• On graph sample clustering

  2018cites this paper
• Simulating Random Walks on Graphs in the Streaming Model

  2018cites this paper
• Incrementally updating Katz centrality in dynamic graphs

  2018cites this paper
• A streaming sampling algorithm for social activity networks using fixed structure learning automata

  2018cites this paper
• ASAP: Fast, Approximate Graph Pattern Mining at Scale

  2018cites this paper
• Memory-Efficient and Accurate Sampling for Counting Local Triangles in Graph Streams

  2018cites this paper
• Evolving Networks and Social Network Analysis Methods and Techniques

  2018cites this paper
• Relational time series forecasting

  2018cites this paper
• Nearly Optimal Space Efficient Algorithm for Depth First Search

  2018cites this paper
• Sketching as a Tool for Efficient Networked Systems

  2018cites this paper
• Numerical and streaming analyses of centrality measures on graphs

  2018cites this paper
• Distributed Real Time Link Prediction on Graph Streams

  2018cites this paper
• An Association-Oriented Partitioning Approach for Streaming Graph Query

  2017cites this paper
• Edge partitioning of large graphs

  2017cites this paper
• Fast and Flexible Top-k Similarity Search on Large Networks

  2017cites this paper
• On Sampling from Massive Graph Streams

  2017cites this paper
• Big Graph Analytics Platforms

  2017cites this paper
• Chapter 2 GRAPH DATA MANAGEMENT AND MINING: A SURVEY OF ALGORITHMS AND APPLICATIONS

  2017cites this paper
• Dynamical SimRank search on time-varying networks

  2017cites this paper
• Efficient Personalized PageRank Estimation for Many Sources and Many Targets

  2017cites this paper
• Toward query-friendly compression of rapid graph streams

  2017cites this paper
• Toward Efficient Hub-Less Real Time Personalized PageRank

  2017cites this paper
• Local Community Detection in Dynamic Graphs Using Personalized Centrality

  2017cites this paper
• Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs

  2017cites this paper
• Un partitionnement d'arêtes à base de blocs pour les algorithmes de marches aléatoires dans les grands graphes sociaux

  2017cites this paper
• An Efficient Monte Carlo Approach to Compute PageRank for Large Graphs on a Single PC

  2016cites this paper
• Big Data analytics in static and streaming provenance

  2016cites this paper
• Temporal PageRank

  2016cites this paper
• On the Distributed Complexity of Large-Scale Graph Computations

  2016cites this paper
• CASQD: continuous detection of activity-based subgraph pattern queries on dynamic graphs

  2016cites this paper
• Link prediction in graph streams

  2016cites this paper
• Graph-based Analysis of Dynamic Systems

  2016cites this paper
• Tight Bounds for Distributed Graph Computations

  2016cites this paper
• Tornado: A System For Real-Time Iterative Analysis Over Evolving Data

  2016cites this paper
• A Block-Based Edge Partitioning for Random Walks Algorithms over Large Social Graphs

  2016cites this paper
• Centrality measures for immunization of weighted networks

  2016cites this paper
• Random Walks in the Edge Sampling Model

  2016influential citation
• Shortest Paths on Evolving Graphs

  2016cites this paper
• Resource Efficiency to Partition Big Streamed Graphs

  2015cites this paper
• Actes de la conférence BDA 2015 : Gestion de données - principes, technologies et applications

  2015cites this paper
• Efficient PageRank Tracking in Evolving Networks

  2015cites this paper
• Tracking the Conductance of Rapidly Evolving Topic-Subgraphs

  2015cites this paper
• Streaming data analytics for anomalies in graphs

  2015cites this paper
• FrogWild! - Fast PageRank Approximations on Graph Engines

  2015cites this paper
• Efficient random walk sampling in distributed networks

  2015cites this paper
• FrogWild!

  2015cites this paper
• Active exploration for large graphs

  2015cites this paper
• Scalable Approaches for Recommendation in Social Networks

  2015cites this paper
• Scaling Up Network Analysis and Mining: Statistical Sampling, Estimation, and Pattern Discovery

  2015cites this paper
• Resource Efficiency to Partition Big Streamed Graphs

  2015cites this paper
• MASCOT: Memory-efficient and Accurate Sampling for Counting Local Triangles in Graph Streams

  2015cites this paper
• Parameterized Streaming: Maximal Matching and Vertex Cover

  2015cites this paper
• Scalable anomaly detection in graphs

  2015cites this paper