OXFORD, Miss. – Michal Karonski, professor of mathematics at Adam
\nMickiewicz University in Poznan, Poland and Emory University in
\nAtlanta, is to discuss “Random Graphs: From Paul Erdos To The Internet”
\nduring a lecture Nov. 19 at the University of Mississippi.
\n
<\/p>\n
\nThe event, set for 6 p.m. in Lewis Hall, Room 101, is sponsored by the
\nUM Department of Mathematics as part of its Dalrymple Lecture Series.
\nIt is free and open to the public.\n<\/p>\n
\nKaronski plans to examine
\nthe work of Paul Erdos, one of the greatest mathematicians of the 20th
\ncentury, and Erdos’ collaboration with Alfred Renyi on the theory of
\nrandom graphs, which studies how large and complex systems evolve when
\nrandomness of the relations between their elements is incurred.\n<\/p>\n
\nKaronski once served as dean of the faculty of mathematics and
\ncomputer science at Adam Mickiewicz University. Internationally, he is
\nknown as a specialist in the theory of random structures, leading a
\ngroup of younger scholars devoted to research in that area of
\nmathematics.\n<\/p>\n
\n“In my talk, I will sketch the long journey of this theory from
\nthe pioneering Erdos era to modern attempts to model properties of
\nlarge real-world networks which grow unpredictably, including the
\nInternet, World Wide Web, peer-to-peer, social, neural and metabolic
\nnetworks,” Karonski said.\n<\/p>\n
\nThe Dalrymple Lecture Series was endowed by Mr. and Mrs. Arch
\nDalrymple II of Amory. It brings lecturers to discuss mathematics and
\nmathematics research of interest to the general public. Arch Dalrymple
\nattended Cornell University, Amherst College and UM, where he earned a
\nbachelor’s degree in 1947.\n<\/p>\n