On the greedy walk problem

PELLEGRINOTTI, Central limit theorem for the random walk of one and two particles in a random environment, with mutual interaction, in press. on Advances in Soviet

To complete the proof of Theorem 5.1, we first observe that the genealogy of particles close to the minimal displacement at time n in the branching random walk are either

We propose two families of greedy algorithms for solving MSCP, and suggest improvements to the two greedy algorithms most often referred to in the literature for solving the

Two specific families of subword complexes provide relevant illustrations for this algorithm: on the one hand, this work extends the greedy flip algorithm for

Abstract—In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is

The aim of the four protocols was to increase pedestrians' ability to express their experience in words, in particular to describe the various perceptible elements of the

Next, we show that when the nonlinear object is a non-degenerate state or a degen- erate excited state satisfying a simplicity condition, the convergence holds for all positive

For each order, we specify the watch- man number, domination number, and multiplicity of watchman’s walks, and give the number of tournaments that satisfy the given values of w(T ),