Zobrazeno 1 - 10
of 5 161
pro vyhledávání: '"Feray, A."'
We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets (which we rephrase as \emph{modules})
Externí odkaz:
http://arxiv.org/abs/2403.10311
Binary search trees (BST) are a popular type of data structure when dealing with ordered data. Indeed, they enable one to access and modify data efficiently, with their height corresponding to the worst retrieval time. From a probabilistic point of v
Externí odkaz:
http://arxiv.org/abs/2403.03151
We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs, in these cases we prove a.s.
Externí odkaz:
http://arxiv.org/abs/2402.06394
Autor:
Féray, Valentin, Kammoun, Mohamed Slim
We prove, under mild conditions on fixed points and two cycles, the asymptotic normality of vincular pattern counts for a permutation chosen uniformly at random in a conjugacy class.Additionally, we prove that the limiting variance is always non-dege
Externí odkaz:
http://arxiv.org/abs/2312.08756
Publikováno v:
BMC Pediatrics, Vol 24, Iss 1, Pp 1-10 (2024)
Abstract Objectives Acute central nervous system (CNS) infections in children can lead to neurological complications and mortality. This study aimed to identify the clinical manifestations, laboratory parameters, and cerebrospinal fluid characteristi
Externí odkaz:
https://doaj.org/article/d8886955961b4a509a9a444565683287
We obtain scaling and local limit results for large random Young tableaux of fixed shape $\lambda^0$ via the asymptotic analysis of a determinantal point process due to Gorin and Rahman (2019). More precisely, we prove: (1) an explicit description of
Externí odkaz:
http://arxiv.org/abs/2307.11885
Autor:
Féray, Valentin, Rivera-Lopez, Kelvin
We introduce and study a simple Markovian model of random separable permutations. Our first main result is the almost sure convergence of these permutations towards a random limiting object in the sense of permutons, which we call the recursive separ
Externí odkaz:
http://arxiv.org/abs/2306.04278
The Wiener index of a finite graph G is the sum over all pairs (p, q) of vertices of G of the distance between p and q. When P is a finite poset, we define its Wiener index as the Wiener index of the graph of its Hasse diagram. In this paper, we find
Externí odkaz:
http://arxiv.org/abs/2304.06113
Autor:
Vahit Can Cavdar, Basak Ballica, Mert Aric, Zekiye Busra Karaca, Esma Guldal Altunoglu, Feray Akbas
Publikováno v:
BMC Geriatrics, Vol 24, Iss 1, Pp 1-7 (2024)
Abstract Background The increasing prevalence of depression among older adults is a growing concern. Chronic health conditions, cognitive impairments, and hospitalizations amplify emotional distress and depression levels in this population. Assessing
Externí odkaz:
https://doaj.org/article/5ddf8d5a4f534d1bb2c354bd7d287555
Autor:
Serhat Dönmez, Ringaile Lapinskaite, Hazal Nazlican Atalay, Esra Tokay, Feray Kockar, Lukas Rycek, Mehmet Özbil, Tugba Boyunegmez Tumer
Publikováno v:
ACS Bio & Med Chem Au, Vol 4, Iss 4, Pp 178-189 (2024)
Externí odkaz:
https://doaj.org/article/8c200f7b1cb94793b77023c6a1ec36ff