◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Yuan Zhang

21 papers hereh-index 5822.6k citations467 works total

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

author position
  • first author3
  • last author18

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

fields
  • math.PR8
  • math.CV5
  • gr-qc4
  • math.NT2
  • math.AP1
  • math.DS1
same name
  • Yuan Zhang — 27 papers, h 98
  • Yuan Zhang — 17 papers, h 3
  • Yuan Zhang — 13 papers, h 7
  • Yuan Zhang — 12 papers, h 8
  • Yuan Zhang — 12 papers, h 6
  • Yuan Zhang — 11 papers, h 2

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
20092018
most citedDestroying extremal Kerr-Newman black holes with test particles

131 citations · 255 across the 21 of their papers we have counts for

collaborators
Showing 2017 · math.PRShow all

4 papers · 2 filters

math.PR2017★ 2 cited

Stationary Harmonic Measure and DLA in the Upper half Plane

Eviatar B. Procaccia, Yuan Zhang

In this paper, we introduce the stationary harmonic measure in the upper half plane. By bounding this measure, we are able to define both the discrete and continuous time diffusion…

math.PR2017★ 5 cited

On sets of zero stationary harmonic measure

Eviatar B. Procaccia, Yuan Zhang

In this paper, we prove that any subset with an appropriate sub-linear horizontal growth has a non-zero stationary harmonic measure. On the other hand, we also show any subset with…

math.PR2017

On Covering paths with 3 Dimensional Random Walk

Eviatar B. Procaccia, Yuan Zhang

In this paper we find an upper bound for the probability that a 3 dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an…

math.PR2017

On Covering Monotonic Paths with Simple Random Walk

Eviatar B. Procaccia, Yuan Zhang

In this paper we study the probability that a d dimensional simple random walk (or the first L steps of it) covers each point in a nearest neighbor path connecting 0 and the bo…

◍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.