Zobrazeno 1 - 10
of 3 713
pro vyhledávání: '"Timár, A."'
Autor:
Mester, Péter, Timár, Ádám
We construct a unimodular random rooted graph with maximal degree $d\geq 3$ and upper growth rate $d-1$, which does not have a growth rate. Ab\'ert, Fraczyk and Hayes showed that for a unimodular random tree, if the upper growth rate is at least $\sq
Externí odkaz:
http://arxiv.org/abs/2411.18465
Autor:
Krasznahorky, A. J., Krasznahorkay, A., Csatlós, M., Timár, J., Begala, M., Krakó, A., Rajta, I., Vajda, I., Sas, N. J.
Recently, when examining the differential internal pair creation coefficients of $^8$Be, $^4$He and $^{12}$C nuclei, we observed peak-like anomalies in the angular correlation of the e$^+$e$^-$ pairs. This was interpreted as the creation and immediat
Externí odkaz:
http://arxiv.org/abs/2409.16300
Autor:
Elek, Gábor, Timár, Ádám
Whether Borel amenability implies hyperfiniteness is a main open question in the theory of Borel equivalence relations. Under a mild extra uniformity condition, we prove that Borel amenability of bounded degree Borel graphs is equivalent to a randomi
Externí odkaz:
http://arxiv.org/abs/2408.12565
Publikováno v:
Phys. Rev. E 110, 064303, Vol. 110, Iss. 6 - December 2024
Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some critical propert
Externí odkaz:
http://arxiv.org/abs/2408.05125
Autor:
Timár, Ádám
We prove that every (possibly infinite) graph of degree at most $d$ has a 4-dependent random proper $4^{d(d+1)/2}$-coloring, and one can construct it as a finitary factor of iid. For unimodular transitive (or unimodular random) graphs we construct an
Externí odkaz:
http://arxiv.org/abs/2402.17068
Autor:
Timár, Gábor, Kovács, György
Decision tree and random forest classification and regression are some of the most widely used in machine learning approaches. Binary decision tree implementations commonly use conditioning in the form 'feature $\leq$ (or $<$) threshold', with the th
Externí odkaz:
http://arxiv.org/abs/2312.10708
Autor:
Ranđelović, Ivan, Nyíri, Kinga, Koppány, Gergely, Baranyi, Marcel, Tóvári, József, Kigyós, Attila, Timár, József, Vértessy, Beáta G., Grolmusz, Vince
Mutated genes may lead to cancer development in numerous tissues. While more than 600 cancer-causing genes are known today, some of the most widespread mutations are connected to the RAS gene: RAS mutations are found in approximately 25% of all human
Externí odkaz:
http://arxiv.org/abs/2312.05791
Publikováno v:
Phys. Rev. E 109, 024306 (2024)
Triadic closure, the formation of a connection between two nodes in a network sharing a common neighbor, is considered a fundamental mechanism determining the clustered nature of many real-world topologies. In this work we define a static triadic clo
Externí odkaz:
http://arxiv.org/abs/2311.05312
Autor:
Borbála Péterffy, Tamás J. Nádasi, Szilvia Krizsán, Anna Horváth, Ágnes Márk, Gábor Barna, Botond Timár, Laura Almási, Judit Müller, Krisztina Csanádi, Anna Rakonczai, Zsolt Nagy, Krisztián Kállay, Gabriella Kertész, Gergely Kriván, Monika Csóka, Anna Sebestyén, Ágnes F. Semsei, Gábor T. Kovács, Dániel J. Erdélyi, Csaba Bödör, Bálint Egyed, Donát Alpár
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-13 (2024)
Abstract Despite remarkable improvements in the survival of pediatric acute lymphoblastic leukemia (ALL), sensitive detection and clinical management of central nervous system leukemia (CNSL) are still immensely challenging. Blast cells residing in t
Externí odkaz:
https://doaj.org/article/e80a4879cb004880933bc93142da0376
Autor:
Elek, Gábor, Timár, Ádám
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on the bounda
Externí odkaz:
http://arxiv.org/abs/2308.14554