University of Cambridge > > Biological and Statistical Physics discussion group (BSDG) > Extracting Hidden Hierarchies in Complex Spatial Biological and Physical Networks

Extracting Hidden Hierarchies in Complex Spatial Biological and Physical Networks

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Salvatore Tesoro.

Natural and man-made transport webs are frequently dominated by dense sets of nested cycles. The architecture of these networks—the topology and edge weights—determines how efficiently the networks perform their function. Yet, the set of tools that can characterize such a weighted cycle-rich architecture in a physically relevant, mathematically compact way is sparse. In order to fill this void, this seminar presents a new characterization that rests on an abstraction of the physical `tiling’ in the case of a two dimensional network to an effective tiling of an abstract surface in space that the network may be thought to sit in. Generically these abstract surfaces are richer than the plane and upon sequential removal of the weakest links by edge weight, neighboring tiles merge and a tree characterizing this merging process results. The properties of this characteristic tree can provide the physical and topological data required to describe the architecture of the network and to build physical models. This new algorithm can be used for automated phenotypic characterization of any weighted network whose structure is dominated by cycles, such as mammalian vasculature in the organs, the root networks of clonal colonies like quaking aspen, and the force networks in jammed granular matter. In particular this seminar will also present some progress in the analysis of both neurovasculature and force networks chains.

This talk is part of the Biological and Statistical Physics discussion group (BSDG) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity