Related papers: Stochastic modeling of a serial killer
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we focus on the problem of sampling random walks efficiently in a…
We study the limit behaviour of a class of random walk models taking values in the $d$-dimensional unit standard simplex, $d\ge 1$, defined as follows. From an interior point $z$, the process chooses one of the $d+1$ vertices of the…
We introduce a stochastic model to explain a double power-law distribution which exhibits two different Paretian behaviors in the upper and the lower tail and widely exists in social and economic systems. The model incorporates fitness…
We study two random processes on an $n$-vertex graph inspired by the internal diffusion limited aggregation (IDLA) model. In both processes $n$ particles start from an arbitrary but fixed origin. Each particle performs a simple random walk…
We consider a directed version of the classical Stochastic Block Model with $m\ge 2$ communities and a parameter $\alpha$ controlling the inter-community connectivity. We show that, depending on the scaling of $\alpha$, the mixing time of…
We study the long-time behavior of the scaled walker (particle) position associated with decoupled continuous-time random walk which is characterized by superheavy-tailed distribution of waiting times and asymmetric heavy-tailed…
Projects are characterised by activity networks with a critical path, a sequence of activities from start to end, that must be finished on time to complete the project on time. Watching over the critical path is the project manager's…
A continuously measured quantum system with multiple jump channels gives rise to a stochastic process described by random jump times and random emitted symbols, representing each jump channel. While much is known about the waiting time…
We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…
Queueing theory has been recently proposed as a framework to model the heavy tailed statistics of human activity patterns. The main predictions are the existence of a power-law distribution for the interevent time of human actions and two…
This study examines how the fate of a perpetrator in a public mass shooting influences the fate of subsequent perpetrators. Using data from 1966 to 2024, we classify incidents according to whether the perpetrator died at the scene or…
Continuous time random Walk model has been versatile analytical formalism for studying and modeling diffusion processes in heterogeneous structures, such as disordered or porous media. We are studying the continuous limits of Heterogeneous…
Crime remains one of the significant problems that countries are grappling with globally. With shrinking economies and increasing poverty, crime has been on the rise in many countries. In this paper, we propose a system of non-linear…
We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…
We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…
Human brain contains about 10 billion neurons, each of which has about 10~10,000 nerve endings from which neurotransmitters are released in response to incoming spikes, and the released neurotransmitters then bind to receptors located in…
We consider a stochastic individual based model where each predator searches during a random time and then manipulates its prey or rests. The time distributions may be non-exponential. An age structure allows to describe these interactions…
A second-order random walk on a graph or network is a random walk where transition probabilities depend not only on the present node but also on the previous one. A notable example is the non-backtracking random walk, where the walker is…
Containing the spreading of crime is a major challenge for society. Yet, since thousands of years, no effective strategy has been found to overcome crime. To the contrary, empirical evidence shows that crime is recurrent, a fact that is not…
We consider a system of $N$ particles on the real line that evolves through iteration of the following steps: 1) every particle splits into two, 2) each particle jumps according to a prescribed displacement distribution supported on the…