Alexander Iksanov

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 9

Top Topics

Top Venues

J. Appl. Probab.

Publications

Alexander Iksanov, Bohdan Rashytov, Igor Samoilenko
Renewal theory for iterated perturbed random walks on a general branching process tree: Early generations. J. Appl. Probab. 60 (1) (2023)
Vladyslav Bohun, Alexander Iksanov, Alexander Marynych, Bohdan Rashytov
Renewal theory for iterated perturbed random walks on a general branching process tree: intermediate generations. J. Appl. Probab. 59 (2) (2022)
Alexander Iksanov, Bohdan Rashytov
A functional limit theorem for general shot noise processes. J. Appl. Probab. 57 (1) (2020)
Congzao Dong, Alexander Iksanov
Weak convergence of random processes with immigration at random times. J. Appl. Probab. 57 (1) (2020)
Dariusz Buraczewski, Piotr Dyszewski, Alexander Iksanov, Alexander Marynych
On perpetuities with gamma-like tails. J. Appl. Probab. 55 (2) (2018)
Alexander Iksanov, Wissem Jedidi, Fethi Bouzeffour
Functional limit theorems for the number of busy servers in a G/G/∞ queue. J. Appl. Probab. 55 (1) (2018)
Alexander Iksanov, Zakhar Kabluchko
Weak convergence of the number of vertices at intermediate levels of random recursive trees. J. Appl. Probab. 55 (4) (2018)
Gerold Alsmeyer, Dariusz Buraczewski, Alexander Iksanov
Null recurrence and transience of random difference equations in the contractive case. J. Appl. Probab. 54 (4) (2017)
Alexander Iksanov, Zakhar Kabluchko
A central limit theorem and a law of the iterated logarithm for the Biggins martingale of the supercritical branching random walk. J. Appl. Probab. 53 (4) (2016)
Alexander Gnedin, Alexander Iksanov, Alexander Marynych
Λ-coalescents: a survey. J. Appl. Probab. 51 (A) (2014)
Alexander Gnedin, Alexander Iksanov, Alexander Marynych
A Generalization of the Erdős-Turán Law for the Order of Random Permutation. Comb. Probab. Comput. 21 (5) (2012)
Michael Drmota, Alexander Iksanov, Martin Moehle, Uwe Roesler
A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree. Random Struct. Algorithms 34 (3) (2009)