Workshop on Modern Theory of Random Graphs and Its Applications for Web Modelling

Лекция / семинар сайт события http://events.yandex.ru/events/workshop/msk-oct2013/

Добавить в календарь:
Поделиться:

The theory of random graphs started more than 50 years ago with the now classical works of Paul Erdős and Alfréd Rényi. Now it's a powerful and deeply developed mathematical discipline, the results of which substantially influence graph theory, combinatorics, and applications.

One of the most important applications is in the study of large, complex networks such as the Internet, social networks, biological networks, interbank networks, etc. The aim of the workshop is to bring together specialists in pure and applied theory of random graphs and to provide a platform for fruitful discussions of both fundamental and applied aspects of the theory. Workshop topics are expected to include Erdős-Rényi random graphs, web-graph models and their applications to the study of Internet topology, and models of social and interbank networks.

The conference will take place in Moscow, Russia, from the 24th to the 26th of October 2013.

The main organizer of the conference is Andrey Raigorodsky.

We also expect to have a limited number of high-quality contributed talks.

Those who wish to contribute a talk should fill in the registration form below and send an abstract in PDF format (up to two pages) to raigorodsky@yandex-team.ru.

The abstracts will be thoroughly considered, and final decisions will be made by August 1, 2013. The deadline for submissions is May 31, 2013.

To attend as a member of the audience is free of charge; keynote speakers also attend gratis.

Thursday, October 24

09:30

Registration, welcoming coffee


10:30

Conference opening - Andrei Raigorodsky


11:00

Basic epidemiology of complex networks

Sergey Dorogovtsev


12:30

Coffee break


13:00

Component structure of the vacant set induced by a random walk on a random graph

Colin Cooper


14:30

Lunch


15:30

Systemic interbank network risks in Russia

Andrei Leonidov


16:10

Extensions of the 'hitchhiker' game-theoretic network formation model

Daniil Musatov


16:50

Coffee break


17:20

Evolution of the Media Web

Egor Samosvat


Friday, October 25

10:00

Registration, welcoming coffee


10:30

The power of locality for network algorithms

Jennifer Tour Chayes


12:00

Convergence of sparse graphs as a problem at the intersection of graph theory, statistical physics and probability

Christian Borgs


13:30

Lunch


14:30

Statistics of a random graph in the Bollobas-Borgs-Chayes-Riordan model

Evgeny Grechnikov


15:10

Graph-based semi-supervised learning methods: Comparison and tuning

Konstantin Avrachenkov


15:50

Coffee break


16:20

Generalized preferential attachment

Liudmila Ostroumova


Saturday, October 26

10:00

Registration, welcoming coffee


10:30

Scale-free percolation

Remco William van der Hofstad


12:00

Limits of local algorithms for sparse random graphs

David Gamarnik


13:30

Lunch

14:30

" When does zero-one k-law hold?"

Maksim Zhukovskii


15:10

Degree-degree dependencies in random graphs with heavy-tailed degrees

Nelly Litvak


15:50

Coffee break


16:20

An in-depth look at preferential attachment model of the web: degree and edge distributions

Gleb Gusev


17:00

Conference closure - Andrei Raigorodsky

Jennifer Tour Chayes

Jennifer Tour Chayes is Distinguished Scientist and Managing Director of Cambridge, Massachusetts-based Microsoft Research New England, which she co-founded in 2008, and Microsoft Research New York City, which she co-founded in 2012. Chayes was Research Area Manager for Mathematics, Theoretical Computer Science and Cryptography at Microsoft Research Redmond until 2008. She joined Microsoft Research in 1997, when she co-founded the Theory Group. Before that, she was for many years Professor of Mathematics at UCLA. Chayes is the author of about 125 academic papers and the inventor of more than 25 patents. Her research areas include phase transitions in discrete mathematics and computer science, structural and dynamical properties of self-engineered networks, and algorithmic game theory. Chayes received her B.A. in biology and physics at Wesleyan University, where she graduated first in her class, and her Ph.D. in mathematical physics at Princeton. She did her postdoctoral work in the mathematics and physics departments at Harvard and Cornell. She is the recipient of a National Science Foundation Postdoctoral Fellowship, a Sloan Fellowship, and the UCLA Distinguished Teaching Award. Chayes has recently been the recipient of many leadership awards including the Leadership Award of Women Entrepreneurs in Science and Technology, the Leading Women Award of the Girl Scouts of Eastern Massachusetts, the Women to Watch Award of the Boston Business Journal, and the Women of Leadership Vision Award of the Anita Borg Institute. She has twice been a member of the Institute for Advanced Study in Princeton. Chayes is a Fellow of the American Association for the Advancement of Science, the Fields Institute, the Association for Computing Machinery, and the American Mathematical Society, and a National Associate of the National Academies.

Лекции

