4 papers
Entrywise Approximate Laplacian Solving
Jingbang Chen, Mehrdad Ghadiri, Hoai-An Nguyen +2
We study the escape probability problem in random walks over graphs. Given vertices, and , the problem asks for the probability that a random walk starting at will hi…
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
Qiuyang Mang, Jingbang Chen, Hangrui Zhou +6
Bipartite graphs are ubiquitous in many domains, e.g., e-commerce platforms, social networks, and academia, by modeling interactions between distinct entity sets. Within these grap…
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
Jingbang Chen, Qiuyang Mang, Hangrui Zhou +3
Signed networks, characterized by edges labeled as either positive or negative, offer nuanced insights into interaction dynamics beyond the capabilities of unsigned graphs. Central…
Sandpile Prediction on Undirected Graphs
Ruinian Chang, Jingbang Chen, Ian Munro +3
The model is a well-known model used in exploring . Despite a large amount of work on other aspects of sandpiles, t…