Asaf Nachmias

From MaRDI portal
Person:398732

Available identifiers

zbMath Open nachmias.asafWikidataQ102353182 ScholiaQ102353182MaRDI QIDQ398732

List of research outcomes





PublicationDate of PublicationType
The union of independent USFs on \(\mathbb{Z}^d\) is transient2024-10-09Paper
The wired minimal spanning forest on the Poisson-weighted infinite tree2024-08-21Paper
The GHP scaling limit of uniform spanning trees in high dimensions2024-03-26Paper
The union of independent USFs on $\mathbb{Z}^d$ is transient2023-11-15Paper
The diameter of the uniform spanning tree of dense graphs2023-03-31Paper
The local limit of uniform spanning trees2022-04-21Paper
The diameter of uniform spanning trees in high dimensions2021-03-30Paper
Geometric and spectral properties of causal maps2020-12-17Paper
The Dirichlet problem for orthodiagonal maps2020-10-08Paper
Slightly subcritical hypercube percolation2020-06-19Paper
Planar Maps, Random Walks and Circle Packing2019-09-17Paper
UNIFORM SPANNING FORESTS OF PLANAR GRAPHS2019-09-17Paper
Hyperbolic and parabolic unimodular random maps2019-09-11Paper
A combinatorial criterion for macroscopic circles in planar triangulations2019-06-04Paper
Planar maps, random walks and circle packing2018-12-28Paper
Indistinguishability of trees in uniform spanning forests2017-06-22Paper
Hypercube percolation2017-04-05Paper
Recurrence of multiply-ended planar triangulations2017-02-07Paper
Unimodular hyperbolic triangulations: circle packing and random walk2016-12-23Paper
Random walks on stochastic hyperbolic half planar triangulations2016-09-15Paper
Boundaries of planar graphs, via circle packings2016-07-14Paper
A power law of order 1/4 for critical mean field Swendsen-Wang dynamics2014-10-17Paper
Non-amenable Cayley graphs of high girth have \(p_c < p_u\) and mean-field exponents2014-09-24Paper
Electrical resistance of the low dimensional critical branching random walk2014-08-15Paper
Rate of convergence for Cardy's formula2014-07-01Paper
Unlacing hypercube percolation: a survey2014-03-24Paper
Nonconcentration of return times2013-05-24Paper
Recurrence of planar graph limits2013-04-23Paper
Unlacing the lace expansion: a survey to hypercube percolation2012-10-30Paper
A note about critical percolation on finite graphs2012-02-13Paper
Is the critical percolation probability local?2011-09-27Paper
The Evolution of the Cover Time2011-05-11Paper
Arm exponents in high dimensional percolation2011-04-04Paper
Critical percolation on random regular graphs2010-11-10Paper
The critical random graph, with martingales2010-06-29Paper
Testing the expansion of a graph2010-04-08Paper
Mean-field conditions for percolation on finite graphs2010-01-25Paper
The Alexander-Orbach conjecture holds in high dimensions2009-11-20Paper
Critical random graphs: Diameter and mixing time2008-09-04Paper
Component sizes of the random graph outside the scaling window2007-10-29Paper
Coloring complete bipartite graphs from random lists2007-02-07Paper
Colouring powers of cycles from random lists2004-10-13Paper
The wired minimal spanning forest on the Poisson-weighted infinite treeN/APaper
The scaling limit of critical hypercube percolationN/APaper

Research outcomes over time

This page was built for person: Asaf Nachmias