◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jiaoyang Huang

48 papers hereh-index 211.3k citations61 works total

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

author position
  • sole author11
  • first author14
  • middle author9
  • last author14

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

fields
  • math.PR34
  • cs.LG4
  • math.NA3
  • stat.ML3
  • math.CO2
  • math.CV1
same name
  • Jiaoyang Huang — 13 papers, h 6
  • Jiaoyang Huang — 5 papers, h 5
  • Jiaoyang Huang — 2 papers, h 1
  • Jiaoyang Huang — 2 papers, h 2
  • Jiaoyang Huang — 2 papers, h 2
  • Jiaoyang Huang — 1 paper, h 1

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
20132026
most citedBulk universality of sparse random matrices

69 citations · 455 across the 44 of their papers we have counts for

collaborators
Showing 2018 · math.PRShow all

4 papers · 2 filters

math.PR2018

Dyson Brownian Motion for General β and Potential at the Edge

Arka Adhikari, Jiaoyang Huang

In this paper, we compare the solutions of Dyson Brownian motion with general β and potential V and the associated McKean-Vlasov equation near the edge. Under suitable conditio…

math.PR2018★ 4 cited

Law of Large Numbers and Central Limit Theorems by Jack Generating Functions

Jiaoyang Huang

In a series of papers [22-24] by Bufetov and Gorin, Schur generating functions as the Fourier transforms on the unitary group U(N), are introduced to study the asymptotic behavio…

math.PR2018★ 15 cited

Invertibility of adjacency matrices for random d-regular graphs

Jiaoyang Huang

Let d≥3 be a fixed integer and A be the adjacency matrix of a random d-regular directed or undirected graph on n vertices. We show there exist constants d>0…

math.PR2018★ 7 cited

Invertibility of adjacency matrices for random d-regular directed graphs

Jiaoyang Huang

Let d≥3 be a fixed integer, and a prime number p such that gcd(p,d)=1. Let A be the adjacency matrix of a random d-regular directed graph on n vertices. We show th…

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