Sharpness of Percolation Phase Transition in Weighted Random Connection Models
Research Paper#Percolation Theory, Network Science, Random Graphs🔬 Research|Analyzed: Jan 4, 2026 00:10•
Published: Dec 25, 2025 17:14
•1 min read
•ArXivAnalysis
This paper investigates the sharpness of the percolation phase transition in a class of weighted random connection models. It's significant because it provides a deeper understanding of how connectivity emerges in these complex systems, particularly when weights and long-range connections are involved. The results are important for understanding the behavior of networks with varying connection strengths and spatial distributions, which has applications in various fields like physics, computer science, and social sciences.
Key Takeaways
- •Establishes the sharpness of the percolation phase transition for weighted random connection models.
- •Considers models with unbounded weights and long-range connections.
- •Provides insights into the behavior of networks with varying connection strengths and spatial distributions.
Reference / Citation
View Original"The paper proves that in the subcritical regime the cluster-size distribution has exponentially decaying tails, whereas in the supercritical regime the percolation probability grows at least linearly with respect to λ near criticality."