Erol A. Pekoz

Erol A. Pekoz

Auto-generated profile, based on publicly available information

Erol A. Pekoz

Boston University

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 June 2017 in Advances in Applied Probability
Verified
Journal Article
Closed access
PDF file
EPErol Peköz
Erol Peköz
ARAdrian Röllin
Adrian Röllin
NRNathan Ross
Nathan Ross
We study the joint degree counts in linear preferential attachment random graphs and find a simple representation for the limit distribution in infinite sequence space. We show weak convergence with respect to the p-norm topology for appropriate p and also provide optimal rates of convergence of the finite-dimensional distributions. The results hold for models with any general initial seed graph and any fixed number of initial outgoing edges per vertex; we generate nontree graphs using both a lumping and a sequential rule. Convergence of the order statistics and optimal rates of convergence to the maximum of the degrees is also established.

1 February 2013 in Medical Care
Verified
Journal Article
Closed access
JSJennifer Sullivan
Jennifer Sullivan
MSMichael Shwartz
Michael Shwartz
JBJames F. Jr Burgess
James F. Jr Burgess
EPErol A. Peköz
Erol A. Peköz
CCCindy L. Christiansen
Cindy L. Christiansen
DBDan Berlowitz
Dan Berlowitz
Objective: To examine variation in culture change to a person-centered care (PCC) model, and the association between culture change and a composite measure of quality in 107 Department of Veterans Affairs nursing homes. Methods: We examined the relationship between a composite quality measure calculated from 24 quality indicators (QIs) from the Minimum Data Set (that measure unfavorable events), and PCC summary scores calculated from the 6 domains of the Artifact of Culture Change Tool, using 3 different methods of calculating the summary scores. We also use a Bayesian hierarchical model to analyze the relationship between a latent construct measuring extent of culture change and the composite quality measure. Results: Using the original Artifacts scores, the highest performing facility has a 2.9 times higher score than the lowest. There is a statistically significant relationship between the composite quality measure and each of the 3 summary Artifacts scores. Depending on whether original scores, standardized scores, or optimal scores are used, a facility at the 10th percentile in terms of culture change compared with one at the 90th percentile has 8.0%, 8.9%, or 10.3% more QI events. When PCC implementation is considered as a latent construct, 18 low performance PCC facilities have, on an average, 16.3% more QI events than 13 high performance facilities. Conclusions: Our results indicate that culture change to a PCC model is associated with higher Minimum Data Set-based quality. Longitudinal data are needed to better assess whether there is a causal relationship between the extent of culture change and quality.

1 December 2017 in Operations Research
Verified
Journal Article
Closed access
IAIlan Adler
Ilan Adler
YCYang Cao
Yang Cao
RKRichard Karp
Richard Karp
EPErol A. Peköz
Erol A. Peköz
SRSheldon M. Ross
Sheldon M. Ross
We consider a random knockout tournament among players 1,…, n, in which each match involves two players. The match format is specified by the number of matches played in each round, where the constitution of the matches in a round is random. Supposing that there are numbers v1,…, vn such that a match between i and j will be won by i with probability vi/(vi + vj), we obtain a lower bound on the tournament win probability for the best player, as well as upper and lower bounds for all of the players. We also obtain additional bounds by considering the best and worst formats for player 1 in the special case v1 > v2 = v3 = … = vn.

1 January 2010 in Probability in the Engineering and Informational Sciences
Verified
Journal Article
Closed access
PDF file
MBMark Brown
Mark Brown
EPErol A. Peköz
Erol A. Peköz
SRSheldon Ross
Sheldon Ross
A random walk that is skip-free to the left can only move down one level at a time but can skip up several levels. Such random walk features prominently in many places in applied probability including queuing theory and the theory of branching processes. This article exploits the special structure in this class of random walk to obtain a number of simplified derivations for results that are much more difficult in general cases. Although some of the results in this article have appeared elsewhere, our proof approach is different.

19 March 2008 in Probability in the Engineering and Informational Sciences
Verified
Journal Article
Closed access
PDF file
MBMark Brown
Mark Brown
EPErol A. Peköz
Erol A. Peköz
SRSheldon Ross
Sheldon Ross
We consider the classical coupon collector's problem in which each new coupon collected is type i with probability pi; ∑i=1npi=1. We derive some formulas concerning N, the number of coupons needed to have a complete set of at least one of each type, that are computationally useful when n is not too large. We also present efficient simulation procedures for determining P(N > k), as well as analytic bounds for this probability.

22 November 2021 in Journal of Applied Probability
Verified
Journal Article
Closed access
PDF file
XFXiao Fang
Xiao Fang
HGHan L. Gan
Han L. Gan
SHSusan Holmes
Susan Holmes
HHHaiyan Huang
Haiyan Huang
EPErol Peköz
Erol Peköz
WTWenpin Tang
Wenpin Tang
A classical result for the simple symmetric random walk with 2nsteps is that the number of steps above the origin, the time of the last visit to the origin, and the time of the maximum height all have exactly the same distribution and converge when scaled to the arcsine law. Motivated by applications in genomics, we study the distributions of these statistics for the non-Markovian random walk generated from the ascents and descents of a uniform random permutation and a Mallows(q) permutation and show that they have the same asymptotic distributions as for the simple random walk. We also give an unexpected conjecture, along with numerical evidence and a partial proof in special cases, for the result that the number of steps above the origin by step 2n for the uniform permutation generated walk has exactly the same discrete arcsine distribution as for the simple random walk, even though the other statistics for these walks have very different laws. We also give explicit error bounds to the limit theorems using Stein’s method for the arcsine distribution, as well as functional central limit theorems and a strong embedding of the Mallows(q) permutation which is of independent interest.