Wednesday, April 30, 2014 - 9:00am - 9:50am
Victor Chepoi (Aix-Marseille Université)
In the talk, after an introduction of the cop and robber game and Gromov hyperbolicity, we will outline the proof that all cop-win graphs G in the game in which the robber and the cop move at different speeds s and s' with s'for any r>0, this establishes a new --game-theoretical-- characterization of Gromov hyperbolicity.
Monday, April 28, 2014 - 3:15pm - 4:05pm
Blair Sullivan (North Carolina State University)
In this talk, we discuss recent work on Gromov's delta-hyperbolicity in the context of random graph models, tree-decompositions, and empirical evaluation of network structure. Specifically, we characterize when random intersection graphs have bounded hyperbolicity, give general theoretical bounds on delta in terms of tree-width, and describe a relationship to local measurement of the core structure. More generally, we describe empirical results on tree-like structure in complex networks and suggest several open problems.
Subscribe to RSS - Hyperbolicity