Skip to main content
  • Abram Magner - Asymptotic Asymmetry of Uniform Attachment Graphs

  • Tuesday, March 05, 2013
    LWSN 3102 A/B
    Purdue University

    Abstract: I will discuss the problem of characterizing the conditions under which asymmetry arises with high probability in graphs drawn according to a uniform attachment process, a special case of of a generalization of the preferential attachment process, and motivate it with an information theoretic application: asymptotic asymmetry is necessary for an extension of results about structural entropy for Erdos-Renyi graphs to more complicated distributions. I will show how the problem can be boiled down to proving measure concentration, sketch a proof of a weaker result, and demonstrate how standard concentration inequalities fail.

    Based on joint work with Giorgos Kollias and Wojciech Szpankowski.



Copyright © Purdue University, all rights reserved. Purdue University is an equal access/equal opportunity university.

Contact the College of Science at sciencehelp@purdue.edu for trouble accessing this page. Made possible by grant NSF CCF-0939370