Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Sampling Graphlets of Multiplex Networks: A Restricted Random Walk Approach

Sampling Graphlets of Multiplex Networks: A Restricted Random Walk Approach Graphlets are induced subgraph patterns that are crucial to the understanding of the structure and function of a large network. A lot of effort has been devoted to calculating graphlet statistics where random walk-based approaches are commonly used to access restricted graphs through the available application programming interfaces (APIs). However, most of them merely consider individual networks while overlooking the strong coupling between different networks. In this article, we estimate the graphlet concentration in multiplex networks with real-world applications. An inter-layer edge connects two nodes in different layers if they actually belong to the same node. The access to a multiplex network is restrictive in the sense that the upper layer allows random walk sampling, whereas the nodes of lower layers can be accessed only through the inter-layer edges and only support random node or edge sampling. To cope with this new challenge, we define a suit of two-layer graphlets and propose novel random walk sampling algorithms to estimate the proportion of all the three-node graphlets. An analytical bound on the sampling steps is proved to guarantee the convergence of our unbiased estimator. We further generalize our algorithm to explore the tradeoff between the estimated accuracy of different graphlets when the sample budget is split into different layers. Experimental evaluation on real-world and synthetic multiplex networks demonstrates the accuracy and high efficiency of our unbiased estimators. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on the Web (TWEB) Association for Computing Machinery

Sampling Graphlets of Multiplex Networks: A Restricted Random Walk Approach

Download PDF
31 pages

Loading next page...
 
/lp/association-for-computing-machinery/sampling-graphlets-of-multiplex-networks-a-restricted-random-walk-1aFoBLISxN

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2021 Association for Computing Machinery.
ISSN
1559-1131
eISSN
1559-114X
DOI
10.1145/3456291
Publisher site
See Article on Publisher Site

Abstract

Graphlets are induced subgraph patterns that are crucial to the understanding of the structure and function of a large network. A lot of effort has been devoted to calculating graphlet statistics where random walk-based approaches are commonly used to access restricted graphs through the available application programming interfaces (APIs). However, most of them merely consider individual networks while overlooking the strong coupling between different networks. In this article, we estimate the graphlet concentration in multiplex networks with real-world applications. An inter-layer edge connects two nodes in different layers if they actually belong to the same node. The access to a multiplex network is restrictive in the sense that the upper layer allows random walk sampling, whereas the nodes of lower layers can be accessed only through the inter-layer edges and only support random node or edge sampling. To cope with this new challenge, we define a suit of two-layer graphlets and propose novel random walk sampling algorithms to estimate the proportion of all the three-node graphlets. An analytical bound on the sampling steps is proved to guarantee the convergence of our unbiased estimator. We further generalize our algorithm to explore the tradeoff between the estimated accuracy of different graphlets when the sample budget is split into different layers. Experimental evaluation on real-world and synthetic multiplex networks demonstrates the accuracy and high efficiency of our unbiased estimators.

Journal

ACM Transactions on the Web (TWEB) – Association for Computing Machinery

Published: Jun 14, 2021

Keywords: Graphlets

