2 citations · 3 across the 10 of their papers we have counts for
10 papers
Sensitivity of Filter Kernels and Robustness Bounds to Transition and Measurement Kernel Perturbations in Partially Observable Stochastic Control
Yunus Emre Demirci, Ali Devran Kara, Serdar Yüksel
Studying the stability of partially observed Markov decision processes (POMDPs) with respect to perturbations in either transition or observation kernels is a significant problem.…
Refined Bounds on Near Optimality Finite Window Policies in POMDPs and Their Reinforcement Learning
Yunus Emre Demirci, Ali Devran Kara, Serdar Yüksel
Finding optimal policies for Partially Observable Markov Decision Processes (POMDPs) is challenging due to their uncountable state spaces when transformed into fully observable Mar…
Average Cost Optimality of Partially Observed MDPS: Contraction of Non-linear Filters, Optimal Solutions and Approximations
Yunus Emre Demirci, Ali Devran Kara, Serdar Yüksel
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 measur…
Unique Ergodicity of Non-Linear Filters via Reachability and Uniform Weak Continuity
Yunus Emre Demirci, Serdar Yüksel
We present a reachability based approach to establish unique ergodicity of non-linear filter processes where state space of a hidden Markov model is a compact Polish metric space a…
Mixing time bounds for edge flipping on regular graphs
Yunus Emre Demirci, Ümit Işlak, Alperen Özdemir
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…
Mixing time bounds for edge flipping on regular graphs
Yunus Emre Demirci, Ümit Işlak, Alperen Yaşar Özdemir
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 dis…
On a cover time problem on a dynamic graph with steps at random times
Yunus Emre Demirci, Ümit Işlak, Mehmet Akif Yıldız
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…
Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs
Yunus Emre Demirci, Tınaz Ekim, Mehmet Akif Yıldız
In this paper, we investigate a variant of Ramsey numbers called defective Ramsey numbers where cliques and independent sets are generalized to -dense and -sparse sets, both…
The Variance and the Asymptotic Distribution of the Length of Longest -alternating Subsequences
Recep Altar Çiçeksiz, Yunus Emre Demirci, Ümit Işlak
We obtain an explicit formula for the variance of the number of -peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of t…
Defective Ramsey Numbers in Graph Classes
Yunus Emre Demirci, Tınaz Ekim, John Gimbel +1
Given a graph , a -sparse -set is a set of vertices inducing a subgraph with maximum degree at most . A -dense -set is a set of vertices that is -spars…