Related papers: Chase-escape on the configuration model
We study an interacting particle system of a finite number of labelled particles on the integer lattice, in which particles have intrinsic masses and left/right jump rates. If a particle is the minimal-label particle at its site when it…
This paper is concerned with one kind of partially observed progressive optimal control problems of coupled forward-backward stochastic systems driven by both Brownian motion and Poisson random measure with risk-sensitive criteria. The…
We perform molecular dynamics simulation of a small number of particles in a box with periodic boundary conditions from a view point of chaotic dynamical systems. There is a transition at a critical energy E_c that each particle is confined…
The narrow escape problem is a first-passage problem concerned with randomly moving particles in a physical domain, being trapped by absorbing surface traps (windows), such that the measure of traps is small compared to the domain size. The…
The energy level statistics of uniform random graphs are studied, by treating the graphs as random tight-binding lattices. The inherent random geometry of the graphs and their dynamical spatial dimensionality, leads to various quantum…
The location and nature of the percolation transition in random networks is a subject of intense interest. Recently, a series of graph evolution processes have been introduced that lead to discontinuous percolation transitions where the…
Due to their conceptual and mathematical simplicity, Erd\"os-R\'enyi or classical random graphs remain as a fundamental paradigm to model complex interacting systems in several areas. Although condensation phenomena have been widely…
We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength b_c exists such that most walks find the target within a finite time when b>b_c. For b<b_c,…
The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…
We consider a system of ordered cars moving in $\R$ from right to left. Each car is represented by a point in $\R$; two or more cars can occupy the same point but cannot overpass. Cars have two possible velocities: either 0 or 1. An…
The discrepancy between the upper bound on throughput in wireless networks and the throughput scaling in random networks which is also known as the connectivity-throughput trade-off is analyzed. In a random network with $\lambda$ nodes per…
Stochastic processes can model many emerging phenomena on networks, like the spread of computer viruses, rumors, or infectious diseases. Understanding the dynamics of such stochastic spreading processes is therefore of fundamental interest.…
We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…
In this paper we consider a telegraph equation with time-dependent coefficients, governing the persistent random walk of a particle moving on the line with a time-varying velocity $c(t)$ and changing direction at instants distributed…
In this article, we study the maximal displacement of critical branching random walk in random environment. Let $M_n$ be the maximal displacement of a particle in generation $n$, and $Z_n$ be the total population in generation $n$, $M$ be…
In this work we consider a one-dimensional Brownian motion with constant drift moving among a Poissonian cloud of obstacles. Our main result proves convergence of the law of processes conditional on survival up to time $t$ as $t$ converges…
In this paper, a partially observed stochastic linear Stackelberg differential game with mean-variance criteria is studied. Randomness comes from Brownian motions and Poisson random measures. which leads to a circular dependency. We follow…
We investigate hide-and-seek games on complex networks using a random walk framework. Specifically, we investigate the efficiency of various degree-biased random walk search strategies to locate items that are randomly hidden on a subset of…
We investigate a branching random walk where the displacements are independent from the branching mechanism and have a stretched exponential distribution. We describe the positions of the particles in the vicinity of the rightmost particle…
A growing random graph is constructed by successively sampling without replacement an element from the pool of virtual vertices and edges. At start of the process the pool contains $N$ virtual vertices and no edges. Each time a vertex is…