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.
Tuesday, October 25, 2011 - 4:15pm - 5:15pm
Blair Sullivan (Oak Ridge National Laboratory)
Large complex networks naturally represent relationships in a variety of settings, e.g. social interactions, computer/communication networks, and genomic sequences. A significant challenge in analyzing these networks has been understanding the “intermediate structure” – those properties not captured by metrics which are local (e.g. clustering coefficient) or global (e.g. degree distribution). It is often this structure which governs the dynamic evolution of the network and behavior of diffusion-like processes on it.
Subscribe to RSS - Hyperbolicity