Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Ümit Işlak"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:1, Iss Combinatorics (2023)
We obtain an explicit formula for the variance of the number of $k$-peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of the length of longest $k$-alternating subsequence in random permutation
Externí odkaz:
https://doaj.org/article/a17d4cf03eb24945aa09e8cf09d35bef
Autor:
Ümit Işlak, Alperen Y. Özdemir
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 1, Iss Combinatorics (2020)
The purpose of this paper is to study a statistic that is used to compare the similarity between two strings, which is first introduced by Michael Steele in 1982. It was proposed as an alternative to the length of the longest common subsequences, for
Externí odkaz:
https://doaj.org/article/b85d99100a8b433ba38deefd53b6ba1c
Publikováno v:
Journal of Applied Probability. :1-16
The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham in [CG12]. In the same paper, its eigenvalues and stationary distributions for some classes of graphs are identified. We further study
Autor:
Ella Hiesmayr, Ümit Işlak
Publikováno v:
Journal of Applied Probability. 57:441-457
A uniform recursive tree on n vertices is a random tree where each possible $(n-1)!$ labelled recursive rooted tree is selected with equal probability. We introduce and study weighted trees, a non-uniform recursive tree model departing from the recen
We introduce a cover time problem for random walks on dynamic graphs in which the graph expands in time and the walker moves at random times. Time to cover all nodes and number of returns to original states are analyzed in resulting model.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::732cc6128f738c8c9bcd8078b6952751
http://arxiv.org/abs/2110.01083
http://arxiv.org/abs/2110.01083
Publikováno v:
Statistics & Probability Letters. 141:31-40
In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave very much
Autor:
Serdar Altok, Ümit Işlak
Publikováno v:
Statistics & Probability Letters. 121:61-69
Using a bijection between a uniformly random permutation and a uniform recursive tree (URT), we give a simple proof of a recent result of Zhang that shows the asymptotic normality of the number of leaves in a URT with convergence rates. We also show
Autor:
Ümit Işlak
Publikováno v:
Statistics & Probability Letters. 109:22-29
Our main result is a central limit theorem for random sums of the form ∑ i = 1 N n X i , where { X i } i ≥ 1 is a stationary m -dependent process and N n is a random index independent of { X i } i ≥ 1 . This extends the work of Chen and Shao on
Autor:
Ümit Işlak
Publikováno v:
Volume: 42, Issue: 2 502-514
Turkish Journal of Mathematics
Turkish Journal of Mathematics
This paper studies statistics of riffle shuffles by relating them to random word statistics with the use of inverse shuffles. Asymptotic normality of the number of descents and inversions in riffle shuffles with convergence rates of order $1/\sqrt{n}
Autor:
Alperen Y. Özdemir, Ümit Işlak
Let $X=(X_1,\ldots,X_n)$ be a vector of i.i.d. random variables where $X_i$'s take values over $\mathbb{N}$. The purpose of this paper is to study the number of weakly increasing subsequences of $X$ of a given length $k$, and the number of all weakly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b672f74d4e80feaf4816db5ab1c972a
http://arxiv.org/abs/1706.09510
http://arxiv.org/abs/1706.09510