English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Extracting hidden hierarchies in 3D distribution networks.

Modes, C. D., Magnasco, M. O., & Katifori, E. (2016). Extracting hidden hierarchies in 3D distribution networks. Physical Review X, 6(3): 031009. doi:10.1103/PhysRevX.6.031009.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-002B-98FF-9 Version Permalink: http://hdl.handle.net/11858/00-001M-0000-002D-3BA4-B
Genre: Journal Article

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Modes, C. D., Author
Magnasco, M. O., Author
Katifori, Eleni1, Author              
Affiliations:
1Max Planck Research Group Physics of Biological Organization, Max Planck Institute for Dynamics and Self-Organization, Max Planck Society, ou_2063293              

Content

show
hide
Free keywords: -
 Abstract: Natural and man-made transport webs are frequently dominated by dense sets of nested cycles. The architecture of these networks, as defined by 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, we have developed a new algorithm 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 3-space that the network may be thought to sit in. Generically, these abstract surfaces are richer than the flat plane because there are now two families of fundamental units that may aggregate upon cutting weakest links-the plaquettes of the tiling and the longer "topological" cycles associated with the abstract surface itself. Upon sequential removal of the weakest links, as determined by a physically relevant edge weight, such as flow volume or capacity, neighboring plaquettes merge and a new tree graph 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. The 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 or the force networks in jammed granular matter.

Details

show
hide
Language(s): eng - English
 Dates: 2016-07-20
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Method: Peer
 Identifiers: DOI: 10.1103/PhysRevX.6.031009
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Physical Review X
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: 16 Volume / Issue: 6 (3) Sequence Number: 031009 Start / End Page: - Identifier: -