Your browser doesn't support javascript.
loading
Entropy production and fluctuation theorems on complex networks.
Jung, Jaewoo; Um, Jaegon; Lee, Deokjae; Kim, Yong W; Lee, D Y; Pak, H K; Kahng, B.
Afiliação
  • Jung J; CCSS, CTP and Department of Physics and Astronomy, Seoul National University, Seoul 08826, South Korea.
  • Um J; CCSS, CTP and Department of Physics and Astronomy, Seoul National University, Seoul 08826, South Korea.
  • Lee D; CCSS, CTP and Department of Physics and Astronomy, Seoul National University, Seoul 08826, South Korea.
  • Kim YW; Department of Physics, Lehigh University, Bethlehem, Pennsylvania 18015, USA.
  • Lee DY; Center for Soft and Living Matter, Institute for Basic Science, Ulsan 44919, South Korea.
  • Pak HK; Center for Soft and Living Matter, Institute for Basic Science, Ulsan 44919, South Korea.
  • Kahng B; CCSS, CTP and Department of Physics and Astronomy, Seoul National University, Seoul 08826, South Korea.
Chaos ; 30(5): 053125, 2020 May.
Article em En | MEDLINE | ID: mdl-32491892
Entropy production (EP) is a fundamental quantity useful for understanding irreversible process. In stochastic thermodynamics, EP is more evident in probability density functions of trajectories of a particle in the state space. Here, inspired by a previous result that complex networks can serve as state spaces, we consider a data packet transport problem on complex networks. EP is generated owing to the complexity of pathways as the packet travels back and forth between two nodes along the same pathway. The total EPs are exactly enumerated along all possible shortest paths between every pair of nodes, and the functional form of the EP distribution is proposed based on our numerical results. We confirm that the EP distribution satisfies the detailed and integral fluctuation theorems. Our results should be pedagogically helpful for understanding trajectory-dependent EP in stochastic processes and exploring nonequilibrium fluctuations associated with the entanglement of dividing and merging among the shortest pathways in complex networks.

Texto completo: 1 Bases de dados: MEDLINE Idioma: En Revista: Chaos Assunto da revista: CIENCIA Ano de publicação: 2020 Tipo de documento: Article País de afiliação: Coréia do Sul

Texto completo: 1 Bases de dados: MEDLINE Idioma: En Revista: Chaos Assunto da revista: CIENCIA Ano de publicação: 2020 Tipo de documento: Article País de afiliação: Coréia do Sul