Elvan Ceyhan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Elvan Ceyhan has a total of 70 co-authors. Here are the top co-authors by number of shared publications:
- John Tilak Ratnanather
Center for Imaging Science and Institute for Computational Medicine, Department of Biomedical Engineering, Johns Hopkins University
6 shared publications - Li Zhou
Department of Mathematics and Statistics Auburn University 36849 Auburn AL USA
5 shared publications Michael I. Miller
Center for Imaging Science, Johns Hopkins University, Baltimore, MD, USA
4 shared publicationsT. Nishino
Dept. of Psychiatry Washington University School of Medicine 63110 St. Louis MO
4 shared publicationsCarey E. Priebe
Department of Applied Mathematics and Statistics The Johns Hopkins University 21218 Baltimore MD
3 shared publications- Carey E. Priebe
Department of Applied Mathematics and Statistics (AMS), Center for Imaging Science (CIS), Mathematical Institute for Data Science (MINDS), Johns Hopkins University, Baltimore, MD, USA
3 shared publications
Latest Publications
- 5 October 2026
- Published by Springer Nature in Computational Statistics
- Vol. 41 (6) , 132
Sequential decision-making with Bayesian updates for network traversal under spatially correlated uncertainty
- 5 October 2026
- Published by Springer Nature in Computational Statistics
- Vol. 41 (6) , 132
Sequential decision-making with Bayesian updates for network traversal under spatially correlated uncertainty
- Open Access
- 22 September 2026
- Published by Elsevier in Research Methods in Applied Linguistics
- Vol. 5 (3)
The evolution of quantitative methods in Applied Linguistics: A longitudinal case study
- 22 September 2026
- Published by Elsevier in Research Methods in Applied Linguistics
- Vol. 5 (3)
Open AccessThe evolution of quantitative methods in Applied Linguistics: A longitudinal case study
- 31 August 2026
- Published by Wiley in Naval Research Logistics (NRL)
Graph Traversal in the Presence of an Adversary
Suppose a Bayesian agent seeks to traverse a graph. Each time she crosses an edge, she pays a price. The first time she reaches a node, there is a payoff. She has an opponent who can reduce the payoffs. This paper uses adversarial risk analysis (ARA) to find a solution to her route selection problem. It shows how the traveler is advantaged by having an accurate subjective distribution over the costs/payoffs and by having a Bayesian prior for her opponent's strategic choices. The results are relevant to military convoy routing, corporate competition, and certain games.
- 31 August 2026
- Published by Wiley in Naval Research Logistics (NRL)
Graph Traversal in the Presence of an Adversary
Suppose a Bayesian agent seeks to traverse a graph. Each time she crosses an edge, she pays a price. The first time she reaches a node, there is a payoff. She has an opponent who can reduce the payoffs. This paper uses adversarial risk analysis (ARA) to find a solution to her route selection problem. It shows how the traveler is advantaged by having an accurate subjective distribution over the costs/payoffs and by having a Bayesian prior for her opponent's strategic choices. The results are relevant to military convoy routing, corporate competition, and certain games.
- Open Access
- 29 May 2026
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 60 (4) , 2189-2226
Navigation algorithms for optimal pathfinding in stochastic obstacle scene problem
In the stochastic obstacle scene (SOS) problem (a continuous counterpart of the Canadian traveler's problem), a navigating agent seeks a low-cost route from a source to a target in the presence of obstacles whose true/false status is initially uncertain. We study the discretized SOS setting and develop a family of penalty-based navigation heuristics that incorporate both sensor-derived obstacle probabilities and a disambiguation cost incurred upon querying an obstacle at its boundary. Our main methodological contribution is a parametric unification of classical penalty rules via the ACS(k) family, together with norm-based approximations that relate ACS(k) to existing penalties. We valuate the resulting heuristics through extensive Monte Carlo experiments across sensor-accuracy regimes, disambiguation costs, and obstacle densities, and we summarize which penalty-growth behaviors are preferable under each regime. The results provide practical guidance for selecting a penalty-based navigation rule for a given sensor and operational cost configuration.
- 29 May 2026
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 60 (4) , 2189-2226
Open AccessNavigation algorithms for optimal pathfinding in stochastic obstacle scene problem
In the stochastic obstacle scene (SOS) problem (a continuous counterpart of the Canadian traveler's problem), a navigating agent seeks a low-cost route from a source to a target in the presence of obstacles whose true/false status is initially uncertain. We study the discretized SOS setting and develop a family of penalty-based navigation heuristics that incorporate both sensor-derived obstacle probabilities and a disambiguation cost incurred upon querying an obstacle at its boundary. Our main methodological contribution is a parametric unification of classical penalty rules via the ACS(k) family, together with norm-based approximations that relate ACS(k) to existing penalties. We valuate the resulting heuristics through extensive Monte Carlo experiments across sensor-accuracy regimes, disambiguation costs, and obstacle densities, and we summarize which penalty-growth behaviors are preferable under each regime. The results provide practical guidance for selecting a penalty-based navigation rule for a given sensor and operational cost configuration.
- Open Access
- 3 March 2026
- Published by Elsevier in SSRN Electronic Journal
The Evolution of Quantitative Methods in Applied Linguistics: A Longitudinal Case Study
Although advancements in research designs, quality, statistical rigor, and analytic complexity are widely assumed applied linguistics, empirical evidence supporting these claims remains scarce. This paper explores the evolution of quantitative methods in applied linguistics research over a 29-year period (1996–2024). Using a corpus of data from the journal Applied Linguistics, this study examines longitudinal trends in (a) methodological features, (b) research designs and statistical analytic procedures, and (c) rigor/significance reporting practices. Specifically, it explores changes in sampling, number of variables, and questions/hypotheses, data sources, research design types (e.g., experimental, correlational), and analytic procedures (parametric, non-parametric). Further, it evaluates trends in instrument validation (e.g., reliability, factor analysis) and reporting practices (e.g., effect sizes, p-values). Our analyses (in R) combined descriptive, chi-square tests, standardized residuals, and Cochran–Armitage trend tests to distinguish overall distributional differences, monotonic trends, and localized deviations over time. Temporal changes (5-year trends) in categorical variables were assessed using a combination of contingency-based and trend-focused procedures. By analyzing these monotonic/non-monotonic trends (e.g., sieve-bootstrap Mann–Kendall test), the study offers a comprehensive snapshot of how methodological rigor in the field has evolved in response to technological advances, changing publication demands, and stakeholder expectations. Results suggest that many observed trends in our data were not random fluctuations, indicating the presence of significant quadratic upward and downward trends in several variables across different year-groups over the 29-year period. This work addresses a critical gap in understanding the trajectory of quantitative research in the field, offering insights into future scholarly practices.
- 3 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessThe Evolution of Quantitative Methods in Applied Linguistics: A Longitudinal Case Study
Although advancements in research designs, quality, statistical rigor, and analytic complexity are widely assumed applied linguistics, empirical evidence supporting these claims remains scarce. This paper explores the evolution of quantitative methods in applied linguistics research over a 29-year period (1996–2024). Using a corpus of data from the journal Applied Linguistics, this study examines longitudinal trends in (a) methodological features, (b) research designs and statistical analytic procedures, and (c) rigor/significance reporting practices. Specifically, it explores changes in sampling, number of variables, and questions/hypotheses, data sources, research design types (e.g., experimental, correlational), and analytic procedures (parametric, non-parametric). Further, it evaluates trends in instrument validation (e.g., reliability, factor analysis) and reporting practices (e.g., effect sizes, p-values). Our analyses (in R) combined descriptive, chi-square tests, standardized residuals, and Cochran–Armitage trend tests to distinguish overall distributional differences, monotonic trends, and localized deviations over time. Temporal changes (5-year trends) in categorical variables were assessed using a combination of contingency-based and trend-focused procedures. By analyzing these monotonic/non-monotonic trends (e.g., sieve-bootstrap Mann–Kendall test), the study offers a comprehensive snapshot of how methodological rigor in the field has evolved in response to technological advances, changing publication demands, and stakeholder expectations. Results suggest that many observed trends in our data were not random fluctuations, indicating the presence of significant quadratic upward and downward trends in several variables across different year-groups over the 29-year period. This work addresses a critical gap in understanding the trajectory of quantitative research in the field, offering insights into future scholarly practices.
- Open Access
Adversarial Graph Traversal
Suppose a Bayesian agent seeks to traverse a graph. Each time she crosses an edge, she pays a price. The first time she reaches a node, there is a payoff. She has an opponent who can reduce the payoffs. This paper uses adversarial risk analysis to find a solution to her route selection problem. It shows how the traveler is advantaged by having an accurate subjective distribution over the costs/payoffs and by having a Bayesian prior for her opponent's strategic choices. The results are relevant to military convoy routing, corporate competition, and certain games.
Open AccessAdversarial Graph Traversal
Suppose a Bayesian agent seeks to traverse a graph. Each time she crosses an edge, she pays a price. The first time she reaches a node, there is a payoff. She has an opponent who can reduce the payoffs. This paper uses adversarial risk analysis to find a solution to her route selection problem. It shows how the traveler is advantaged by having an accurate subjective distribution over the costs/payoffs and by having a Bayesian prior for her opponent's strategic choices. The results are relevant to military convoy routing, corporate competition, and certain games.
- Open Access
Prototype Selection Using Topological Data Analysis
Recently, there has been an explosion in statistical learning literature to represent data using topological principles to capture structure and relationships. We propose a topological data analysis (TDA)-based framework, named Topological Prototype Selector (TPS), for selecting representative subsets (prototypes) from large datasets. We demonstrate the effectiveness of TPS on simulated data under different data intrinsic characteristics, and compare TPS against other currently used prototype selection methods in real data settings. In all simulated and real data settings, TPS significantly preserves or improves classification performance while substantially reducing data size. These contributions advance both algorithmic and geometric aspects of prototype learning and offer practical tools for parallelized, interpretable, and efficient classification.
Open AccessPrototype Selection Using Topological Data Analysis
Recently, there has been an explosion in statistical learning literature to represent data using topological principles to capture structure and relationships. We propose a topological data analysis (TDA)-based framework, named Topological Prototype Selector (TPS), for selecting representative subsets (prototypes) from large datasets. We demonstrate the effectiveness of TPS on simulated data under different data intrinsic characteristics, and compare TPS against other currently used prototype selection methods in real data settings. In all simulated and real data settings, TPS significantly preserves or improves classification performance while substantially reducing data size. These contributions advance both algorithmic and geometric aspects of prototype learning and offer practical tools for parallelized, interpretable, and efficient classification.
- Open Access
- 25 September 2025
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 14 (10) , 374
Adversarial Obstacle Placement with Spatial Point Processes for Optimal Path Disruption
We investigate the Optimal Obstacle Placement (OOP) problem under uncertainty, framed as the dual of the Optimal Traversal Path problem in the Stochastic Obstacle Scene paradigm. We consider both continuous domains, discretized for analysis, and already discrete spatial grids that form weighted geospatial networks using 8-adjacency lattices. Our unified framework integrates OOP with stochastic geometry, modeling obstacle placement via Strauss (regular) and Matérn (clustered) processes, and evaluates traversal using the Reset Disambiguation algorithm. Through extensive Monte Carlo experiments, we show that traversal cost increases by up to 40% under strongly regular placements, while clustered configurations can decrease traversal costs by as much as 25% by leaving navigable corridors compared to uniform random layouts. In mixed (with both true and false obstacles) scenarios, increasing the proportion of true obstacles from 30% to 70% nearly doubles the traversal cost. These findings are further supported by statistical analysis and stochastic ordering, providing rigorous insights into how spatial patterns and obstacle compositions influence navigation under uncertainty.
- 25 September 2025
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 14 (10) , 374
Open AccessAdversarial Obstacle Placement with Spatial Point Processes for Optimal Path Disruption
We investigate the Optimal Obstacle Placement (OOP) problem under uncertainty, framed as the dual of the Optimal Traversal Path problem in the Stochastic Obstacle Scene paradigm. We consider both continuous domains, discretized for analysis, and already discrete spatial grids that form weighted geospatial networks using 8-adjacency lattices. Our unified framework integrates OOP with stochastic geometry, modeling obstacle placement via Strauss (regular) and Matérn (clustered) processes, and evaluates traversal using the Reset Disambiguation algorithm. Through extensive Monte Carlo experiments, we show that traversal cost increases by up to 40% under strongly regular placements, while clustered configurations can decrease traversal costs by as much as 25% by leaving navigable corridors compared to uniform random layouts. In mixed (with both true and false obstacles) scenarios, increasing the proportion of true obstacles from 30% to 70% nearly doubles the traversal cost. These findings are further supported by statistical analysis and stochastic ordering, providing rigorous insights into how spatial patterns and obstacle compositions influence navigation under uncertainty.
- Open Access
Adversarial Obstacle Placement with Spatial Point Processes for Optimal Path Disruption
We investigate the Optimal Obstacle Placement (OOP) problem under uncertainty, framed as the dual of the Optimal Traversal Path problem in the Stochastic Obstacle Scene paradigm. We consider both continuous domains, discretized for analysis, and already discrete spatial grids that form weighted geospatial networks using 8-adjacency lattices. Our unified framework integrates OOP with stochastic geometry, modeling obstacle placement via Strauss (regular) and Matérn (clustered) processes, and evaluates traversal using the Reset Disambiguation algorithm. Through extensive Monte Carlo experiments, we show that traversal cost increases by up to 40% under strongly regular placements, while clustered configurations can decrease traversal costs by as much as 25% by leaving navigable corridors compared to uniform random layouts. In mixed (with both true and false obstacles) scenarios, increasing the proportion of true obstacles from 30% to 70% nearly doubles the traversal cost. These findings are further supported by statistical analysis and stochastic ordering, providing rigorous insights into how spatial patterns and obstacle compositions influence navigation under uncertainty.
Open AccessAdversarial Obstacle Placement with Spatial Point Processes for Optimal Path Disruption
We investigate the Optimal Obstacle Placement (OOP) problem under uncertainty, framed as the dual of the Optimal Traversal Path problem in the Stochastic Obstacle Scene paradigm. We consider both continuous domains, discretized for analysis, and already discrete spatial grids that form weighted geospatial networks using 8-adjacency lattices. Our unified framework integrates OOP with stochastic geometry, modeling obstacle placement via Strauss (regular) and Matérn (clustered) processes, and evaluates traversal using the Reset Disambiguation algorithm. Through extensive Monte Carlo experiments, we show that traversal cost increases by up to 40% under strongly regular placements, while clustered configurations can decrease traversal costs by as much as 25% by leaving navigable corridors compared to uniform random layouts. In mixed (with both true and false obstacles) scenarios, increasing the proportion of true obstacles from 30% to 70% nearly doubles the traversal cost. These findings are further supported by statistical analysis and stochastic ordering, providing rigorous insights into how spatial patterns and obstacle compositions influence navigation under uncertainty.
- Open Access
Solving the Constrained Random Disambiguation Path Problem via Lagrangian Relaxation and Graph Reduction
We study a resource-constrained variant of the Random Disambiguation Path (RDP) problem, a generalization of the Stochastic Obstacle Scene (SOS) problem, in which a navigating agent must reach a target in a spatial environment populated with uncertain obstacles. Each ambiguous obstacle may be disambiguated at a (possibly) heterogeneous resource cost, subject to a global disambiguation budget. We formulate this constrained planning problem as a Weight-Constrained Shortest Path Problem (WCSPP) with risk-adjusted edge costs that incorporate probabilistic blockage and traversal penalties. To solve it, we propose a novel algorithmic framework-COLOGR-combining Lagrangian relaxation with a two-phase vertex elimination (TPVE) procedure. The method prunes infeasible and suboptimal paths while provably preserving the optimal solution, and leverages dual bounds to guide efficient search. We establish correctness, feasibility guarantees, and surrogate optimality under mild assumptions. Our analysis also demonstrates that COLOGR frequently achieves zero duality gap and offers improved computational complexity over prior constrained path-planning methods. Extensive simulation experiments validate the algorithm's robustness across varying obstacle densities, sensor accuracies, and risk models, consistently outperforming greedy baselines and approaching offline-optimal benchmarks. The proposed framework is broadly applicable to stochastic network design, mobility planning, and constrained decision-making under uncertainty.
Open AccessSolving the Constrained Random Disambiguation Path Problem via Lagrangian Relaxation and Graph Reduction
We study a resource-constrained variant of the Random Disambiguation Path (RDP) problem, a generalization of the Stochastic Obstacle Scene (SOS) problem, in which a navigating agent must reach a target in a spatial environment populated with uncertain obstacles. Each ambiguous obstacle may be disambiguated at a (possibly) heterogeneous resource cost, subject to a global disambiguation budget. We formulate this constrained planning problem as a Weight-Constrained Shortest Path Problem (WCSPP) with risk-adjusted edge costs that incorporate probabilistic blockage and traversal penalties. To solve it, we propose a novel algorithmic framework-COLOGR-combining Lagrangian relaxation with a two-phase vertex elimination (TPVE) procedure. The method prunes infeasible and suboptimal paths while provably preserving the optimal solution, and leverages dual bounds to guide efficient search. We establish correctness, feasibility guarantees, and surrogate optimality under mild assumptions. Our analysis also demonstrates that COLOGR frequently achieves zero duality gap and offers improved computational complexity over prior constrained path-planning methods. Extensive simulation experiments validate the algorithm's robustness across varying obstacle densities, sensor accuracies, and risk models, consistently outperforming greedy baselines and approaching offline-optimal benchmarks. The proposed framework is broadly applicable to stochastic network design, mobility planning, and constrained decision-making under uncertainty.