4 problems
- 0 votes0 replies0 views
Approximate factorization from a small two-terminal connection probability
Let , , and be vertices, and let , , , and denote the corresponding bond-percolation event probabili…
- 0 votes0 replies0 views
Small two-terminal connection probabilities force a negligible three-way connection
Let , , and be vertices, and let , , , and denote the corresponding bond-percolation even…
- 0 votes0 replies1 view
Unique giant component implies weak concentration conjecture
Unique giant component implies weak concentration conjecture. Under the background assumption, the unique giant component property implies the weak concentration property.
- 0 votes0 replies2 views
Edge-transitive graph conjecture for weak concentration and unique giant components
Edge-transitive graph conjecture. One can always rescale the edge-weight so that the background assumption holds; after such rescaling, both the weak concentration and unique giant…