Connected components and evolution of random graphs: An algebraic approach

DOI10.1007/s10801-011-0297-1zbMath1233.05187OpenAlexW2022687970MaRDI QIDQ658541

René Schott, George Stacey Staples

Publication date: 12 January 2012

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-011-0297-1

zbMATH Keywords

random graphsquantum probabilitygraph processes

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• When does the giant component bring unsatisfiability?
• Edge disjoint spanning trees in random graphs
• Connected components in random graphs with given expected degree sequences
• Hitting time for \(k\) edge-disjoint spanning trees in a random graph
• Clifford-algebraic random walks on the hypercube
• Avoiding a giant component
• Quantum Probabilistic Approach to Spectral Analysis of Star Graphs
• The Evolution of Random Graphs
• MONOTONE INDEPENDENCE, COMB GRAPHS AND BOSE–EINSTEIN CONDENSATION
• Central limit theorems for large graphs: Method of quantum decomposition
• Creating a Giant Component
• Nilpotent adjacency matrices, random graphs and quantum random variables
• A phase transition for avoiding a giant component
• Embracing the giant component

This page was built for publication: Connected components and evolution of random graphs: An algebraic approach