Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Demirci, Yunus"'
Finding optimal policies for Partially Observable Markov Decision Processes (POMDPs) is challenging due to their uncountable state spaces when transformed into fully observable Markov Decision Processes (MDPs) using belief states. Traditional methods
Externí odkaz:
http://arxiv.org/abs/2409.04351
The average cost optimality is known to be a challenging problem for partially observable stochastic control, with few results available beyond the finite state, action, and measurement setup, for which somewhat restrictive conditions are available.
Externí odkaz:
http://arxiv.org/abs/2312.14111
Autor:
Demirci, Yunus Emre, Yüksel, Serdar
In this paper, we present conditions for the geometric ergodicity and Wasserstein regularity of non-linear filter processes. While previous studies have mainly focused on unique ergodicity and the weak Feller property, our work extends these findings
Externí odkaz:
http://arxiv.org/abs/2307.15764
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
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:
http://arxiv.org/abs/2110.01083
In this paper, we investigate a variant of Ramsey numbers called defective Ramsey numbers where cliques and independent sets are generalized to $k$-dense and $k$-sparse sets, both commonly called $k$-defective sets. We focus on the computation of def
Externí odkaz:
http://arxiv.org/abs/2107.12031
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 25:1, Combinatorics (May 5, 2023) dmtcs:10296
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:
http://arxiv.org/abs/2107.12459
Given a graph $G$, a $k$-sparse $j$-set is a set of $j$ vertices inducing a subgraph with maximum degree at most $k$. A $k$-dense $i$-set is a set of $i$ vertices that is $k$-sparse in the complement of $G$. As a generalization of Ramsey numbers, the
Externí odkaz:
http://arxiv.org/abs/1912.03705
Publikováno v:
In Discrete Optimization November 2021 42
Autor:
Demirci, Yunus Emre1 (AUTHOR), Ekim, Tınaz2 (AUTHOR) tinaz.ekim@boun.edu.tr, Yıldız, Mehmet Akif1 (AUTHOR)
Publikováno v:
Graphs & Combinatorics. Feb2023, Vol. 39 Issue 1, p1-25. 25p.