The power of locality for network algorithms



Christian Borgs

Christian Borgs is the Deputy Managing Director of Microsoft Research New England in Cambridge, Massachusetts. He studied physics at the University of Munich, the University Pierre et Marie Curie in Paris, the Institut des Hautes Etudes in Bures-sur-Yvettes, and the Max-Planck-Institute for Physics in Munich. He received his Ph.D. in mathematical physics from the University of Munich, held a postdoctoral fellowship at the ETH Zurich, and received his Habilitation in mathematical physics from the Free University in Berlin. After his Habilitation he held a Heisenberg Fellowship, and then became the C4 Chair for Statistical Mechanics at the University of Leipzig. In 1997 he joined Microsoft Research to co-found the Theory Group. He was a manager of the Theory Group until 2008, when he co-founded Microsoft Research New England. Borgs has authored well over 100 research papers and is named as an inventor on about 30 patents. He is well known for his work on the mathematical theory of first-order phase transitions and finite-size effects for which he won the 1993 Karl-Scheel Prize of the German Physical Society. Since joining Microsoft, Borgs has become one of the world leaders in the study of phase transitions in combinatorial optimization, and more generally, the use of methods from statistical physics and probability theory in problems of interest to computer science and technology. Borgs has given a prestigious Conference Board of Mathematical Sciences (CBMS) lecture series. He has been a long-term visitor at Princeton, Harvard and UCLA, and twice a member of the Institute for Advanced Study in Princeton. He has served on many boards and committees.

Лекции

Convergence of sparse graphs as a problem at the intersection of graph theory, statistical physics and probability



Colin Cooper

Colin Cooper is Professor in the Department of Informatics in the School of Natural and Mathematical Sciences at King's College London. His research interests are in random structures and algorithms, particularly models of massive networks, random graphs, properties of discrete random structures, random walks and randomized algorithms. At a practical level, he is interested the problem of estimating properties of large unknown networks, using heuristic methods inspired by theoretical considerations.

Лекции

Component structure of the vacant set induced by a random walk on a random graph

Random graph process models of large networks



David Gamarnik

David Gamarnik is a Professor of Operations Research at the Sloan School of Management of Massachusetts Institute of Technology. He received a B.A. in mathematics from New York University in 1993 and a Ph.D. in Operations Research from MIT in 1998. Since then he was a research staff member of IBM T.J. Watson Research Center, before joining MIT in 2005. His research interests include applied probability and stochastic processes, theory of random graphs, algorithms and combinatorial optimization. He works on applications in health care management, management of call centers and business processes. He is a recipient of the Erlang Prize and the Best Publication Award from the INFORMS Applied Probability Society, IBM Faculty Partnership Award and several NSF sponsored grants. He is currently an area editor of Operations Research journal, associate editor of Mathematics of Operations Research, Stochastic Systems, and Queueing Systems journals, and he has been an associate editor of Annals of Applied Probability in the past.

Лекции

Limits of local algorithms for sparse random graphs



Andrei Leonidov

Andrei Leonidov is leading researcher at the P.N. Lebedev Physical Institute’s Theoretical Physics Department. His main topics are high energy physics and econophysics. He also teaches at the Moscow Institute of Physics and Technology – Chair of Discrete Mathematics, and of Problems of Physics and Astrophysics, Topics – complex networks and elementary particle physics.

Лекции

Systemic interbank network risks in Russia



Nelly Litvak

Nelly Litvak is an Associate Professor in the Stochastic Operations Research group at the University of Twente, The Netherlands. She received her Ph.D. in Stochastic Operations Research from Eindhoven University of Technology (EURANDOM) in 2002. In recent years she has been working on the analysis of complex networks, in particular, algorithms for node ranking, efficient detection of network structure, and analysis of network correlations. Her other research interests are in stochastic processes, queueing theory, and probabilistic solutions for combinatorial problems. Nelly has received several grants and awards including the Google Faculty Research Award 2012. She has been an invited visitor in INRIA (France), University of South Australia, Georgia Institute of Technology, and Columbia University.

Лекции

Degree-degree dependencies in random graphs with heavy-tailed degrees



Egor Samosvat

Egor Samosvat graduated with distinction from Moscow Institute of Physics and Technology in 2012 and currently is a Ph.D. student there. In 2010 he joined Yandex, where he is developing algorithms for crawling the fresh part of the Web and doing research in the area of complex networks. He also graduated from Yandex School of Data Analysis and now is a teaching assistant of Professor Andrey Raigorodsky there.

Лекции

Evolution of the Media Web



Konstantin Avrachenkov

