Matches in SemOpenAlex for { <https://semopenalex.org/work/W2186864862> ?p ?o ?g. }
Showing items 1 to 46 of
46
with 100 items per page.
- W2186864862 abstract "Sidorenko’s conjecture states that if H is a bipartite graph then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same order and edge density. It is known to be true for various families of graphs, including trees, even cycles, cubes and bipartite graphs with one vertex complete to the other side. In 2014 Bal azs Szegedy developed a new method for proving Sidorenko’s conjecture for new classes of graphs. He introduces a family of graphs H that admit a probability distribution of copies in an arbitrary graph G obtained by iterating conditionally independent couplings starting from the uniform distribution on edges. As a tool he uses an inclusion exclusion type formula for relative entropy. He claims that the method gives a unied treatment for most known cases of the conjecture and it implies various new results as well. This was part of my master’s thesis." @default.
- W2186864862 created "2016-06-24" @default.
- W2186864862 creator A5089998848 @default.
- W2186864862 date "2014-01-01" @default.
- W2186864862 modified "2023-09-26" @default.
- W2186864862 title "On Sidorenko's Conjecture" @default.
- W2186864862 cites W1510730180 @default.
- W2186864862 cites W1977567472 @default.
- W2186864862 cites W2029361670 @default.
- W2186864862 cites W2036523948 @default.
- W2186864862 cites W2081231159 @default.
- W2186864862 cites W2126244044 @default.
- W2186864862 cites W2745189355 @default.
- W2186864862 cites W2963752244 @default.
- W2186864862 cites W3139863691 @default.
- W2186864862 hasPublicationYear "2014" @default.
- W2186864862 type Work @default.
- W2186864862 sameAs 2186864862 @default.
- W2186864862 citedByCount "2" @default.
- W2186864862 countsByYear W21868648622016 @default.
- W2186864862 countsByYear W21868648622021 @default.
- W2186864862 crossrefType "journal-article" @default.
- W2186864862 hasAuthorship W2186864862A5089998848 @default.
- W2186864862 hasConcept C114614502 @default.
- W2186864862 hasConcept C118615104 @default.
- W2186864862 hasConcept C132525143 @default.
- W2186864862 hasConcept C197657726 @default.
- W2186864862 hasConcept C2780990831 @default.
- W2186864862 hasConcept C33923547 @default.
- W2186864862 hasConcept C47458327 @default.
- W2186864862 hasConcept C80899671 @default.
- W2186864862 hasConceptScore W2186864862C114614502 @default.
- W2186864862 hasConceptScore W2186864862C118615104 @default.
- W2186864862 hasConceptScore W2186864862C132525143 @default.
- W2186864862 hasConceptScore W2186864862C197657726 @default.
- W2186864862 hasConceptScore W2186864862C2780990831 @default.
- W2186864862 hasConceptScore W2186864862C33923547 @default.
- W2186864862 hasConceptScore W2186864862C47458327 @default.
- W2186864862 hasConceptScore W2186864862C80899671 @default.
- W2186864862 hasLocation W21868648621 @default.
- W2186864862 hasOpenAccess W2186864862 @default.
- W2186864862 hasPrimaryLocation W21868648621 @default.
- W2186864862 isParatext "false" @default.
- W2186864862 isRetracted "false" @default.
- W2186864862 magId "2186864862" @default.
- W2186864862 workType "article" @default.