About this document
Functionality of Random Graphs Explained by Carlos is a document available to read on EtoBox.
This document discusses the concept of functionality in random graphs, defining it as the minimum number of vertices needed to uniquely determine the neighborhood of any vertex in induced subgraphs. The authors establish the functionality of random graphs G(n, p) up to a constant factor for all p values and demonstrate that it is maximized around p* = ln(n)/n. The paper also includes results on dominating sets in random bipartite graphs and outlines various proof strategies for their findings.
- Author
- Carlos
- Language
- EN