Fingerprint
Dive into the research topics where Asaf Nachmias is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Every recurrent network has a potential tending to infinity
Nachmias, A. & Peres, Y., 2025, In: Comptes Rendus Mathematique. 363, p. 793-798 6 p.Research output: Contribution to journal › Article › peer-review
Open Access -
The GHP Scaling Limit of Uniform Spanning Trees in High Dimensions
Archer, E., Nachmias, A. & Shalev, M., Mar 2024, In: Communications in Mathematical Physics. 405, 3, 73.Research output: Contribution to journal › Article › peer-review
Open Access2 Scopus citations -
The union of independent USFs on ℤd is transient
Archer, E., Nachmias, A., Shalev, M. & Tang, P., 2024, In: Electronic Communications in Probability. 29, p. 1-8 8 p., 38.Research output: Contribution to journal › Article › peer-review
Open Access -
THE WIRED MINIMAL SPANNING FOREST ON THE POISSON-WEIGHTED INFINITE TREE
Nachmias, A. & Tang, P., Apr 2024, In: Annals of Applied Probability. 34, 2, p. 2415-2446 32 p.Research output: Contribution to journal › Article › peer-review
1 Scopus citations -
The diameter of the uniform spanning tree of dense graphs
Alon, N., Nachmias, A. & Shalev, M., Nov 2022, In: Combinatorics Probability and Computing. 31, 6, p. 1010-1030 21 p.Research output: Contribution to journal › Article › peer-review
2 Scopus citations