Expander mixing lemma
id:
expander-mixing-lemma-245-10613578
title:
Expander mixing lemma
text:
The expander mixing lemma intuitively states that the edges of certain d -regular graphs are evenly distributed throughout the graph. In particular, the number of edges between two vertex subsets S and T is always close to the expected number of edges between them in a random d -regular graph, namely d n | S | | T | .
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Expander_mixing_lemma
date created:
date modified:
2024-01-12T05:50:29Z
main entity:
{"identifier":"Q5420759","url":"https://www.wikidata.org/entity/Q5420759"}
image:
fields total:
13
integrity:
13