The following pages link to Erol A. Peköz (Q191737):
Displaying 40 items.
- Exponential approximation for the nearly critical Galton-Watson process and occupation times of Markov chains (Q428522) (← links)
- Generalized gamma approximation with rates for urns, walks and trees (Q726793) (← links)
- Ignatov's theorem and correlated record values (Q1293833) (← links)
- Stein's method and approximating the quantum harmonic oscillator (Q1715521) (← links)
- Pólya urns with immigration at random times (Q1715527) (← links)
- Optimal policies for multi-server non-preemptive priority queues (Q1851011) (← links)
- Degree asymptotics with rates for preferential attachment random graphs (Q1950267) (← links)
- Total variation error bounds for geometric approximation (Q1952436) (← links)
- Concentration inequalities from monotone couplings for graphs, walks, trees and branching processes (Q2169063) (← links)
- Exponential and Laplace approximation for occupation statistics of branching random walk (Q2184621) (← links)
- New rates for exponential approximation and the theorems of Rényi and Yaglom (Q2431519) (← links)
- SOME RESULTS FOR SKIP-FREE RANDOM WALK (Q3087800) (← links)
- (Q3094155) (← links)
- A Three-Parameter Binomial Approximation (Q3402059) (← links)
- HEAVY TRAFFIC LIMITS VIA BROWNIAN EMBEDDINGS (Q3422736) (← links)
- COUPON COLLECTING (Q3503174) (← links)
- Relating Time and Customer Averages for Queues Using ‘forward’ Coupling from the Past (Q3516428) (← links)
- Characterizing losses during busy periods in finite buffer systems (Q4408545) (← links)
- Some memoryless bandit policies (Q4408546) (← links)
- MORE ON USING FORCED IDLE TIME TO IMPROVE PERFORMANCE IN POLLING MODELS (Q4488673) (← links)
- COMPOUND RANDOM VARIABLES (Q4673890) (← links)
- Stein's method for geometric approximation (Q4716096) (← links)
- Poisson traffic flow in a general feedback queue (Q4805845) (← links)
- A simple derivation of exact reliability formulas for linear and circular consecutive-<i>k</i>-of-<i>n</i>: <i>F</i> systems (Q4842829) (← links)
- (Q4945025) (← links)
- A note on reliability bounds via conditional inequalities (Q4954255) (← links)
- ON THE NUMBER OF REFUSALS IN A BUSY PERIOD (Q4955520) (← links)
- Arcsine laws for random walks generated from random permutations with applications to genomics (Q5014297) (← links)
- DUELING BANDIT PROBLEMS (Q5051170) (← links)
- BLOCKCHAIN DOUBLE-SPEND ATTACK DURATION (Q5051944) (← links)
- Fair gambler’s ruin stochastically maximizes playing time (Q5084798) (← links)
- Is reliability a new science? A paper from the panel session held at the 10th International Conference on Mathematical Methods in Reliability (Q5213957) (← links)
- Joint degree distributions of preferential attachment random graphs (Q5233172) (← links)
- A monotonicity result for a G/GI/<i>c</i> queue with balking or reneging (Q5441536) (← links)
- Policies without Memory for the Infinite-Armed Bernoulli Bandit under the Average-Reward Criterion (Q5485352) (← links)
- Estimating the Mean Cover Time of a Semi-Markov Process via Simulation (Q5488529) (← links)
- A Compound Poisson Approximation Inequality (Q5489007) (← links)
- How Nearly do Arriving Customers See Time-Average Behavior? (Q5504153) (← links)
- A Random Permutation Model Arising in Chemistry (Q5504161) (← links)
- Inequalities for queues with a learning server (Q5938451) (← links)
