Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Asaf Nachmias"'
Autor:
TOM HUTCHCROFT, ASAF NACHMIAS
Publikováno v:
Forum of Mathematics, Sigma, Vol 7 (2019)
We prove that the free uniform spanning forest of any bounded degree proper plane graph is connected almost surely, answering a question of Benjamini, Lyons, Peres and Schramm. We provide a quantitative form of this result, calculating the critical e
Externí odkaz:
https://doaj.org/article/6eaedc0c98d545238e6da3603712caf8
Autor:
Asaf Nachmias
This open access book focuses on the interplay between random walks on planar maps and Koebe's circle packing theorem. Further topics covered include electric networks, the He–Schramm theorem on infinite circle packings, uniform spanning trees of p
Autor:
Tim Hulshof, Asaf Nachmias
Publikováno v:
Random Structures and Algorithms, 56(2), 557-593. Wiley
We study bond percolation on the hypercube $\{0,1\}^m$ in the slightly subcritical regime where $p = p_c (1-\varepsilon_m)$ and $\varepsilon_m = o(1)$ but $\varepsilon_m \gg 2^{-m/3}$ and study the clusters of largest volume and diameter. We establis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0becd42b550ea66ab2ba2be9d64cc308
https://doi.org/10.1002/rsa.20853
https://doi.org/10.1002/rsa.20853
Autor:
Asaf Nachmias, Yuval Peres
We show that the local limit of the uniform spanning tree on any finite, simple, connected, regular graph sequence with degree tending to infinity is the Poisson(1) branching process conditioned to survive forever. An extension to "almost" regular gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fbefd27cb086c13a19e65e8c1cd4adec
Publikováno v:
Journal of the European Mathematical Society
Journal of the European Mathematical Society, European Mathematical Society, 2020, 22 (12), pp.3997-4024. ⟨10.4171/JEMS/1001⟩
Journal of the European Mathematical Society, European Mathematical Society, 2020, 22 (12), pp.3997-4024. ⟨10.4171/JEMS/1001⟩
We study the random planar map obtained from a critical, finite variance, Galton-Watson plane tree by adding the horizontal connections between successive vertices at each level. This random graph is closely related to the well-known causal dynamical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b7d23fdbc98967aeeb0fd1f2d8d30d5
We show that the diameter of a uniformly drawn spanning tree of a connected graph on $n$ vertices which satisfies certain high-dimensionality conditions typically grows like $\Theta(\sqrt{n})$. In particular this result applies to expanders, finite t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1390d66805e1cd2081f1bd9e07b8333e
http://arxiv.org/abs/1911.12319
http://arxiv.org/abs/1911.12319
Autor:
Asaf Nachmias
Publikováno v:
Lecture Notes in Mathematics ISBN: 9783030279677
In order to study large random graphs it is mathematically natural and appealing to introduce an infinite limiting object and study its properties. In their seminal paper, Benjamini and Schramm (J Probab 6(23):1–13, 2001) introduced the notion of l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f413e4507b0dd37aad1bdeec180c609f
https://doi.org/10.1007/978-3-030-27968-4_5
https://doi.org/10.1007/978-3-030-27968-4_5
Autor:
Asaf Nachmias
Publikováno v:
Lecture Notes in Mathematics ISBN: 9783030279677
Our main goal in this chapter is to remove the bounded degrees assumption in Theorem 5.2 and replace it with the assumption that the degree of the root has an exponential tail.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::843af428dfa337c6e99bf0c4c45ced92
https://doi.org/10.1007/978-3-030-27968-4_6
https://doi.org/10.1007/978-3-030-27968-4_6
Autor:
Asaf Nachmias
Publikováno v:
Lecture Notes in Mathematics ISBN: 9783030279677
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc5bf0be0ce9d61319bef782286ecfa6
https://doi.org/10.1007/978-3-030-27968-4_1
https://doi.org/10.1007/978-3-030-27968-4_1
Autor:
Asaf Nachmias
Publikováno v:
Lecture Notes in Mathematics ISBN: 9783030279677
Let G be a finite connected graph. A spanning tree T of G is a connected subgraph of G that contains no cycles and such that every vertex of G is incident to at least one edge of T. The set of spanning trees of a given finite connected graph is obvio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fa4a8392644dc6e54a733d6618cb99e
https://doi.org/10.1007/978-3-030-27968-4_7
https://doi.org/10.1007/978-3-030-27968-4_7