Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Özdemir, Alperen"'
Autor:
Özdemir, Alperen
For a sequence of random graphs, the limit law we refer to is the existence of a limiting probability of any graph property that can be expressed in terms of predicate logic. A zero-one limit law is shown by Shelah and Spencer for Erd\"{o}s-Renyi gra
Externí odkaz:
http://arxiv.org/abs/2408.07475
Autor:
Özdemir, Alperen
We say that a convergence law holds for a sequence of random combinatorial objects if for any first-order sentence $\varphi,$ the density of the objects that satisfy $\varphi$ converges to a limiting value. We show the convergence law for random $321
Externí odkaz:
http://arxiv.org/abs/2312.01749
The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham. In the same paper, its eigenvalues and stationary distributions for some classes of graphs are identified. We further study its spect
Externí odkaz:
http://arxiv.org/abs/2208.14618
In first-passage percolation, one assigns i.i.d. nonnegative weights $(t_e)$ to the edges of $\mathbb{Z}^d$ and studies the induced distance (passage time) $T(x,y)$ between vertices $x$ and $y$. It is known that for $d=2$, the fluctuations of $T(x,y)
Externí odkaz:
http://arxiv.org/abs/2204.06592
Autor:
Özdemir, Alperen Y.
This paper develops methods to study the distribution of Eulerian statistics defined by second-order recurrence relations. We define a random process to decompose the statistics over compositions of integers. It is shown that the numbers of descents
Externí odkaz:
http://arxiv.org/abs/2103.07498
Autor:
Özdemir, Alperen Y.
This paper develops techniques to study the number of descents in random permutations via martingales. We relax an assumption in the Berry-Esseen theorem of Bolthausen (1982) to extend the theorem's scope to martingale differences of time-dependent v
Externí odkaz:
http://arxiv.org/abs/1901.01719
Autor:
Özdemir, Alperen Y.
This paper studies Markov chains on the symmetric group $S_n$ where the transition probabilities are given by the Ewens distribution with parameter $\theta>1$. The eigenvalues are identified to be proportional to the content polynomials of partitions
Externí odkaz:
http://arxiv.org/abs/1811.02039
Autor:
Işlak, Ümit, Özdemir, Alperen Y.
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 22 no. 1, Combinatorics (July 10, 2020) dmtcs:5745
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:
http://arxiv.org/abs/1803.04052
Autor:
Özdemir, Alperen
Publikováno v:
In Advances in Applied Mathematics September 2022 140
Autor:
Özdemir, Alperen Y.
We study the rate of convergence of the Markov chain on $S_n$ which starts with a random $(n-k)$-cycle for a fixed $k \geq 1$, followed by random transpositions. The convergence to the stationary distribution turns out to be of order $n$. We show tha
Externí odkaz:
http://arxiv.org/abs/1707.01604