1887
banner image
No data available.
Please log in to see this content.
You have no subscription access to this content.
No metrics data to plot.
The attempt to load metrics for this article has failed.
The attempt to plot a graph for these metrics has failed.
Spectral coarse graining for random walks in bipartite networks
Rent:
Rent this article for
USD
10.1063/1.4773823
/content/aip/journal/chaos/23/1/10.1063/1.4773823
http://aip.metastore.ingenta.com/content/aip/journal/chaos/23/1/10.1063/1.4773823

Figures

Image of FIG. 1.
FIG. 1.

The top figure is a social bipartite network of terrorists with . Nodes' size is proportional to their degree. The two different colors represent the two kinds of vertices. The blue squares stand for people and the red circles represent the organizations. The bottom figure is the coarse-grained network from the BSCG method with . Nodes' size is proportional to its strength in this weighted network.

Image of FIG. 2.
FIG. 2.

The evolution of the three largest nontrivial eigenvalues , , and as a function of the size of the coarse-grained network. (a)–(c) The original network is movielens network. (d)–(f) The original network is Netflix network. Red circles correspond to the random coarse graining method, the green line is the community detection method, and the blue squares represent the BSCG method.

Image of FIG. 3.
FIG. 3.

Comparison of the MFPT. The walker starts at each node in the top set and the sink i is selected as the node with the strongest weight in the bottom set. The blue circles represent the average MFPT ranked for each group in the original network. The MFPT of the corresponding nodes in the coarse-grained network is displayed with red lines. (a) Nodes merged by BSCG method in Movielens network. (b) Nodes merged randomly in Movielens network. (c) Nodes merged based on community detection method in Movielens network. (d) Nodes merged by BSCG method in Netflix network. (e) Nodes merged randomly in Netflix network. (f) Nodes merged based on community detection method in Netflix network. Insets: Comparison of the exact MFPT between original and the reduced bipartite network. Slope 1 represents the well preserved MFPT in the reduced network.

Tables

Generic image for table
Table I.

The three largest nontrivial eigenvalues of in the artificial networks including the bipartite network with community structure and the ER bipartite network. and are the eigenvalues before and after coarse graining, respectively.

Generic image for table
Table II.

The three largest nontrivial eigenvalues of in real-world bipartite networks including a small terrorists' social network, movielens network, and Netflix network. and are, respectively, the eigenvalues before and after coarse graining.

Loading

Article metrics loading...

/content/aip/journal/chaos/23/1/10.1063/1.4773823
2013-01-07
2014-04-20
Loading

Full text loading...

This is a required field
Please enter a valid email address
752b84549af89a08dbdd7fdb8b9568b5 journal.articlezxybnytfddd
Scitation: Spectral coarse graining for random walks in bipartite networks
http://aip.metastore.ingenta.com/content/aip/journal/chaos/23/1/10.1063/1.4773823
10.1063/1.4773823
SEARCH_EXPAND_ITEM