Additional Information
| Author(s) | Paltanea, Eugen |
|---|
On the asymptotic behaviour of the number of maximum points of a simple random walk
Eugen Paltanea
Abstract
carpathian_2007_23_156_164_abstractFull PDF
carpathian_2007_23_156_164For a sequence (Xi)i≥1 of independent and identically distributed random variables, taking the values -1, 0 and 1, we define S0 = 0 and Sk = Pk i=1 Xi, for k ≥ 1. We study the asymptotic behaviour of the sequence of random variables (Qn)n≥1, where Qn indicates the number of absolute maximum points of the simple random walk S0, S1, · · · , Sn. The paper extends some results of Dwass [2], Rev´ esz [11], Katzenbeisser and Panny [7], [8].
Recently posted
-
Approximate Solutions for Multi-Objective Optimization Problems via Scalarizing and Nonscalarizing Methods
-
A product of strongly quasi-nonexpansive mappings in Hadamard spaces
-
Inertial viscosity fixed point algorithms for monotone inclusion, convex minimization, and image restoration problems
-
Holderian Stability for Parametric Optimization Models and Applications
-
A Novel Fixed-Point Based Two-Step Inertial Algorithm for Convex Bilevel Optimization in Deep Learning Data Classification
-
Double-step inertial algorithms for equilibrium and fixed point problems in Hilbert spaces
-
Accelerated forward-backward algorithm based on inertial and correction terms with linesearch for solving convex minimization problem and its application
-
A Dual-Projective Double Inertial Forward-Backward Splitting Algorithm for Variational Inclusion Problems with Applications to External Validation in Breast Cancer Diagnosis
-
Efficient Large-Scale Classification with Linex Least Square Twin Bounded Support Vector Machine
-
Classifying compressive strength of clay bricks using an inertial projected forward-backward algorithm