Konstantin Avrachenkov received a Master’s degree in Control Theory from St. Petersburg State Polytechnic University (1996), a Ph.D. in Mathematics from the University of South Australia (2000) and Habilitation (Doctor of Science) from the University of Nice Sophia Antipolis (2010). Currently he is a Director of Research at Inria Sophia Antipolis, France. He is an associate editor of the International Journal of Performance Evaluation. Konstantin Avrachenkov has published more than 40 journal and 50 refereed conference articles. His main research interests are Markov processes, singular perturbation theory, queueing theory, mathematical programming, game theory and performance evaluation of communication networks.

Лекции

Graph-based semi-supervised learning methods: Comparison and tuning



Remco William van der Hofstad

Remco van der Hofstad received his Ph.D. at the University of Utrecht in 1997, under the supervision of Frank den Hollander and Richard Gill. Since then, he worked at McMaster University in Hamilton, Canada, and Delft University of Technology. He is currently Full Professor in Probability at Eindhoven University of Technology and acting Scientific Director of Eurandom. Further, he is jointly with Frank den Hollander responsible for the Random Spatial Structures Program at Eurandom. Remco received the Prix Henri Poincare 2003 jointly with Gordon Slade, the Rollo Davidson Prize 2007, and is a laureate of the Innovative Research VIDI Scheme 2003 and Innovative Research VICI Scheme 2008.

Лекции

Scale-free percolation



Evgeny Grechnikov

Evgeny Grechnikov is Senior Researcher and Developer at Yandex. His current research is focused on random graphs. He received his Ph.D. in number theory from Moscow State University for research related to elliptic curves.

Лекции

Statistics of a random graph in the Bollobas-Borgs-Chayes-Riordan model



Liudmila Ostroumova

Liudmila Ostroumova is a researcher at Yandex and Moscow State University. At Yandex she is working on various problems of information retrieval such as crawling algorithms, caching of search results, etc. Liudmila is currently a Ph.D. student at the Department of Mathematical Statistics and Random Processes at Moscow State University under the supervision of professor Andrey Raigorodsky. Her main research interests are combinatorial analysis, random graph models, and web-graph analysis.

Лекции

Generalized preferential attachment



Sergey Dorogovtsev

Sergey Dorogovtsev is a researcher at the University of Aveiro, Portugal, and the Ioffe Institute in St. Petersburg. Sergey is the author of a number of books and other works on statistical mechanics of complex networks.

Лекции

Basic epidemiology of complex networks



Daniil Musatov

Daniil Musatov graduated from Moscow State University (Mathematics Department, 2006), the Independent University of Moscow (College of Mathematics, 2006) and the New Economic School (MA in Economics, 2008). He is now finishing his Candidate of Science (Ph.D.) thesis on theoretical computer science at Moscow State University (Mathematics Department). Scientific interests: theoretical computer science, game theory, mathematical models of social interactions. He works as a teacher at Moscow Institute of Physics and Technology and at the New Economic School. He was granted the Best Student Paper award at the 2011 Symposium on Computer Science in Russia.

Лекции

Extensions of the 'hitchhiker' game-theoretic network formation model



Gleb Gusev

Gleb Gusev is a research group leader in Yandex, LLC, and Professor of Moscow Institute of Physics and Technology. In 2006, he graduated from two universities – Moscow State University (Faculty of Mechanics and Mathematics), and the Independent University of Moscow. In 2010, he received his Ph.D. in physics and mathematics from MSU (in the specialty of Geometry and Topology) with Professor Sabir Gusein-Zade. Since 2008, he has been an Assistant Professor at the Institute of Physics and Technology, and since 2011, leader of the Theory Group in Yandex’s research department. His research interests include but are not limited to: Mathematics: - topological invariants of singularities of algebraic varieties - combinatorial geometry of Newton polyhedra mixed volumes Computer science: - random graph models of real-world networks - modelling and predicting user behavior in web search - use of user behavior logs for information retrieval tasks

Лекции

An in-depth look at preferential attachment model of the web: degree and edge distributions



Maksim Zhukovskii

Maksim Zhukovskii is a researcher with Yandex and Moscow State University, and assistant Professor in MIPT. At Yandex he studies web graph properties and develops features for the problem of web page ranking. Maksim Zhukovskii received his Ph.D. in mathematics (on the theory of probabilities) in MSU’s Department of Theory of Probabilities.

Лекции

" When does zero-one k-law hold?"

Комментарии (0):

Оставлять комментарии могут только зарегистрированные пользователи

Для получения embed кода необходимо кликнуть правой
кнопкой мыши на видео и выбрать пункт меню
'Сгенерировать HTML код'

The registration fee for participating in the workshop, which includes coffee breaks, conference materials and a booklet of abstracts of plenary and contributed talks, is $200.

Note:

Registration fee is to be paid by invoice. Send invoice requests to raigorodsky@yandex-team.ru. Include your full name, e-mail address and telephone number.

To attend as a member of the audience is free of charge; keynote speakers also attend gratis.

Забыли пароль? Регистрация