1 citations · 1 across the 1 of their papers we have counts for
6 papers
On discrete-time arrival processes and related random motions
Giuseppe D'Onofrio, Thomas M. Michelitsch, Federico Polito +1
We consider three kinds of discrete-time arrival processes: transient, intermediate and recurrent, characterized by a finite, possibly finite and infinite number of events, respect…
Encounter times of random walkers with simultaneous resetting on networks
Cristian D. Suarez-Jimenez, Alejandro P. Riascos, Denis Boyer
In this work, we study the dynamics of multiple random walkers on networks subject to a simultaneous resetting protocol, whereby all walkers are synchronously returned to their res…
Evanescent random walker on networks: Hitting times, budget renewal, and survival dynamics
Thomas M. Michelitsch, Alejandro P. Riascos
We consider a mortal random walker evolving with discrete time on a network, where transitions follow a degree-biased Markovian navigation strategy. The walker starts with a random…
Stochastic Compartment Model of Epidemic Spreading in Complex Networks with Mortality and Resetting
Thomas M. Michelitsch, Bernard Collet, Michael Bestehorn +2
We propose an epidemic compartment model, which includes mortality caused by the disease, but excludes demographic birth and death processes. Individuals are represented by random…
From random walks to epidemic spreading: Compartment model with mortality for vector transmitted diseases
Téo Granger, Thomas M. Michelitsch, Bernard A. Collet +2
We propose a compartmental model for vector-transmitted diseases, such as Malaria and Dengue, spreading over complex networks. Individuals are represented by independent random wal…
Random walks with stochastic resetting in complex networks: a discrete time approach
Thomas M. Michelitsch, Giuseppe D'Onofrio, Federico Polito +1
We consider a discrete-time Markovian random walk with resets on a connected undirected network. The resets, in which the walker is relocated to randomly chosen nodes, are governed…