Random Structures & Algorithms
Avoidance of a giant component in half the edge set of a random graph
Random Structures & Algorithms
A phase transition for avoiding a giant component
Random Structures & Algorithms
Combinatorics, Probability and Computing
Random Structures & Algorithms
When does the giant component bring unsatisfiability?
Combinatorica
| Hi-index | 0.00 |
Questions about a graph's connected components are answered by studying appropriate powers of a special "adjacency matrix" constructed with entries in a commutative algebra whose generators are idempotent. The approach is then applied to the Erdös---Rényi model of sequences of random graphs. Developed herein is a method of encoding the relevant information from graph processes into a "second quantization" operator and using tools of quantum probability and infinite-dimensional analysis to derive formulas that reveal the exact values of quantities that otherwise can only be approximated. In particular, the expected size of a maximal connected component, the probability of existence of a component of particular size, and the expected number of spanning trees in a random graph are obtained.