A Random-Line-Graph Approach to Overlapping Line Segments
arXiv:1911.10679 · doi:10.1093/comnet/cnaa029
Abstract
We study graphs that are formed by independently-positioned needles (i.e., line segments) in the unit square. To mathematically characterize the graph structure, we derive the probability that two line segments intersect and determine related quantities such as the distribution of intersections, given a certain number of line segments . We interpret intersections between line segments as nodes and connections between them as edges in a spatial network that we refer to as random-line graph (RLG). Using methods from the study of random-geometric graphs, we show that the probability of RLGs to be connected undergoes a sharp transition if the number of lines exceeds a threshold .
7 pages, 4 figures
References in corpus (11)
- Continuum Percolation Thresholds in Two Dimensions
- Network Analysis of Particles and Grains
- Continuum percolation of wireless ad hoc communication networks
- Opinion Polarization by Learning from Social Feedback
- Networks and Hierarchies: How Amorphous Materials Learn to Remember
- Forecasting failure locations in two-dimensional disordered lattices
- Topological data analysis of continuum percolation with disks
- Random Rectangular Graphs
- Controlling fracture cascades through twisting and quenching
- Immigration-induced phase transition in a regulated multispecies birth-death process
- Random-Graph Models and Characterization of Granular Networks