MVMarina Vachkovskaia

Marina Vachkovskaia

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Marina Vachkovskaia has a total of 41 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On the range of a two-dimensional conditioned simple random walk

    by Nina Gantert, Serguei Popov, Marina Vachkovskaia

    We consider the two-dimensional simple random walk conditioned on never hitting the origin. This process is a Markov chain, namely it is the Doob $h$-transform of the simple random walk with respect to the potential kernel. It is known to be transient and we show that it is "almost recurrent" in the sense that each infinite set is visited infinitely often, almost surely. We prove that, for a "large" set, the proportion of its sites visited by the conditioned walk is approximately a Uniform$[0,1]$ random variable. Also, given a set $G\subset\mathbb{R}^2$ that does not "surround" the origin, we prove that a.s.\ there is an infinite number of $k$'s such that $kG\cap \mathbb{Z}^2$ is unvisited. These results suggest that the range of the conditioned walk has "fractal" behavior.

  • Open Access

    Localisation in a Growth Model with Interaction

    by M. Costa, M. Menshikov, V. Shcherbakov, M. Vachkovskaia


  • Open Access

    Localisation in a growth model with interaction

    by Marcelo Costa, Mikhail Menshikov, Vadim Shcherbakov, Marina Vachkovskaia

    This paper concerns the long term behaviour of a growth model describing a random sequential allocation of particles on a finite cycle graph. The model can be regarded as a reinforced urn model with graph-based interactions. It is motivated by cooperative sequential adsorption, where adsorption rates at a site depend on the configuration of existing particles in the neighbourhood of that site. Our main result is that, with probability one, the growth process will eventually localise either at a single site, or at a pair of neighbouring sites.

  • Open Access

    Constrained information transmission on Erdös-Rényi graphs

    by Francis Comets, Christophe Gallesco, Serguei Popov, Marina Vachkovskaia

    We model the transmission of information of a message on the Erd\"os-R\'eny random graph with parameters $(n,p)$ and limited resources. The vertices of the graph represent servers that may broadcast a message at random. Each server has a random emission capital that decreases by one at each emission. We examine two natural dynamics: in the first dynamics, an informed server performs its attempts, then checks at each of them if the corresponding edge is open or not; in the second dynamics the informed server knows a priori who are its neighbors, and it performs all its attempts on its actual neighbors in the graph. In each case, we obtain first and second order asymptotics (law of large numbers and central limit theorem), when $n\to \infty$ and $p$ is fixed, for the final proportion of informed servers.

  • Open Access

    Two-dimensional random interlacements and late points for random walks

    by Francis Comets, Serguei Popov, Marina Vachkovskaia

    We define the model of two-dimensional random interlacements using simple random walk trajectories conditioned on never hitting the origin, and then obtain some properties of this model. Also, for random walk on a large torus conditioned on not hitting the origin up to some time proportional to the mean cover time, we show that the law of the vacant set around the origin is close to that of random interlacements at the corresponding level. Thus, this new model provides a way to understand the structure of the set of late points of the covering process from a microscopic point of view.

  • Open Access

    Dynamical systems with heavy-tailed random parameters

    by Vladimir Belitsky, Mikhail Menshikov, Dimitri Petritis, Marina Vachkovskaia

    Motivated by the study of the time evolution of random dynamical systems arising in a vast variety of domains --- ranging from physics to ecology ---, we establish conditions for the occurrence of a non-trivial asymptotic behaviour for these systems in the absence of an ellipticity condition. More precisely, we classify these systems according to their type and --- in the recurrent case --- provide with sharp conditions quantifying the nature of recurrence by establishing which moments of passage times exist and which do not exist. The problem is tackled by mapping the random dynamical systems into Markov chains on $\mathbb{R}$ with heavy-tailed innovation and then using powerful methods stemming from Lyapunov functions to map the resulting Markov chains into positive semi-martingales.

  • Open Access

    On large deviations for the cover time of two-dimensional torus

    by Francis Comets, Christophe Gallesco, Serguei Popov, Marina Vachkovskaia

    Let $\mathcal{T}_n$ be the cover time of two-dimensional discrete torus $\mathbb{Z}^2_n=\mathbb{Z}^2/n\mathbb{Z}^2$. We prove that $\mathbb{P}[\mathcal{T}_n\leq \frac{4}{\pi}\gamma n^2\ln^2 n]=\exp(-n^{2(1-\sqrt{\gamma})+o(1)})$ for $\gamma\in (0,1)$. One of the main methods used in the proofs is the decoupling of the walker's trace into independent excursions by means of soft local times.

    • 14 June 2013
    • Published by HAL in HAL
    Open Access

    On large deviations for the cover time of two-dimensional torus

    by Francis Comets, Christophe Gallesco, Serguei Popov, Marina Vachkovskaia

    Let Tn be the cover time of two-dimensional discrete torus Z2 n = Z2=nZ2. We prove that P[Tn 4 n2 ln2 n] = exp(n2(1 p )+o(1)) for 2 (0; 1). One of the main methods used in the proofs is the decou- pling of the walker's trace into independent excursions by means of soft local times.

  • Open Access

    A conditional quenched CLT for random walks among random conductances on $\mathbb{Z}^d$

    by Christophe Gallesco, Nina Gantert, Serguei Popov, Marina Vachkovskaia

    Consider a random walk among random conductances on $\mathbb{Z}^d$ with $d\geq 2$. We study the quenched limit law under the usual diffusive scaling of the random walk conditioned to have its first coordinate positive. We show that the conditional limit law is the product of a Brownian meander and a $(d-1)$-dimensional Brownian motion.