Zobrazeno 1 - 10
of 275
pro vyhledávání: '"Velona"'
Autor:
Velonà, Alessandro <1983>
The aim of this thesis is to detect the phylogeny and the population dynamics of the European termites of the genera Reticulitermes and Kalotermes, by the use of different mitochondrial (16S, COI/tRNA/COII, CR) and nuclear (microsatellites and Inter-
Externí odkaz:
http://amsdottorato.unibo.it/3457/
Autor:
Ben-Hamou, Anna, Velona, Vasiliki
We introduce a random recursive tree model with two communities, called balanced community modulated random recursive tree, or BCMRT in short. In this setting, pairs of nodes of different type appear sequentially. Each node of the pair decides indepe
Externí odkaz:
http://arxiv.org/abs/2305.15206
Autor:
Velona, Theodora
Les neurones à projection callosale (CPN) sont une sous-population de neurones néocorticaux qui relient les hémisphères cérébraux par le corps calleux, la plus grande commissure chez les mammifères non placentaires. Les CPNs varient dans leur
Externí odkaz:
http://www.theses.fr/2018AIXM0352/document
We study the broadcasting problem when the underlying tree is a random recursive tree. The root of the tree has a random bit value assigned. Every other vertex has the same bit value as its parent with probability $1-q$ and the opposite value with pr
Externí odkaz:
http://arxiv.org/abs/2006.11787
Publikováno v:
Journal of Machine Learning Research, Year 2021, Volume 22, Issue 203, Pages 1-41
We study the problem of recovering the structure underlying large Gaussian graphical models or, more generally, partial correlation graphs. In high-dimensional problems it is often too costly to store the entire sample covariance matrix. We propose a
Externí odkaz:
http://arxiv.org/abs/1906.09501
Autor:
Leivaditis, Alexandros, Singh, Alexandros, Stamoulis, Giannos, Thilikos, Dimitrios, Tsatsanis, Konstantinos, Velona, Vasiliki
A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph $G$ is $k$-apex sub-unicyclic if it can become sub-unicyclic by removing $k$ of its vertices. We identify 29 graphs that are the minor-obstructions of the class of $1
Externí odkaz:
http://arxiv.org/abs/1902.02231
We study the class L of link-types that admit a K4-minor-free diagram, i.e., they can be projected on the plane so that the resulting graph does not contain any subdivision of K4. We prove that L is the closure of a subclass of torus links under the
Externí odkaz:
http://arxiv.org/abs/1806.07855
Autor:
Velona, Vasiliki
Let $\Delta =\{ \delta_1,\delta_2,...,\delta_m \} $ be a finite set of 2-connected patterns, i.e. graphs up to vertex relabelling. We study the generating function $D_{\Delta }(z,u_1,u_2,...,u_m),$ which counts polygon dissections and marks subgraph
Externí odkaz:
http://arxiv.org/abs/1802.03719
Publikováno v:
In European Journal of Combinatorics October 2020 89
Autor:
Leivaditis, Alexandros, Singh, Alexandros, Stamoulis, Giannos, Thilikos, Dimitrios M., Tsatsanis, Konstantinos, Velona, Vasiliki
Publikováno v:
In Discrete Applied Mathematics 30 September 2020 284:538-555