Flow distances on open flow networks

Abstract

Open flow network is a weighted directed graph with a source and a sink, depicting flux distributions on networks in the steady state of an open flow system. Energetic food webs, economic input-output networks, and international trade networks, are open flow network models of energy flows between species, money or value flows between industrial sectors, and goods flows between countries, respectively. Flow distances (first-passage or total) between any given two nodes i and j are defined as the average number of transition steps of a random walker along the network from i to j under some conditions. They apparently deviate from the conventional random walk distance on a closed directed graph because they consider the openness of the flow network. Flow distances are explicitly expressed by underlying Markov matrix of a flow system in this paper. With this novel theoretical conception, we can visualize open flow networks, calculating centrality of each node, and clustering nodes into groups. We apply flow distances to two kinds of empirical open flow networks, including energetic food webs and economic input-output network. In energetic food webs example, we visualize the trophic level of each species and compare flow distances with other distance metrics on graph. In input-output network, we rank sectors according to their average distances away other sectors, and cluster sectors into different groups. Some other potential applications and mathematical properties are also discussed. To summarize, flow distance is a useful and powerful tool to study open flow systems.

The Atlas of Chinese World Wide Web Ecosystem Shaped by the Collective Attention Flows

“…Thus we take the environment representing the offline world into account. Particularly, the existence of the flows from the source and to the sink is the unique merit of the open flow network compared with the conventional topological network and closed flow network [29]. Any entry in matrix F represents the number of users who visited i after immediate visit of j during a session.…”

“…Since the conventional methods on network distances and random walks can’t be applied to the open flow network, we develop a new way to calculate the flow distance [29] according to the Markov transition matrix M with: …”

“…The embedding is based on flow distances between nodes. Flow distance is a novel quantity defined for attention flow networks which takes both network topology and collective behaviors of users’ consideration together [29]. In addition, we cluster the web sites based on the geometric representation and find that the sites with similar content are clustered into same groups.…”

Universal knowledge discovery from big data using combined dual-cycle

“…Theoretical analysis and hypothesis proposition In a MFN, a fundamental problem is to calculate the flow distance between two nodes according to the mechanism of flow systems. Therefore, a thought experiment of particles' random walks (which belongs to theoretical analysis) is designed and several types of flow distances (such as symmetric minimum flow distances) are deduced [24,46]. This step builds a foundation for the subsequent steps.…”

A Novel Method for Mining Influential Nodes and Hidden Valuable Relationships in Generic Flow Networks

“…Firstly, most of the measurements are developed in undirected networks, neglecting the direction information, which is vital for the flow networks [15]. A flow network is a directed graph where each edge has a capacity and each edge receives a flow [16].…”