Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Random Walk on Multiple Networks (2307.01637v1)

Published 4 Jul 2023 in cs.SI, cs.AI, and cs.IR

Abstract: Random Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited information. In contrast, real data often contain entities with different types or/and from different sources, which are comprehensive and can be better modeled by multiple networks. To take advantage of rich information in multiple networks and make better inferences on entities, in this study, we propose random walk on multiple networks, RWM. RWM is flexible and supports both multiplex networks and general multiple networks, which may form many-to-many node mappings between networks. RWM sends a random walker on each network to obtain the local proximity (i.e., node visiting probabilities) w.r.t. the starting nodes. Walkers with similar visiting probabilities reinforce each other. We theoretically analyze the convergence properties of RWM. Two approximation methods with theoretical performance guarantees are proposed for efficient computation. We apply RWM in link prediction, network embedding, and local community detection. Comprehensive experiments conducted on both synthetic and real-world datasets demonstrate the effectiveness and efficiency of RWM.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (62)
  1. M. Alamgir and U. Von Luxburg. Multi-agent random walks for local clustering on graphs. In ICDM, pages 18–27, 2010.
  2. Local graph partitioning using pagerank vectors. In FOCS, pages 475–486, 2006.
  3. Efficient and effective community search. Data mining and knowledge discovery, 29(5):1406–1433, 2015.
  4. Memory-based random walk for multi-query local community detection. Knowledge and Information Systems, pages 1–35, 2019.
  5. Many heads are better than one: Local community detection by the multi-walker chain. In ICDM, pages 21–30, 2017.
  6. The multi-walker chain and its application in local community detection. Knowledge and Information Systems, 60(3):1663–1691, 2019.
  7. On multi-query local community detection. In ICDM, pages 9–18, 2018.
  8. Netgan: Generating graphs via random walks. In International conference on machine learning, pages 610–619. PMLR, 2018.
  9. Grarep: Learning graph representations with global structural information. In CIKM, 2015.
  10. Pme: projected metric embedding on heterogeneous networks for link prediction. In SIGKDD, 2018.
  11. Flexible and robust co-regularized multi-domain graph clustering. In SIGKDD, pages 320–328. ACM, 2013.
  12. Identifying modular flows on multilayer networks reveals highly overlapping organization in interconnected systems. Physical Review X, 5(1):011027, 2015.
  13. Structural reducibility of multilayer networks. Nature communications, 6:6864, 2015.
  14. Multi-layered graph embedding with graph convolutional networks. arXiv preprint arXiv:1811.08800, 2018.
  15. A. Grover and J. Leskovec. node2vec: Scalable feature learning for networks. In SIGKDD, pages 855–864, 2016.
  16. Local community detection in multilayer networks. Data Mining and Knowledge Discovery, 31(5):1444–1479, 2017.
  17. G. Jeh and J. Widom. Simrank: a measure of structural-context similarity. In KDD, pages 538–543, 2002.
  18. J. Kim and J.-G. Lee. Community detection in multi-layer graphs: A survey. ACM SIGMOD Record, 44(3):37–48, 2015.
  19. Multilayer networks. Journal of complex networks, 2(3):203–271, 2014.
  20. Predict then propagate: Graph neural networks meet personalized pagerank. In ICLR, 2018.
  21. Diffusion improves graph learning. In NeurIPS, 2019.
  22. K. Kloster and D. F. Gleich. Heat kernel based community detection. In SIGKDD, pages 1386–1395, 2014.
  23. A. Lancichinetti and S. Fortunato. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Physical Review E, 2009.
  24. Google’s PageRank and beyond: The science of search engine rankings. Princeton University Press, 2011.
  25. J. Leskovec and J. J. Mcauley. Learning to discover social circles in ego networks. In NIPS, pages 539–547, 2012.
  26. Multi-layered network embedding. In SDM, 2018.
  27. Uncovering the small community structure in large networks: A local spectral approach. In WWW, pages 658–668, 2015.
  28. K. W. Lim and W. Buntine. Bibliographic analysis on research publications using authors, categorical labels and the citation network. Machine Learning, 103(2):185–213, 2016.
  29. Robust multi-network clustering via joint cross-domain cluster alignment. In ICDM, pages 291–300. IEEE, 2015.
  30. L. Lovász et al. Random walks on graphs: A survey. Combinatorics, Paul erdos is eighty, 2(1):1–46, 1993.
  31. D. Lu and H. Zhang. Stochastic process and applications. Tsinghua University Press, 1986.
  32. Similarity index based on local paths for link prediction of complex networks. Physical Review E, 80(4):046122, 2009.
  33. Deep multi-graph clustering via attentive cross-graph association. In WSDM, pages 393–401, 2020.
  34. Query independent scholarly article ranking. In ICDE, 2018.
  35. A survey of link prediction in complex networks. ACM Computing Surveys, 2017.
  36. Distributed representations of words and phrases and their compositionality. In NIPS, 2013.
  37. Community structure in time-dependent, multiscale, and multiplex networks. Science, 328(5980):876–878, 2010.
  38. Community structure in time-dependent, multiscale, and multiplex networks. science, 328(5980):876–878, 2010.
  39. M. E. Newman. Coauthorship networks and patterns of scientific collaboration. Proceedings of the national academy of sciences, 101(suppl 1):5200–5205, 2004.
  40. Co-regularized deep multi-network embedding. In WWW, pages 469–478, 2018.
  41. Comclus: A self-grouping framework for multi-network clustering. IEEE Transactions on Knowledge and Data Engineering, 30(3):435–448, 2018.
  42. Characterizing interactions in online social networks during exceptional events. Frontiers in Physics, 3:59, 2015.
  43. A multi-network clustering method for detecting protein complexes from multiple heterogeneous networks. BMC bioinformatics, 2017.
  44. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab, 1999.
  45. Scikit-learn: Machine learning in Python. JMLR, 2011.
  46. Deepwalk: Online learning of social representations. In SIGKDD, 2014.
  47. Line: Large-scale information network embedding. In WWW, pages 1067–1077, 2015.
  48. Arnetminer: extraction and mining of academic social networks. In SIGKDD, pages 990–998, 2008.
  49. Fast random walk with restart and its applications. In ICDM, pages 613–622, 2006.
  50. The wu-minn human connectome project: an overview. Neuroimage, 80:62–79, 2013.
  51. Flow-based local graph clustering with better seed set inclusion. In SDM, pages 378–386, 2019.
  52. Network embedding based recommendation method in social networks. In WWW, 2018.
  53. Remember where you came from: on the second-order random walk based proximity measures. Proceedings of the VLDB Endowment, 10(1):13–24, 2016.
  54. Robust local community detection: on free rider effect and its elimination. PVLDB, 8(7):798–809, 2015.
  55. Second-order random walk-based proximity measures in graph analysis: formulations and algorithms. The VLDB Journal, 27(1):127–152, 2018.
  56. Graph meta network for multi-behavior recommendation. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 757–766, 2021.
  57. Constrained local graph clustering by colored random walk. In WWW, pages 2137–2146, 2019.
  58. Local graph clustering by multi-network random walk with restart. In PAKDD, pages 490–501, 2018.
  59. Multiplex heterogeneous graph convolutional network. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 2377–2387, 2022.
  60. H. Zhang and G. Kou. Role-based multiplex network embedding. In International Conference on Machine Learning, pages 26265–26280. PMLR, 2022.
  61. Multiplex graph neural networks for multi-behavior recommendation. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pages 2313–2316, 2020.
  62. A semi-supervised network embedding model for protein complexes detection. In AAAI, 2018.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now