Related papers: Space-time percolation and detection by mobile nod…
In the spherical Poisson Boolean model, one takes the union of random balls centred on the points of a Poisson process in Euclidean $d$-space with $d \geq 2$. We prove that whenever the radius distribution has a finite $d$-th moment, there…
Given a set of detections, detected at each time instant independently, we investigate how to associate them across time. This is done by propagating labels on a set of graphs, each graph capturing how either the spatio-temporal or the…
We study quantum percolation which is described by a tight-binding Hamiltonian containing only off-diagonal hopping terms that are generally in quenched binary disorder (zero or one). In such a system, transmission of a quantum particle is…
In first-passage percolation, one places nonnegative i.i.d. random variables (T(e)) on the edges of Z^d. A geodesic is an optimal path for the passage times T(e). Consider a local property of the time environment. We call it a pattern. We…
In wireless networks, the knowledge of nodal distances is essential for several areas such as system configuration, performance analysis and protocol design. In order to evaluate distance distributions in random networks, the underlying…
We consider the moving particle process in Rd which is defined in the following way. There are two independent sequences (Tk) and (dk) of random variables. The variables Tk are non negative and form an increasing sequence, while variables…
We study reaction-diffusion particle systems with several interaction mechanisms. As the number of particles tends to infinity, the system admits a mean-field limit describing the bulk behaviour. We focus on determining the propagation…
Percolation theory concerns the emergence of connected clusters that percolate through a networked system. Previous studies ignored the effect that a node outside the percolating cluster may actively induce its inside neighbours to exit the…
We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…
We reconsider the problem of diffusion of particles at constant speed and present a generalization of the Telegrapher process to higher dimensional stochastic media ($d>1$), where the particle can move along $2^d$ directions. We derive the…
The problem of the time required for a diffusing molecule, within a large bounded domain, to first locate a small target is prevalent in biological modeling. Here we study this problem for a small spherical target. We develop uniform in…
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…
The spread of PM2.5 pollutants that endanger health is difficult to predict because it involves many atmospheric variables. These micron particles can spread rapidly from their source to residential areas, increasing the risk of respiratory…
The event graph representation of temporal networks suggests that the connectivity of temporal structures can be mapped to a directed percolation problem. However, similar to percolation theory on static networks, this mapping is valid…
We consider navigation schemes on planar diluted lattices and semi lattices with one discrete and one continuous component. More precisely, nodes that survive inhomogeneous Bernoulli site percolation, or are placed as inhomogeneous Poisson…
In the domain of large foundation models, the Segment Anything Model (SAM) has gained notable recognition for its exceptional performance in image segmentation. However, tackling the video camouflage object detection (VCOD) task presents a…
The aim of this paper is to analyze a class of random motions which models the motion of a particle on the real line with random velocity and subject to the action of the friction. The speed randomly changes when a Poissonian event occurs.…
In real networks, the dependency between nodes is ubiquitous; however, the dependency is not always complete and homogeneous. In this paper, we propose a percolation model with weak and heterogeneous dependency; i.e., dependency strengths…
First passage percolation on $\mathbb{Z}^2$ is a model for describing the spread of an infection on the sites of the square lattice. The infection is spread via nearest neighbor sites and the time dynamic is specified by random passage…
Every realistic instance of a percolation problem is faced with some degree of polydispersity, e.g., the pore-size distribution of an inhomogeneous medium, the size distribution of filler particles in composite materials, or the vertex…