Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Yuval Peled"'
Publikováno v:
Dentistry Journal, Vol 11, Iss 9, p 217 (2023)
Until recently, it was widely accepted that bacteria participate in caries pathogenesis mainly through carbohydrate fermentation and acid production, which promote the dissolution of tooth components. Neutrophils, on the other hand, were considered w
Externí odkaz:
https://doaj.org/article/0eacd7fa86234c32821b065cb87f5a90
Publikováno v:
Acta Mathematica Hungarica. 161:557-568
It is well known that for every even integer n, the complete graph $$K_{n}$$ has a one-factorization, namely a proper edge coloring with $$n-1$$ colors. Unfortunately, not much is known about the possible structure of large one-factorizations. Also,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11193d8903010436ff955f1595c616f6
https://doi.org/10.1007/s10474-020-01070-1
https://doi.org/10.1007/s10474-020-01070-1
We consider the Erd\H{o}s-R\'enyi evolution of random graphs, where a new uniformly distributed edge is added to the graph in every step. For every fixed $d\ge 1$, we show that with high probability, the graph becomes rigid in $\mathbb R^d$ at the ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d82495b2836267d117677d3d579d6115
http://arxiv.org/abs/2202.09917
http://arxiv.org/abs/2202.09917
Autor:
Eyal Lubetzky, Yuval Peled
A \emph{stacked triangulation} of a $d$-simplex $\mathbf{o}=\{1,\ldots,d+1\}$ ($d\geq 2$) is a triangulation obtained by repeatedly subdividing a $d$-simplex into $d+1$ new ones via a new vertex (the case $d=2$ is known as an Appolonian network). We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::480a8f44032b46a263d72cd4a0c6d136
http://arxiv.org/abs/2112.12780
http://arxiv.org/abs/2112.12780
Autor:
Nati Linial, Yuval Peled
Publikováno v:
Random Structures & Algorithms. 55:677-695
Over thirty years ago, Kalai proved a beautiful $d$-dimensional analog of Cayley's formula for the number of $n$-vertex trees. He enumerated $d$-dimensional hypertrees weighted by the squared size of their $(d-1)$-dimensional homology group. This, ho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3c9c2377ae2807fb6b81300295614de
https://doi.org/10.1002/rsa.20841
https://doi.org/10.1002/rsa.20841
Publikováno v:
Israel Journal of Mathematics. 229:133-163
Let F be an n-vertex forest. An edge e ∉ F is said to be in F’s shadow if F ∪ {e} contains a cycle. It is easy to see that if F is an “almost tree”, i.e., a forest that contains two components, then its shadow contains at least $$\left\lflo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5d482df44b6d9ccc37a8253eb429ede
https://doi.org/10.1007/s11856-018-1803-0
https://doi.org/10.1007/s11856-018-1803-0
Autor:
Aviad Sar Shalom, Yuval Peled, Rachel Singer, Irit Amit-Cohen, Rafi Rich, Avraham (Avi) Sasson, Elissa Rosenberg
This book introduces an inventory of proposed cultural landscapes in Israel, which have been identified, researched and mapped by the Israel Nature and Parks Authority. The categories as defined by the Operational Guidelines of the World Heritage Co
Autor:
Tomasz Łuczak, Yuval Peled
Publikováno v:
Discrete & Computational Geometry. 59:131-142
The random 2-dimensional simplicial complex process starts with a complete graph on n vertices, and in every step a new 2-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to 1 as $$n\rightarrow \infty $$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d483dfb5a5ffda54c80051adc8963683
https://doi.org/10.1007/s00454-017-9938-z
https://doi.org/10.1007/s00454-017-9938-z
We study the minimum total weight of a disk triangulation using vertices out of $\{1,\ldots,n\}$, where the boundary is the triangle $(123)$ and the $\binom{n}3$ triangles have independent weights, e.g. $\mathrm{Exp}(1)$ or $\mathrm{U}(0,1)$. We show
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b86d5e8e0e15035c46e9f0ba5c863e81
Autor:
Guillaume Dubach, Yuval Peled
We consider words $G_{i_1} \cdots G_{i_m}$ involving i.i.d. complex Ginibre matrices, and study tracial expressions of their eigenvalues and singular values. We show that the limit distribution of the squared singular values of every word of length $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1301d6f3087fd940ad8d627adf8d4620