Independent Researcher, Department of Material Science and Applied Physics, 112/8-A, Columbia, USA
Received date: 07/09/2021; Accepted date: 21/09/2021; Published date: 30/09/2021
Visit for more related articles at Research & Reviews: Journal of Pure and Applied Physics
Entropy Product (EP) is a pivotal quantity useful for understanding irretrievable process. In stochastic thermodynamics, EP is more putative in probability viscidity functions of circuits of a patch in the state space. Presently, inspired by a precedent 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 nodules along the same pathway. The total EPs are exactly enumerated along all possible shortest paths between every dyad of nodules, and the functional form of the EP distribution is proposed predicated on our numerical results. We confirm that the EP distribution satisfies the detailed and integral inconstancy theorems. The results should be pedagogically helpful for understanding circuit-dependent EP in stochastic processes and exploring nonequilibrium inconstancies associated with the web of dividing and integrating among the shortest pathways in complex networks.
There is a relation between the irreversibility of thermodynamic processes as expressed by the breaking of time-reversal symmetry, and the entropy production in such processes. The second law of thermodynamics states that an insulated system relaxing to equilibrium tends to maximize its entropy. Notwithstanding, systems out of equilibrium are ubiquitous in nature, being characterized by a ceaseless exchange of energy or matter with the setting to maintain a non-equilibrium steady state and, so, producing entropy . For this reason, top of the attempts to develop resembling extreme principles valid for non-equilibrium systems impute the entropy produce as playing the presiding place. Some laws have been proposed, stemming from both maximum and minimum principles . Notwithstanding, the problem remains one of the utter challenges of the current statistical specifics, partially because of the lack of a universal vignette of entropy for systems out of equilibrium. Indeed, the entropy yield has been universally researched during the last decade in different environs, yielding to general flux theorems and evidencing universal features that are independent of the system details. The escalating interest in the entropy output calls for general and simple procedures to estimate it, suitable for a wide range of systems and dynamics. Researchers probe the entropy produce of ensembles of desultorily generated Master Equation (ME) systems owing to specific constraints (e.g., size or concinnity) and identify the system parameters that generally determine its value . Max of our good computations is deduced perturbatively, setting the system close to equilibrium. In addition, random networks are universally used in the literature  as “null models” for separate intercourses. In the medium, random ensembles give null- model estimations of the entropy produce that can be compared with the real value of specific systems, helping to identify those that either maximize or minimize the entropy thing, separately.
The network hypothesis proposed by Schnakenberg to anatomize the entropy production of systems out of equilibrium from an arbitrary matrix perspective. Researchers bagged general scaling relations for the entropy labor of network ensembles representing a set of systems and dynamics, and connected the topological parameters that play the most important job. The outline provides a null model on which compare the entropy labor of specific systems and dynamics. In particular, some consanguineous systems appear to have evolved in order to dissipate energy and produce entropy at the minimum or maximum possible rate. It could be intriguing to deconstruct the topological features of real dynamics with what we've procured for slapdash networks, which have not been realized through optimization or progress processes. Ultimately, our results have been reasoned for small world-similar networks with a homogeneous degree distribution with finite Strife. Also, our well-founded numbers reckon on the use of the Central Limit Theorem, and so are limited to networks with finite degree strife. In future, it would be involving to dissect the cases of ragtag networks with divergent strife in the degree distribution (e.g., scale-free networks), with strong asymmetric transition rates (i.e., far from equilibrium) and with nontrivial correlations between couples of transition rates (i.e., assortative and disassortative networks).