Optimization of transport efficiency on bundled networks

Bundled networks are important models for representing polymers and noncrystalline solids with branching structures. In this study, we consider unbiased random walks on a bundled network, which is constructed by attaching a copy of a fiber structure to each node of a base graph. We analyze the first-passage properties of this network, including the mean first-passage time, the mean trapping time, and the global-mean first-passage time (GFPT), which serve as a key measure of transport efficiency. Our findings indicate that these quantities are primarily determined by the first-passage properties on both the base and fiber. Exact formulas are derived to describe the relations between these quantities. Furthermore, we propose a general method to control the transport efficiency of bundled networks by introducing a parameter γ. Results show that for different values of γ, the GFPT of the bundled network exhibits distinct scaling behaviors. Therefore, bundled networks with specified transport efficiency can be obtained by carefully choosing the base graph, fiber structure, and parameter γ. These findings provide valuable insights into network design and optimization.

Authors

Institutions

Publication Details

Journal
Chaos An Interdisciplinary Journal of Nonlinear Science
Published
2025-08-01
DOI
https://doi.org/10.1063/5.0282648
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimization of transport efficiency on bundled networks

Junhao Peng, Zhenhua Yuan, Long Gao, Yuan Zhu
Chaos An Interdisciplinary Journal of Nonlinear Science
Complex Network Analysis Techniques
article

Optimization of transport efficiency on bundled networks

Junhao Peng, Zhenhua Yuan, Long Gao, Yuan Zhu
article en

Abstract

Bundled networks are important models for representing polymers and noncrystalline solids with branching structures. In this study, we consider unbiased random walks on a bundled network, which is constructed by attaching a copy of a fiber structure to each node of a base graph. We analyze the first-passage properties of this network, including the mean first-passage time, the mean trapping time, and the global-mean first-passage time (GFPT), which serve as a key measure of transport efficiency. Our findings indicate that these quantities are primarily determined by the first-passage properties on both the base and fiber. Exact formulas are derived to describe the relations between these quantities. Furthermore, we propose a general method to control the transport efficiency of bundled networks by introducing a parameter γ. Results show that for different values of γ, the GFPT of the bundled network exhibits distinct scaling behaviors. Therefore, bundled networks with specified transport efficiency can be obtained by carefully choosing the base graph, fiber structure, and parameter γ. These findings provide valuable insights into network design and optimization.

Chaos An Interdisciplinary Journal of Nonlinear ScienceVol. 35(8)
Guangzhou University (CN), Guangdong Polytechnic Normal University (CN), Guangdong Open University (CN)
Basic and Applied Basic Research Foundation of Guangdong Province
Affordable and clean energy
Openalex Percentile: Top 84%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.