Alexander Iksanov

According to our database, Alexander Iksanov authored at least 12 papers between 2009 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Renewal theory for iterated perturbed random walks on a general branching process tree: Early generations.

Alexander Iksanov, Bohdan Rashytov, Igor Samoilenko

J. Appl. Probab., March, 2023

2022

Renewal theory for iterated perturbed random walks on a general branching process tree: intermediate generations.

Vladyslav Bohun, Alexander Iksanov, Alexander Marynych, Bohdan Rashytov

J. Appl. Probab., 2022

2020

A functional limit theorem for general shot noise processes.

Alexander Iksanov, Bohdan Rashytov

J. Appl. Probab., 2020

Weak convergence of random processes with immigration at random times.

Congzao Dong, Alexander Iksanov

J. Appl. Probab., 2020

2018

Weak convergence of the number of vertices at intermediate levels of random recursive trees.

Alexander Iksanov, Zakhar Kabluchko

J. Appl. Probab., 2018

Functional limit theorems for the number of busy servers in a G/G/∞ queue.

Alexander Iksanov, Wissem Jedidi, Fethi Bouzeffour

J. Appl. Probab., 2018

On perpetuities with gamma-like tails.

Dariusz Buraczewski, Piotr Dyszewski, Alexander Iksanov, Alexander Marynych

J. Appl. Probab., 2018

2017

Null recurrence and transience of random difference equations in the contractive case.

Gerold Alsmeyer, Dariusz Buraczewski, Alexander Iksanov

J. Appl. Probab., 2017

2016

A central limit theorem and a law of the iterated logarithm for the Biggins martingale of the supercritical branching random walk.

Alexander Iksanov, Zakhar Kabluchko

J. Appl. Probab., 2016

2014

Λ-coalescents: a survey.

Alexander V. Gnedin, Alexander Iksanov, Alexander Marynych

J. Appl. Probab., 2014

2012

A Generalization of the Erdős-Turán Law for the Order of Random Permutation.

Alexander V. Gnedin, Alexander Iksanov, Alexander Marynych

Comb. Probab. Comput., 2012

2009

A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree.

Michael Drmota, Alexander Iksanov, Martin Möhle, Uwe Roesler

Random Struct. Algorithms, 2009