Related papers: Strongly vertex-reinforced jump process on graphs …
We propose a model of network formation based on reinforcement learning, which can be seen as a generalization as the one proposed by Skyrms for signaling games. On a discrete graph, whose vertices represent individuals, at any time step…
If we know that some kind of sequence always converges, we can ask how quickly and how uniformly it converges. Many convergent sequences converge non-uniformly and, relatedly, have no computable rate of convergence. However proof-theoretic…
We characterize non-decreasing weight functions for which the associated one-dimensional vertex reinforced random walk (VRRW) localizes on 4 sites. A phase transition appears for weights of order $n\log \log n$: for weights growing faster…
We consider a class of jump processes in euclidean space which are associated to a certain non-local symmetric Dirichlet form. We prove a lower bound on the occupation times of sets, and that a support theorem holds for these processes.
We prove new explicit inapproximability results for the Vertex Cover Problem on the Power Law Graphs and some functional generalizations of that class of graphs. Our results depend on special bounded degree amplifier constructions for those…
Consider a system of interacting particles indexed by the nodes of a graph whose vertices are equipped with marks representing parameters of the model such as the environment or initial data. Each particle takes values in a countable state…
We prove that Vertex Reinforced Random Walk on $\mathbb{Z}$ with weight of order $k^\alpha$, with $\alpha\in [0,1/2)$, is either almost surely recurrent or almost surely transient. This improves a previous result of Volkov who showed that…
We consider a random walk process which prefers to visit previously unvisited edges, on the random $r$-regular graph $G_r$ for any odd $r\geq 3$. We show that this random walk process has asymptotic vertex and edge cover times…
We study the condensation regime of the finite reversible inclusion process, i.e., the inclusion process on a finite graph $S$ with an underlying random walk that admits a reversible measure. We assume that the random walk kernel is…
We study an iterated temporal and contemporaneous aggregation of $N$ independent copies of a strongly stationary subcritical Galton-Watson branching process with regularly varying immigration having index $\alpha \in (0, 2)$. Limits of…
We investigate the asymptotic behaviour of a class of self-interacting nearest neighbour random walks on the one-dimensional integer lattice which are pushed by a particular linear combination of their own local time on edges in the…
We study finite particle systems on the one-dimensional integer lattice, where each particle performs a continuous-time nearest-neighbour random walk, with jump rates intrinsic to each particle, subject to an exclusion interaction which…
We study a new class of preferential attachment trees with \emph{self-reinforcement}. At each time, each vertex is assigned a weight equal to the cumulative sum over past times of an affine function of its degree. A new vertex attaches…
We consider a finite collection of reinforced stochastic processes with a general network-based interaction among them. We provide sufficient and necessary conditions in order to have some form of almost sure asymptotic synchronization,…
We introduce a simple but powerful technique to study processes driven by two or more reinforcement mechanisms in competition. We apply our method to two types of models: to non conservative zero range processes on finite graphs, and to…
We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…
We consider a class of jump-diffusion processes, constrained to a polyhedral cone $G\subset\R^n$, where the constraint vector field is constant on each face of the boundary. The constraining mechanism corrects for ``attempts'' of the…
Real networks are often dynamic. In response to it, analyses of algorithms on {\em dynamic networks} attract more and more attentions in network science and engineering. Random walks on dynamic graphs also have been investigated actively in…
The paper deals with the asymptotic properties of a random jump process in a high contrast periodic medium in $\mathbb R^d$, $d\geq 1$. We show that if the coordinates of the random jump process in $\mathbb R^d$ are equipped with an extra…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…