Related papers: Strongly vertex-reinforced jump process on graphs …

We describe and analyze how reinforced random walks can eventually localize, i.e. only visit finitely many sites. After introducing vertex and edge self-interacting walks on a discrete graph in a general setting, and stating the main…

We consider a random walk on a multidimensional integer lattice with random bounds on local times, conditioned on the event that it hits a high level before its death. We introduce an auxiliary "core" process that has a regenerative…

This paper derives the asymptotic behavior of realized power variation of pure-jump It\^{o} semimartingales as the sampling frequency within a fixed interval increases to infinity. We prove convergence in probability and an associated…

We analyze the stationary tail of a fixed-point equation arising in branching processes with state-independent immigration, when both immigration and offspring distributions have heavy tails with boundary index one. We prove that \[ P(X >…

This work deals with systems of interacting reinforced stochastic processes, where each process $X^j=(X_{n,j})_n$ is located at a vertex $j$ of a finite weighted direct graph, and it can be interpreted as the sequence of "actions" adopted…

We study the asymptotic behaviour of once-reinforced biased random walk (ORbRW) on Galton-Watson trees. Here the underlying (unreinforced) random walk has a bias towards or away from the root. We prove that in the setting of multiplicative…

We study the large time behavior of the survival probability $\mathbb{P}_x\left(\tau_D>t\right)$ for symmetric jump processes in unbounded domains with a positive bottom of the spectrum. We prove asymptotic upper and lower bounds with…

We investigate extreme value statistics (EVS) of general discrete time and continuous space symmetric jump processes. We first show that for unbounded jump processes, the semi-infinite propagator $G_0(x,n)$, defined as the probability for a…

We prove that vertex-reinforced random walk on the integers with weight of order k to the power alpha, for alpha in [0, 1/2), is recurrent. This confirms a conjecture of Volkov for alpha<1/2. The conjecture for alpha in [1/2, 1) remains…

We consider a branching stable process with positive jumps, i.e. a continuous-time branching process in which the particles evolve independently as stable L{\'e}vy processes with positive jumps. Assuming the branching mechanism is critical…

We define infinitesimal gradient boosting as a limit of the popular tree-based gradient boosting algorithm from machine learning. The limit is considered in the vanishing-learning-rate asymptotic, that is when the learning rate tends to…

For a Dawson-Watanabe superprocess $X$ on $\mathbb{R}^d$, it is shown in Perkins (1990) that if the underlying spatial motion belongs to a certain class of L\'evy processes that admit jumps, then with probability one the closed support of…

For a Dawson-Watanabe superprocess $X$ on $\mathbb{R}^d$, it is shown in Perkins (1990) that if the underlying spatial motion belongs to a certain class of L\'evy processes that admit jumps, then with probability one the closed support of…

Repair operators are often used for constraint handling in constrained combinatorial optimization. We investigate the (1+1)~EA equipped with a tailored jump-and-repair operation that can be used to probabilistically repair infeasible…

We introduce a one-dimensional random walk, which at each step performs a reinforced dynamics with probability $\theta$ and with probability $1 - \theta$, the random walk performs a step independent of the past. We analyse its asymptotic…

We explore the supercritical phase of the vertex-reinforced jump process (VRJP) and the $\mathbb{H}^{2|2}$-model on rooted regular trees. The VRJP is a random walk, which is more likely to jump to vertices on which it has previously spent a…

We consider a recurrent random walk of i.i.d. increments on the one-dimensional integer lattice and obtain a formula relating the hitting distribution of a half-line with the potential function, $a(x)$, of the random walk. Applying it, we…

This paper is a further study of Reference \cite{Xue2015}. We are concerned with the contact process with random vertex weights on the oriented lattice. Our main result gives the asymptotic behavior of the survival probability of the…

We study the problems of bounding the number weak and strong independent sets in $r$-uniform, $d$-regular, $n$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up…

It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…