Cover Image

Frustrated Random Walks: A Fast Method to Compute Node Distances on Hypergraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Enzhi, Nickleach, Scott, Fadlallah, Bilal
Format:	Preprint
Published:	2024
Subjects:	Social and Information Networks Discrete Mathematics Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Characterizing Graph Datasets for Node Classification: Homophily-Heterophily Dichotomy and Beyond
by: Platonov, Oleg, et al.
Published: (2022)

Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality
by: Li, Zihao, et al.
Published: (2024)

A QUBO Framework for Team Formation
by: Vombatkere, Karan, et al.
Published: (2025)

Schemes of Propagation Models and Source Estimators for Rumor Source Detection in Online Social Networks: A Short Survey of a Decade of Research
by: Jin, Rong, et al.
Published: (2021)

Revisiting Graph Homophily Measures
by: Mironov, Mikhail, et al.
Published: (2024)

MPXGAT: An Attention based Deep Learning Model for Multiplex Graphs Embedding
by: Bongiovanni, Marco, et al.
Published: (2024)

Non-adaptive Learning of Random Hypergraphs with Queries
by: Austhof, Bethany, et al.
Published: (2025)

Expressivity of Geometric Inhomogeneous Random Graphs -- Metric and Non-Metric
by: Dayan, Benjamin, et al.
Published: (2024)

Discrete scalar curvature as a weighted sum of Ollivier-Ricci curvatures
by: Hickok, Abigail, et al.
Published: (2025)

Zoo of Centralities: Encyclopedia of Node Metrics in Complex Networks
by: Shvydun, Sergey
Published: (2025)

HYGENE: A Diffusion-based Hypergraph Generation Method
by: Gailhard, Dorian, et al.
Published: (2024)

Causal Models for Growing Networks
by: Bravo-Hermsdorff, Gecia, et al.
Published: (2025)

CayleyPy RL: Pathfinding and Reinforcement Learning on Cayley Graphs
by: Chervov, A., et al.
Published: (2025)

A Primer on Temporal Graph Learning
by: Rahman, Aniq Ur, et al.
Published: (2024)

A Cheeger Inequality for Size-Specific Conductance
by: Huang, Yufan, et al.
Published: (2023)

A convenient trick to compute cluster sizes in a Network
by: Hsieh, Hsun-Yi, et al.
Published: (2024)

A Hierarchical Scale-free Graph Generator under Limited Resources
by: Qi, Xiaorui, et al.
Published: (2024)

Scale Free Projections Arise from Bipartite Random Networks
by: Johnston, Josh, et al.
Published: (2024)

Clustering Coefficient Reflecting Pairwise Relationships within Hyperedges
by: Miyashita, Rikuya, et al.
Published: (2024)

How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs
by: Deligkas, Argyrios, et al.
Published: (2024)

Ellipsoidal embeddings of graphs
by: Fanuel, Michaël, et al.
Published: (2024)

Constructing and Sampling Directed Graphs with Linearly Rescaled Degree Matrices
by: Yan, Yunxiang, et al.
Published: (2025)

Real-World Networks are Low-Dimensional: Theoretical and Practical Assessment
by: Friedrich, Tobias, et al.
Published: (2023)

Forming Coordinated Teams that Balance Task Coverage and Expert Workload
by: Vombatkere, Karan, et al.
Published: (2025)

Laplacian Network Optimization via Information Functions
by: Rosa, Samuel, et al.
Published: (2025)

Identifying and Characterising Higher Order Interactions in Mobility Networks Using Hypergraphs
by: Sambaturu, Prathyush, et al.
Published: (2025)

Age of Information Diffusion on Social Networks
by: Li, Songhua, et al.
Published: (2023)

A Fast Binary Splitting Approach for Non-Adaptive Learning of Erdős--Rényi Graphs
by: Ta, Hoang, et al.
Published: (2025)

A comprehensive generalization of the Friendship Paradox to weights and attributes
by: Evtushenko, Anna, et al.
Published: (2024)

A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm
by: Baumann, Philipp, et al.
Published: (2026)

Counting simplicial pairs in hypergraphs
by: Barrett, Jordan, et al.
Published: (2024)

Geometric characterisation of structural and regular equivalences in undirected (hyper)graphs
by: Eidi, Marzieh, et al.
Published: (2025)

Computing Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs
by: Vombatkere, Karan, et al.
Published: (2026)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
by: Huang, Yufan, et al.
Published: (2023)

Multipartite Entanglement Routing as a Hypergraph Immersion Problem
by: Tian, Yu, et al.
Published: (2024)

Error Bounds for the Network Scale-Up Method
by: Díaz-Aranda, Sergio, et al.
Published: (2024)

Overlapping community detection algorithms using Modularity and the cosine
by: Hieu, Do Duy, et al.
Published: (2024)

Universal vulnerability in strong modular networks with various degree distributions between inequality and equality
by: Hayashi, Yukio, et al.
Published: (2025)

From Signed Networks to Group Graphs
by: Evans, Tim S.
Published: (2025)

Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis
by: Dabah, Adel
Published: (2026)