Gergen Lectures, Spring_2014
https://services.math.duke.edu/mcal?listgroup-6
Gergen Lectures Upcoming Seminarsen-us2024-03-29T08:21:19-04:00https://services.math.duke.edu/mcal2024-01-01T12:00:00-05:002dailyGeometric representations of graphs
https://services.math.duke.edu/mcal?abstract-8624
o represent a graph by a nice geometric picture is a
natural goal in itself, but in addition it is an important
tool in the study of various graph properties and in the
design of graph algorithms. We survey several forms of this
interplay between graph algorithms and geometry: algorithms
for perfect graphs, maximum cut, connectivity, bandwidth. We
discuss how to use a representation obtained from the
adjacency matrix to compute an almost optimal weak
regularity partition in constant time in the property
testing model.
For more info :
<a href="See http://www.cs.duke.edu/events/?id=00000001715">Triangle Computer Science Distinguished Lecturer Series</a>Laszlo Lovasz (Eötvös Loránd University)2014-03-03T16:00:00-05:008624Gergen LecturesTriangle Computer Science Distinguished Lecturer SeriesMon, 03 Mar 2014 17:00:00 ESTMon, 03 Mar 2014 16:00:00 ESTSpring, 2014D106 LSRC, DukeMonday, March 3, 2014, 4:00pmLarge networks, graph limits, and why are they useful
https://services.math.duke.edu/mcal?abstract-8602
If you have a very large network (which may be deterministic or the
result of some random procedure), we may want to approximate it by a
smaller object, or by an infinite (analytic) object. The former
question is related to Szemer\'edi's Regularity Lemma and its
variants, the latter, to "graph limits". A theory of convergent graph
sequences and their limits has been worked out by Benjamini and
Schramm (for graphs with bounded degree) and by Borgs, Chayes,
Lovasz, Sos, Szegedy and Vesztergombi (for dense graphs). Focusing on
the dense case, I will describe the motivation for graph limit theory
and some basic facts.Laszlo Lovasz (Eötvös Loránd University)2014-03-04T16:30:00-05:008602Gergen LecturesGergen Lectures SeminarTuesday, March 4, 2014, 4:30pmPhysics 128Spring, 2014Tue, 04 Mar 2014 16:30:00 ESTTue, 04 Mar 2014 18:30:00 ESTGraph limits and extremal graph theory
https://services.math.duke.edu/mcal?abstract-8603
Many questions in extremal graph theory can be phrased like this:
what is the maximum of a certain linear combination of densities of
given graphs in any graph G? Answers to such questions are often very
difficult. Graph limits make it possible to pose and in some cases
answer some general questions about extremal graphs: Which
inequalities between subgraph densities are valid? Can all valid
inequalities be proved using just Cauchy-Schwarz? Is there always an
extremal graph? Which graphs are extremal?Laszlo Lovasz (Eötvös Loránd University)2014-03-05T16:30:00-05:008603Gergen LecturesGergen Lectures SeminarWednesday, March 5, 2014, 4:30pmPhysics 128Spring, 2014Wed, 05 Mar 2014 16:30:00 ESTWed, 05 Mar 2014 18:30:00 ESTAn informal conversation.
https://services.math.duke.edu/mcal?abstract-8604
For the third Gergen Lecture, Professor Laszlo will offer an informal conversation with interested students and faculty. This may include answering questions regarding prior lectures, such as details and proofs. He may also state open problems.Laszlo Lovasz (Eötvös Loránd University)2014-03-06T16:30:00-05:008604Gergen LecturesGergen Lectures SeminarSpring, 2014Thu, 06 Mar 2014 16:30:00 ESTThu, 06 Mar 2014 18:30:00 ESTThursday, March 6, 2014, 4:30pmPhysics 119