References

  • Graph sample and hold: A framework for big-graph analytics
    Ahmed, Nesreen K.; Duffield, Nick; Neville, Jennifer; Kompella, Ramana
  • On sampling from massive graph streams
    Ahmed, N. K.; Duffield, N.; Willke, T.; Rossi, R. A.
  • On sampling from massive graph streams
    Ahmed, N. K.; Duffield, N.; Willke, T. L.; Rossi, R. A.
  • Network sampling: From static to streaming graphs
    Ahmed, N. K.; Neville, J.; Kompella, R.
  • Efficient graphlet counting for large networks
    Ahmed, N. K.; Neville, J.; Rossi, R. A.; Duffield, N.
  • Statistical mechanics of complex networks
    Albert, Réka; Barabási, Albert-László
  • Toward secure and resilient interdependent infrastructures
    Amin, Massoud
  • Efficient semi-streaming algorithms for local triangle counting in massive graphs
    Becchetti, Luca; Boldi, Paolo; Castillo, Carlos; Gionis, Aristides
  • H
    Bhuiyan, M. A.; Rahman, M.; Rahman, M.; Al,
  • Counting multilayer temporal motifs in complex networks
    Boekhout, Hanjo D.; Kosters, Walter A.; Takes, Frank W.
  • Random Graphs
    Bollobás, Béla; Béla, Bollobás
  • Network analysis in the social sciences
    Borgatti, S. P.; Mehra, A.; Brass, D. J.; Labianca, G.
  • Social network data and practices: The case of Friendfeed
    Celli, Fabio; Di Lascio, F. Marta L.; Magnani, Matteo; Pacelli, Barbara; Rossi, Luca
  • A general framework for estimating graphlet statistics via random walk
    Chen, X.; Li, Y.; Wang, P.; Lui, J.
  • Chernoff-Hoeffding bounds for Markov chains: Generalized and simplified
    Chung, Kai-Min; Lam, Henry; Liu, Zhenming; Mitzenmacher, Michael
  • Traffic flow on a road network
    Coclite, G. M.; Garavello, M.; Piccoli, B.
  • Link prediction and recommendation across heterogeneous social networks
    Dong, Yuxiao; Tang, Jie; Wu, Sen; Tian, Jilei; Chawla, Nitesh V; Rao, Jinghai; Cao, Huanhuan
  • Markov chain Monte Carlo lecture notes
    Geyer, Charles J.
  • Multigraph sampling of online social networks
    Gjoka, M.; Butts, C. T.; Kurant, M.; Markopoulou, A.
  • The mechanism of a road network
    Godfrey, J. W.
  • Exploring the power of social hub services
    Gong, Qingyuan; Chen, Yang; Yu, Xiaolong; Xu, Chao; Guo, Zhichun; Xiao, Yu; Abdesslem, Fehmi Ben; Wang, Xin; Hui, Pan
  • Leontief-based model of risk in complex interconnected infrastructures
    Haimes, Yacov Y; Jiang, Pu
  • The Psychology of Interpersonal Relations
    Heider, Fritz
  • A combinatorial approach to graphlet counting
    Hočevar, T.; Demšar, J.
  • Bayesian approach to network modularity
    Hofman, J. M.; Wiggins, C. H.
  • Triadic closure pattern analysis and prediction in social networks
    Huang, Hong; Tang, Jie; Liu, Lu; Luo, JarDer; Fu, Xiaoming
  • A space efficient streaming algorithm for triangle counting using the birthday paradox
    Jha, M.; Seshadhri, C.; Pinar, A.
  • Path sampling: A fast and provable method for estimating 4-vertex subgraph counts
    Jha, M.; Seshadhri, C.; Pinar, A.
  • Link prediction based on subgraph evolution in dynamic social networks
    Juszczyszyn, K.; Musial, K.; Budka, M.
  • Estimating clustering coefficients and size of social networks via random walk
    Katzir, L.; Hardiman, S. J.
  • Triadic closure dynamics drives scaling laws in social multiplex networks
    Klimek, Peter; Thurner, Stefan
  • Konect: The Koblenz network collection
    Kunegis, Jérôme
  • The slashdot zoo: Mining a social network with negative edges
    Kunegis, J.; Lommatzsch, A.; Bauckhage, C.
  • Beyond random walk and metropolis-hastings samplers: Why you should not backtrack for unbiased graph sampling
    Lee, C. H.; Xu, X.; Eun, D. Y.
  • SNAP Datasets: Stanford Large Network Dataset Collection
    Leskovec, Jure; Krevl, Andrej
  • On sampling type distribution from heterogeneous social networks
    Li, J. Y.; Yeh, M. Y.
  • On random walk based graph sampling
    Li, R. H.; Yu, J. X.; Qin, L.; Mao, R.; Jin, T.
  • The ML-model for multi-layer social networks
    Magnani, Matteo; Rossi, Luca
  • Measuring the mixing time of social graphs
    Mohaisen, Abedelaziz; Yun, Aaram; Kim, Yongdae
  • Random walks on complex networks
    Noh, J. D.; Rieger, H.
  • Biological network comparison using graphlet degree distribution
    Pržulj, N.
  • Hasan
    Rahman, M.; Bhuiyan, M.; Al, M.
  • Social network analysis
    Scott, J.
  • Triadic measures on graphs: The power of wedge sampling
    Seshadhri, C.; Pinar, A.; Kolda, T. G.
  • Counting triangles and the curse of the last reducer
    Suri, S.; Vassilvitskii, S.
  • On the evolution of user interaction in Facebook
    Viswanath, Bimal; Mislove, Alan; Cha, Meeyoung; Gummadi, Krishna P.
  • Random sampling with a reservoir
    Vitter, J. S.
  • Efficiently estimating motif statistics of large networks
    Wang, P.; Lui, J.; Ribeiro, B.; Towsley, D.; Zhao, J.; Guan, X.
  • Moss: A scalable tool for efficiently sampling and counting 4-and 5-node graphlets
    Wang, P.; Tao, J.; Zhao, J.; Guan, X.
  • Collective dynamics of ‘small-world’ networks
    Watts, Duncan J.; Strogatz, Steven H.
  • FANMOD: A tool for fast network motif detection
    Wernicke, Sebastian; Rasche, Florian
  • Node clustering in wireless sensor networks: Recent developments and deployment challenges
    Younis, O.; Krunz, M.; Ramasubramanian, S.
  • Diffusion of “following” links in microblogging networks
    Zhang, Jing; Fang, Zhanpeng; Chen, Wei; Tang, Jie