BEGIN:VCALENDAR
PRODID:-//Feedo Feed//NONSGML v1.0//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Daniel Král lecture: Models of large networks
X-WR-CALDESC:Unique opportunity to hear professor Král, leading world-wide expert in the field of discrete mathematics and algorithms. Daniel Král' is a professor of matematics and informatics at University of Warwick. For his work he received many important awards such as European Prize in Combinatorics 2011 or Philip Leverhulme Prize in Mathematics and Statistics in 2014. He is also one of two Czech scientists who received ERC grant more than once.\nLecture will be given in English.\nModels of large networksDaniel Kral http://www.ucw.cz/~kral/ \nA graph is a mathematical model of a network of nodes, which can be, e.g., a computer network or a social network. Problems concerning networks of enormous sizes, which more and more often arise in computer science applications, led to a need to find new mathematical tools to represent and analyze large graphs. The theory of graph limits, whose foundations were laid at Microsoft Research about a decade ago, has responded to these challenges by developing analytic models of large graphs.\nWe will provide a brief self-contained introduction to the theory of graph limits, which will be followed by the exposition of the most major lines of research. We will conclude with presenting solutions of some of the most significant open problems in the area.
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
DTSTAMP:20180524T001122Z
DTSTART:20180216T100000Z
DTEND:20180216T110000Z
TRANSP:TRANSPARENT
UID:14642018-02-16
SUMMARY:Daniel Král lecture: Models of large networks
DESCRIPTION:Unique opportunity to hear professor Král, leading world-wide expert in the field of discrete mathematics and algorithms. Daniel Král' is a professor of matematics and informatics at University of Warwick. For his work he received many important awards such as European Prize in Combinatorics 2011 or Philip Leverhulme Prize in Mathematics and Statistics in 2014. He is also one of two Czech scientists who received ERC grant more than once.\nLecture will be given in English.\nModels of large networksDaniel Kral http://www.ucw.cz/~kral/ \nA graph is a mathematical model of a network of nodes, which can be, e.g., a computer network or a social network. Problems concerning networks of enormous sizes, which more and more often arise in computer science applications, led to a need to find new mathematical tools to represent and analyze large graphs. The theory of graph limits, whose foundations were laid at Microsoft Research about a decade ago, has responded to these challenges by developing analytic models of large graphs.\nWe will provide a brief self-contained introduction to the theory of graph limits, which will be followed by the exposition of the most major lines of research. We will conclude with presenting solutions of some of the most significant open problems in the area.
URL:http://www.online.muni.cz/pozvanky/daniel-kral-lecture-models-of-large-networks?format=html
CATEGORIES:MU
GEO:49.2099358;16.598976799999946
LOCATION:Fakulta informatiky MU
END:VEVENT
END:VCALENDAR