Hitting-time and occupation-time bounds implied by drift analysis with applications
From MaRDI portal
Publication:3959243
DOI10.2307/1426671zbMath0495.60094OpenAlexW1983804795MaRDI QIDQ3959243
Publication date: 1982
Published in: Unnamed Author (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1426671
Related Items (72)
Some exponential type bounds for hitting time distributions of storage processes ⋮ Moment conditions for a sequence with negative drift to be uniformly bounded in \(L^r\) ⋮ Tail bounds on hitting times of randomized search heuristics using variable drift analysis ⋮ A survey of the modified Moran process and evolutionary graph theory ⋮ Runtime analysis of non-elitist populations: from classical optimisation to partial information ⋮ Concentration of first hitting times under additive drift ⋮ MMAS versus population-based EA on a family of dynamic fitness functions ⋮ Drift Analysis and Evolutionary Algorithms Revisited ⋮ Does comma selection help to cope with local optima? ⋮ Self-adjusting evolutionary algorithms for multimodal optimization ⋮ A Random Multiple-Access Protocol with Spatial Interactions ⋮ Optimal heavy-traffic queue length scaling in an incompletely saturated switch ⋮ A new approach to estimating the expected first hitting time of evolutionary algorithms ⋮ Distributed communications in collision channels with errors ⋮ Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions ⋮ Erratum: “Transform Methods for Heavy-Traffic Analysis” ⋮ Analysis of noisy evolutionary optimization when sampling fails ⋮ Runtime analysis for self-adaptive mutation rates ⋮ Asymptotically tight steady-state queue length bounds implied by drift conditions ⋮ Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift ⋮ A performance analysis of channel fragmentation in dynamic spectrum access systems ⋮ Fluid limits for an ALOHA-type model with impatient customers ⋮ On Stochastic Stability of a Class of non-Markovian Processes and Applications in Quantization ⋮ Improved time complexity analysis of the simple genetic algorithm ⋮ Stability of adversarial Markov chains, with an application to adaptive MCMC algorithms ⋮ Runtime Analysis of a Co-Evolutionary Algorithm ⋮ Adaptive drift analysis ⋮ Analysis of surrogate-assisted information-geometric optimization algorithms ⋮ Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems ⋮ Uniformly Bounded Regret in the Multisecretary Problem ⋮ Multiplicative drift analysis ⋮ Black-box search by unbiased variation ⋮ Simplified drift analysis for proving lower bounds in evolutionary computation ⋮ Mobility can drastically improve the heavy traffic performance from \(\frac{1}{1-\varrho}\) to \(\log(1/(1-\varrho))\) ⋮ Qualitative properties of \(\alpha\)-fair policies in bandwidth-sharing networks ⋮ Asymptotically exact analysis of a loss network with channel continuity ⋮ Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax ⋮ Approximating fixation probabilities in the generalized Moran process ⋮ Distributed algorithms for QoS load balancing ⋮ Ergodic and adaptive control of nearest-neighbor motions ⋮ Transform Methods for Heavy-Traffic Analysis ⋮ Self-stabilizing repeated balls-into-bins ⋮ Rank-driven Markov processes ⋮ Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint ⋮ Drift analysis of mutation operations for biogeography-based optimization ⋮ On the runtime analysis of the simple genetic algorithm ⋮ The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm ⋮ Equilibria of dynamic games with many players: existence, approximation, and market structure ⋮ Drift analysis and average time complexity of evolutionary algorithms ⋮ Finite dimensional approximation and Newton-based algorithm for stochastic approximation in Hilbert space ⋮ Unnamed Item ⋮ Recent advances in evolutionary computation ⋮ Self-stabilizing balls and bins in batches. The power of leaky bins ⋮ Simulated annealing - to cool or not ⋮ Delay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximations ⋮ On‐line balancing of random inputs ⋮ Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems ⋮ Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links ⋮ Stabilizing an uncertain production system ⋮ The Kumar-Becker-Lin scheme revisited ⋮ An ODE method to prove the geometric convergence of adaptive stochastic algorithms ⋮ Ergodicity properties of rerouting strategies in queueing networks ⋮ Stability of On-Line Bin Packing with Random Arrivals and Long-Run-Average Constraints ⋮ Geometric Ergodicity of the ALOHA-system and a Coupled Processors Model ⋮ First-hitting times under drift ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A certainty equivalence principle based nonlinear separation control rule for random access channels: Stability and delay analysis ⋮ Deposition, diffusion, and nucleation on an interval ⋮ Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies ⋮ Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling ⋮ On the stability of open networks: A unified approach by stochastic dominance
This page was built for publication: Hitting-time and occupation-time bounds implied by drift analysis with applications
