REVIEW 2 cited by
Absence of percolation for infinite Poissonian systems of stopped paths
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops growing at time t \> 0 if it hits the trace of the other curves realized up until time t. Such dynamic is well-defined as long as the distribution of paths has a finite second moment at each time t \> 0. Letting the time runs until infinity so that each path reaches its stopping curve, we study the connected property of the graph formed by all stopped curves. Our main result states the absence of percolation in this graph, meaning that each cluster consists of a finite number of curves. The assumptions on the distribution of paths are very mild, with the main one being the so-called 'loop assumption' which ensures that finite clusters (necessarily containing a loop) occur with positive probability. The main issue in this model comes from the long-range dependence arising from long sequences of causalities in the hitting/stopping procedure. Most methods based on block approaches fail to effectively address the question of percolation in this setting.
Forward citations
Cited by 2 Pith papers
-
The $K$-th nearest neighbor random walk on a Poisson point process gets trapped
The K-th nearest neighbor random walk on a homogeneous Poisson point process visits finitely many points if and only if K has bounded support, with exponential decay in visits and path length, plus a polynomial-tail c...
-
VUDA: Breaking CUDA-Vulkan Isolation for Spatial Sharing of Compute and Graphics on the Same GPU
VUDA enables spatial sharing between CUDA and Vulkan on GPUs via channel redirection and page-table grafting, achieving up to 85% higher throughput than temporal baselines in embodied AI tasks.
Discussion (0). Sign in to comment.