ترغب بنشر مسار تعليمي؟ اضغط هنا

On the statistical distributions of substance moving through the nodes of a channel of network

60   0   0.0 ( 0 )
 نشر من قبل Nikolay K Vitanov
 تاريخ النشر 2019
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

We discuss a model of motion of substance through the nodes of a channel of a network. The channel can be modeled by a chain of urns where each urn can exchange substance with the neighboring urns. In addition the urns can exchange substance with the network nodes and the new point is that we include in the model the possibility for exchange of substance among the urns (nodes) and the environment of the network. We consider stationary regime of motion of substance through a finite channel (stationary regime of exchange of substance along the chain of urns) and obtain a class of statistical distributions of substance in the nodes of the channel. Our attention is focused on this class of distributions and we show that for the case of finite channel the obtained class of distributions contains as particular cases truncat

قيم البحث

اقرأ أيضاً

376 - Yael Kfir-Cohen , Dana Vaknin , 2021
Many systems such as critical infrastructure exhibit a modular structure with many links within the modules and few links between them. One approach to increase the robustness of these systems is to reinforce a fraction of the nodes in each module, s o that the reinforced nodes provide additional needed sources for themselves as well as for their nearby neighborhood. Since reinforcing a node can be an expensive task, the efficiency of the decentralization process by reinforced nodes is vital. In our study we analyze a new model which combines both above mentioned features of real complex systems - modularity and reinforced nodes. Using tools from percolation theory, we derived an analytical solution for any partition of reinforced nodes; between nodes which have links that connect them to other modules (inter-nodes) and nodes which have connections only within their modules (intra-nodes). Among our results, we find that near the critical percolation point ($papprox p_c$) the robustness is greatly affected by the distribution. In particular, we find a partition of reinforced nodes which yields an optimal robustness and we show that the optimal partition remains constant for high average degrees.
Intervals between discrete events representing human activities, as well as other types of events, often obey heavy-tailed distributions, and their impacts on collective dynamics on networks such as contagion processes have been intensively studied. The literature supports that such heavy-tailed distributions are present for inter-event times associated with both individual nodes and individual edges in networks. However, the simultaneous presence of heavy-tailed distributions of inter-event times for nodes and edges is a non-trivial phenomenon, and its origin has been elusive. In the present study, we propose a generative model and its variants to explain this phenomenon. We assume that each node independently transits between a high-activity and low-activity state according to a continuous-time two-state Markov process and that, for the main model, events on an edge occur at a high rate if and only if both end nodes of the edge are in the high-activity state. In other words, two nodes interact frequently only when both nodes prefer to interact with others. The model produces distributions of inter-event times for both individual nodes and edges that resemble heavy-tailed distributions across some scales. It also produces positive correlation in consecutive inter-event times, which is another stylized observation for empirical data of human activity. We expect that our modeling framework provides a useful benchmark for investigating dynamics on temporal networks driven by non-Poissonian event sequences.
Cycles, which can be found in many different kinds of networks, make the problems more intractable, especially when dealing with dynamical processes on networks. On the contrary, tree networks in which no cycle exists, are simplifications and usually allow for analyticity. There lacks a quantity, however, to tell the ratio of cycles which determines the extent of network being close to tree networks. Therefore we introduce the term Cycle Nodes Ratio (CNR) to describe the ratio of number of nodes belonging to cycles to the number of total nodes, and provide an algorithm to calculate CNR. CNR is studied in both network models and real networks. The CNR remains unchanged in different sized Erdos Renyi (ER) networks with the same average degree, and increases with the average degree, which yields a critical turning point. The approximate analytical solutions of CNR in ER networks are given, which fits the simulations well. Furthermore, the difference between CNR and two-core ratio (TCR) is analyzed. The critical phenomenon is explored by analysing the giant component of networks. We compare the CNR in network models and real networks, and find the latter is generally smaller. Combining the coarse-graining method can distinguish the CNR structure of networks with high average degree. The CNR is also applied to four different kinds of transportation networks and fungal networks, which give rise to different zones of effect. It is interesting to see that CNR is very useful in network recognition of machine learning.
In this paper we show that the small world and weak ties phenomena can spontaneously emerge in a social network of interacting agents. This dynamics is simulated in the framework of a simplified model of opinion diffusion in an evolving social networ k where agents are made to interact, possibly update their beliefs and modify the social relationships according to the opinion exchange.
We discuss a channel consisting of nodes of a network and lines which connect these nodes and form ways for motion of a substance through the channel. We study stationary flow of substance for channel which arms contain finite number of nodes each an d obtain probability distribution for substance in arms of this channel. Finally we calculate Shannon information measure for the case of stationary flow of substance in a simple channel consisting of a single arm having just three nodes.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا