◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Zhewei Wei

7 papers hereh-index 5110 citations8 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author5

Across the 7 of 7 papers where every author was matched, so the position is known.

fields
  • cs.DS6
  • cs.MA1
same name
  • Zhewei Wei — 38 papers, h 32
  • Zhewei Wei — 11 papers, h 5
  • Zhewei Wei — 9 papers, h 5
  • Zhewei Wei — 6 papers, h 3
  • Zhewei Wei — 5 papers, h 4
  • Zhewei Wei — 4 papers, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20242026
most citedEfficient Algorithms for Personalized PageRank Computation: A Survey

47 citations · 52 across the 7 of their papers we have counts for

collaborators
Showing 2024Show all

4 papers · 1 filter

cs.MA2024★ 1 cited

Very Large-Scale Multi-Agent Simulation in AgentScope

Xuchen Pan, Dawei Gao, Yuexiang Xie +6

Recent advances in large language models (LLMs) have opened new avenues for applying multi-agent systems in very large-scale simulations. However, there remain several challenges w…

cs.DS2024★ 3 cited

Revisiting Local Computation of PageRank: Simple and Optimal

Hanzhi Wang, Zhewei Wei, Ji-Rong Wen +1

We revisit the classic local graph exploration algorithm ApproxContributions proposed by Andersen, Borgs, Chayes, Hopcroft, Mirrokni, and Teng (WAW '07, Internet Math. '08) for com…

cs.DS2024★ 47 cited

Efficient Algorithms for Personalized PageRank Computation: A Survey

Mingji Yang, Hanzhi Wang, Zhewei Wei +2

Personalized PageRank (PPR) is a traditional measure for node proximity on large graphs. For a pair of nodes s and t, the PPR value πs​(t) equals the probability that an α-…

cs.DS2024★ 1 cited

Approximating Single-Source Personalized PageRank with Absolute Error Guarantees

Zhewei Wei, Ji-Rong Wen, Mingji Yang

Personalized PageRank (PPR) is an extensively studied and applied node proximity measure in graphs. For a pair of nodes s and t on a graph G=(V,E), the PPR value π(s,t) is…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.