Researchers study how random connections affect graph connectivity and movement
A study examines how retaining edges with probability affects the geometry and transport of band random graphs.
Researchers studied the connectivity, geometry, and transport of band random graphs. These graphs are random subgraphs of the cycle power .
The model retains each edge independently with probability . The study looks at the regime where .
A sharp threshold for connectivity occurs when . If , the number of isolated vertices converges to .
With high probability, every other vertex lies in a single component . This component contains a cyclic chain of connected sets. The diameter has order with high probability.
The mean hitting time of a simple random walk satisfies a specific equation. This equation involves the cyclic distance , the degree , and .
Connectivity follows Erdős--Rényi asymptotics with possible neighbours. However, distances, relaxation, and hitting times retain the geometry of the underlying cycle.
Key facts
- The connectivity threshold is .
- The diameter of the main component is of order .
- The mean hitting time depends on the cyclic distance and the degree .