[초청세미나] Combinatorial Laplacians for networks

When:
6월 15, 2018 @ 10:30 – 11:30
Where:
서울대학교 공과대학 301동 202호
Categories:
  • 강사 : 국웅 (서울대학교 수리과학부 부교수)
  • 일시 : 2018615(금요일) 오전 1030
  • 장소 : 서울대학교 공과대학 301202

Abstract

A combinatorial Laplacian is a non-negative symmetric matrix from which various graph theoretic invariants of a network can be recovered. In this talk, we will focus on the complexity, effective resistance, and information centrality for a network, and discuss their intriguing implications regarding connectivity and decentralization.

Biography

1991 B.A. Mathematics, Princeton University

1997 Ph.D, Mathematics, Stanford University (adviser: Prof. Gunnar Carlsson)

박사 후 리서치펠로우 Interval Corp. (founded by Paul Allen of Microsoft)

박사 후 연구원 University of Minnesota

조교수/부교수 University of Rhode Island

2013-현재 서울대 수리과학부 부교수

현재 산업수학센터 데이터 분석 그룹 담당

Publications in

Journal of the American Mathematical Society (one of the top three journals in mathematics)

Journal of Combinatorial Theory, A and B (a top journal in combinatorics)

Advances in Applied Mathematics (a top journal in applied mathematics)