18.1k citations
- University of California, Santa BarbaraUS314 papers
- Microsoft Research (United Kingdom)GB248 papers
- Massachusetts Institute of TechnologyUS170 papers
- University of California, BerkeleyUS170 papers
- University of WashingtonUS165 papers
- Stanford UniversityUS156 papers
- Carnegie Mellon UniversityUS149 papers
- ETH ZurichCH131 papers
- Princeton UniversityUS119 papers
- University of Maryland, College ParkUS108 papers
- California Institute of TechnologyUS107 papers
- Cornell UniversityUS98 papers
Showing 2000 · math.PRShow all
2 papers · 2 filters
math.PR2000★ 5 cited
Analyticity of intersection exponents for planar Brownian motion
Gregory F. Lawler, Oded Schramm, Wendelin Werner
We show that the intersection exponents for planar Brownian motions are analytic. More precisely, let and be independent planar Brownian motions started from distinct poin…
math.PR2000
On the cover time of planar graphs
Johan Jonasson, Oded Schramm
The cover time of a finite connected graph is the expected number of steps needed for a simple random walk on the graph to visit all the vertices. It is known that the cover time o…