We examine in this work the following graph theory problem that arises in neural computations that involve the learning of boolean expressions by studying the asymptotic connectivity properties of $G_{n\comma 1/\lpar kn\rpar ^{1/2}}$ random graphs, where k is a fixed positive integer. For an undirected graph $G = \lpar V\comma \; E\rpar $ let $N\lpar X\comma \; Y\rpar = \lcub v \in V - \lpar X \cup Y\rpar \!\mid$ $ \exists x \in X\ \hbox{with}\ \lpar v\comma \; x\rpar \in E\rcub $ . For fixed k construct an undirected graph $G = \lpar V\comma \; E\rpar $ such that for all disjoint sets $A\comma \; B \subseteq V$ such that $\vert A \vert = \vert B \vert = k$ , and $C = N\lpar A\comma \; B\rpar \cap N\lpar B\comma \; A\rpar $ , set C is such that $\vert C \vert$ is either exactly k or as close to k as possible. Asymptotic results for large values of k are also presented.
Random Graphs In A Neural Computation Model
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.