Alexandre Vladimirov

Alexandre Vladimirov

Auto-generated profile, based on publicly available information

Alexandre Vladimirov

Russian Academy of Sciences

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2018 in Problems of Information Transmission
Verified
Journal Article
Closed access
PDF file
AVA. A. Vladimirov
A. A. Vladimirov
SPS. A. Pirogov
S. A. Pirogov
ARA. N. Rybko
A. N. Rybko
SSS. B. Shlosman
S. B. Shlosman
We establish the strong Poisson hypothesis for symmetric closed networks. In particular, we prove asymptotic independence of nodes as the size of the system tends to infinity.

16 October 2017 in Journal of Physics A: Mathematical and Theoretical
Verified
Journal Article
Closed access
PDF file
EPE Pechersky
E Pechersky
SPS Pirogov
S Pirogov
GSGunter M. Schütz
Gunter M. Schütz
AVA Vladimirov
A Vladimirov
AYAnatoly Yambartsev
Anatoly Yambartsev
We study large fluctuations of emitted radiation in the system of N non-interacting two-level atoms. Two methods are used to calculate the probability of large fluctuations and the time dependence of excitation and emission. The first method is based on the large deviation principle for Markov processes. The second one uses an analogue of the quantum formalism for classical probability problems. Particularly we prove that in a large fluctuation limit approximately half of the atoms are excited. This fact is independent on the fraction of the excited atoms in equilibrium.

1 December 2006 in Problems of Information Transmission
Verified
Journal Article
Closed access
PDF file
AVA. A. Vladimirov
A. A. Vladimirov
ARA. N. Rybko
A. N. Rybko
SSS. B. Shlosman
S. B. Shlosman
We establish an averaging property for a one-server queuing process, M(t)/G/1. It is a new relation between the output flow rate and the input flow rate, crucial in the study of the Poisson hypothesis. Its implications include the statement that the output flow always possesses more regularity than the input flow.

1 January 2013 in Problems of Information Transmission
Verified
Journal Article
Closed access
PDF file
AVA. A. Vladimirov
A. A. Vladimirov
We model the secondary structure of an RNA molecule by means of a maximal non-crossing matching on a random word in a finite alphabet, where ties are only allowed between certain pairs of letters. We prove that the mean fraction of unmatched symbols does not vanish as the length of the word tends to infinity.

1 January 2019 in Moscow Mathematical Journal
Verified
Journal Article
Closed access
EPE. Pechersky
E. Pechersky
SPSergey Pirogov
Sergey Pirogov
GSGunter M. Schütz
Gunter M. Schütz
AVA. Vladimirov
A. Vladimirov
AYAnatoly Yambartsev
Anatoly Yambartsev

1 January 2013 in Discrete and Continuous Dynamical Systems-Series B
Verified
Journal Article
Open access
PDF file
AVAlexander Vladimirov
Alexander Vladimirov
We prove that the sweeping process on a "regular" class of convex sets is equicontinuous. Classes of polyhedral sets with a given finite set of normal vectors are regular, as well as classes of uniformly strictly convex sets. Regularity is invariant to certain operations on classes of convex sets such as intersection, finite union, arithmetic sum and affine transformation.