ProbWalk: A random walk approach in weighted graph embedding
نویسندگان
چکیده
منابع مشابه
Graph Embedding through Random Walk for Shortest Paths Problems
We present a new probabilistic technique of embedding graphs in Z, the d-dimensional integer lattice, in order to find the shortest paths and shortest distances between pairs of nodes. In our method the nodes of a breath first search (BFS) tree, starting at a particular node, are labeled as the sites found by a branching random walk on Z. After describing a greedy algorithm for routing (distanc...
متن کاملFast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it suffers from the expensive computational cost which is at least O(n) or O(m) for graphs with n nodes and m edges. In this paper, we propose Ark, a set of fast algorithms for random walk graph kernel computation. Ark is...
متن کاملCommunity aware random walk for network embedding
Social network analysis provides meaningful information about behavior of network members that can be used for diverse applications such as classification, link prediction. However, network analysis is computationally expensive because of feature learning for different applications. In recent years, many researches have focused on feature learning methods in social networks. Network embedding r...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملEmbedding large graphs into a random graph
In this paper we consider the problem of embedding bounded degree graphs which are almost spanning in a random graph. In particular, let ∆ ≥ 5 and let H be a graph on (1−o(1))n vertices and with maximum degree ∆. We show that a random graph Gn,p with high probability contains a copy of H, provided that p (n−1 log n). Our assumption on p is optimal (including the powers in the log term) with res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2021
ISSN: 1877-0509
DOI: 10.1016/j.procs.2021.02.115