Imagen de Portada

Fast Query of Biharmonic Distance in Networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Liu, Changan, Zehmakan, Ahad N., Zhang, Zhongzhi
Formato:	Preprint
Publicado:	2024
Materias:	Social and Information Networks
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Promoting Fairness in Information Access within Social Networks
por: Liu, Changan, et al.
Publicado: (2025)

Efficient Edge Rewiring Strategies for Enhancing PageRank Fairness
por: Liu, Changan, et al.
Publicado: (2026)

ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
por: Zheng, Dehong, et al.
Publicado: (2025)

Do Stubborn Users Always Cause More Polarization and Disagreement? A Mathematical Study
por: Shirzadi, Mohammad, et al.
Publicado: (2024)

More Efficient Sybil Detection Mechanisms Leveraging Resistance of Users to Attack Requests
por: Dehkordi, Ali Safarpoor, et al.
Publicado: (2025)

Opinion Dynamics: A Comprehensive Overview
por: Shirzadi, Mohammad, et al.
Publicado: (2025)

Quantifying and Minimizing Perception Gap in Social Networks
por: Gehlot, Hemant Kumar, et al.
Publicado: (2025)

A Generalisation of Voter Model: Influential Nodes and Convergence Properties
por: Manohara, Abhiram, et al.
Publicado: (2024)

The Impact of External Sources on the Friedkin-Johnsen Model
por: Out, Charlotte, et al.
Publicado: (2025)

DeepSN: A Sheaf Neural Framework for Influence Maximization
por: Hevapathige, Asela, et al.
Publicado: (2024)

Fast Computation of Kemeny's Constant for Directed Graphs
por: Xia, Haisong, et al.
Publicado: (2024)

Fast Maximization of Current Flow Group Closeness Centrality
por: Xia, Haisong, et al.
Publicado: (2025)

Graph-based Fake Account Detection: A Survey
por: Dehkordi, Ali Safarpoor, et al.
Publicado: (2025)

Efficient Algorithms for Computing Random Walk Centrality
por: Liu, Changan, et al.
Publicado: (2025)

Fast Computation for the Forest Matrix of an Evolving Graph
por: Sun, Haoxin, et al.
Publicado: (2024)

Biharmonic Distance of Graphs and its Higher-Order Variants: Theoretical Properties with Applications to Centrality and Clustering
por: Black, Mitchell, et al.
Publicado: (2024)

Opinion Maximization in Social Networks by Modifying Internal Opinions
por: Wang, Gengyu, et al.
Publicado: (2025)

A First Principles Approach to Trust-Based Recommendation Systems in Social Networks
por: Stefanopoulos, Paras, et al.
Publicado: (2024)

Means of Hitting Times for Random Walks on Graphs: Connections, Computation, and Optimization
por: Xia, Haisong, et al.
Publicado: (2024)

Behavior and Sublinear Algorithm for Opinion Disagreement on Noisy Social Networks
por: Xu, Wanyue, et al.
Publicado: (2026)

Efficient Algorithms for Relevant Quantities of Friedkin-Johnsen Opinion Dynamics Model
por: Wang, Gengyu, et al.
Publicado: (2025)

Role Similarity Metric Based on Spanning Rooted Forest
por: Bao, Qi, et al.
Publicado: (2021)

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
por: Zhou, Xiaotian, et al.
Publicado: (2025)

Opinion Dynamics Incorporating Higher-Order Interactions
por: Zhang, Zuobai, et al.
Publicado: (2021)

Friedkin-Johnsen Model for Opinion Dynamics on Signed Graphs
por: Zhou, Xiaotian, et al.
Publicado: (2024)

The Decay of Impact with Network Distance in Linear Diffusion Processes
por: Murray-Watters, Alexander, et al.
Publicado: (2026)

Approximating Spatial Distance Through Confront Networks: Application to the Segmentation of Medieval Avignon
por: Ferrand, Margot, et al.
Publicado: (2024)

T-REX: Fast and Dynamic Journey Planning for Continental-Scale Public Transit Networks
por: Sauer, Jonas, et al.
Publicado: (2026)

Triadic First-Order Logic Queries in Temporal Networks
por: Bhalerao, Omkar, et al.
Publicado: (2025)

HIP: Model-Agnostic Hypergraph Influence Prediction via Distance-Centrality Fusion and Neural ODEs
por: Zhang, Su-Su, et al.
Publicado: (2025)

SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation
por: Liu, Haoyu, et al.
Publicado: (2023)

Recognizing Distance-Count Matrices is Difficult
por: Boldi, Paolo, et al.
Publicado: (2025)

Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information
por: Chen, Tianyi, et al.
Publicado: (2024)

Impact of Distance on Epidemiological Dynamics in Human Connection Network with Mobility
por: Arquam, Md., et al.
Publicado: (2025)

Threadle: A Memory-Efficient Network Storage and Query Engine for Large, Multilayer, and Mixed-mode Networks
por: Nordlund, Carl, et al.
Publicado: (2026)

Frustrated Random Walks: A Fast Method to Compute Node Distances on Hypergraphs
por: Li, Enzhi, et al.
Publicado: (2024)

Fast and Robust Flocking of Protesters on Street Networks
por: Moinard, Guillaume, et al.
Publicado: (2024)

icon: Fast Simulation of Epidemics on Coevolving Networks
por: Großmann, Gerrit, et al.
Publicado: (2024)

HetFS: A Method for Fast Similarity Search with Ad-hoc Meta-paths on Heterogeneous Information Networks
por: Mao, Xuqi, et al.
Publicado: (2025)

Distance-Based Hierarchical Cutting of Complex Networks with Non-Preferential and Preferential Choice of Seeds
por: Benatti, Alexandre, et al.
Publicado: (2024)