Zobrazeno 1 - 10
of 2 076
pro vyhledávání: '"Georgakopoulos, P."'
We study a higher-dimensional analogue of the {Random Travelling Salesman Problem}: let the complete $d$-dimensional simplicial complex $K_n^{d}$ on $n$ vertices be equipped with i.i.d.\ volumes on its facets, uniformly random in $[0,1]$. What is the
Externí odkaz:
http://arxiv.org/abs/2409.00235
Autor:
Georgakopoulos, Agelos, Winter, Martin
We study the potentially undecidable problem of whether a given 2-dimensional CW complex can be embedded into $\mathbb{R}^4$. We provide operations that preserve embeddability, including joining and cloning of 2-cells, as well as $\Delta\mathrm Y$-tr
Externí odkaz:
http://arxiv.org/abs/2408.12681
Autor:
Theocharopoulos, Panagiotis C., Georgakopoulos, Spiros V., Tasoulis, Sotiris K., Plagianakos, Vassilis P.
With the increasing use of Artificial Intelligence in Natural Language Processing, concerns have been raised regarding the detection of AI-generated text in various domains. This study aims to investigate this issue by proposing a methodology to accu
Externí odkaz:
http://arxiv.org/abs/2405.20285
Autor:
Georgakopoulos, Agelos
We introduce notions of dimension of an infinite group, or more generally, a metric space, defined using percolation. Roughly speaking, the percolation dimension $pdim(G)$ of a group $G$ is the fastest rate of decay of a symmetric probability measure
Externí odkaz:
http://arxiv.org/abs/2404.17278
Autor:
Inan, Muhammad Sakib Khan, Liao, Kewen, Shen, Haifeng, Jayaraman, Prem Prakash, Georgakopoulos, Dimitrios, Tang, Ming Jian
Internet of Things (IoT) sensor data or readings evince variations in timestamp range, sampling frequency, geographical location, unit of measurement, etc. Such presented sequence data heterogeneity makes it difficult for traditional time series clas
Externí odkaz:
http://arxiv.org/abs/2403.19996
Halin's well-known grid theorem states that a graph $G$ with a thick end must contain a subdivision of the hexagonal half-grid. We obtain the following strengthening when $G$ is vertex-transitive and locally finite. Either $G$ is quasi-isometric to a
Externí odkaz:
http://arxiv.org/abs/2403.05862
Autor:
Georgakopoulos, Agelos
Mohar recently adapted the classical game of Cops and Robber from graphs to metric spaces, thereby unifying previously studied pursuit-evasion games. He conjectured that finitely many cops can win on any compact geodesic metric space, and that their
Externí odkaz:
http://arxiv.org/abs/2309.03757
Autor:
Ioannis Mouratidis, Fotis A. Baltoumas, Nikol Chantzi, Michail Patsakis, Candace S.Y. Chan, Austin Montgomery, Maxwell A. Konnaris, Eleni Aplakidou, George C. Georgakopoulos, Anshuman Das, Dionysios V. Chartoumpekis, Jasna Kovac, Georgios A. Pavlopoulos, Ilias Georgakopoulos-Soares
Publikováno v:
Computational and Structural Biotechnology Journal, Vol 23, Iss , Pp 1919-1928 (2024)
The decrease in sequencing expenses has facilitated the creation of reference genomes and proteomes for an expanding array of organisms. Nevertheless, no established repository that details organism-specific genomic and proteomic sequences of specifi
Externí odkaz:
https://doaj.org/article/b205166809fc422ea5069ccb0553ef5a
We present problems and results that combine graph-minors and coarse geometry. For example, we ask whether every geodesic metric space (or graph) without a fat $H$ minor is quasi-isometric to a graph with no $H$ minor, for an arbitrary finite graph $
Externí odkaz:
http://arxiv.org/abs/2305.07456
Autor:
Georgakopoulos, Agelos, Wendland, Alex
We prove that every recurrent graph $G$ quasi-isometric to $\mathbb{R}$ admits an essentially unique Lipschitz harmonic function $h$. If $G$ is vertex-transitive, then the action of $Aut(G)$ preserves $\partial h$ up to a sign, a fact that we exploit
Externí odkaz:
http://arxiv.org/abs/2304.13317