Image de couverture de livre

Finding Influential Cores via Normalized Ricci Flows in Directed and Undirected Hypergraphs with Applications

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sengupta, Prithviraj, Azarhooshang, Nazanin, Albert, Reka, DasGupta, Bhaskar
Format:	Preprint
Publié:	2025
Sujets:	Social and Information Networks Computational Engineering, Finance, and Science Physics and Society Molecular Networks 68W05, 05C65, 68R10, 92-10 G.2.2; F.2.2; J.3; J.4
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

A framework for distributed discrete evacuation strategies
par: Borowiecki, Piotr, et autres
Publié: (2025)

Computing the forcing spectrum of outerplanar graphs in polynomial time
par: Gorsky, Maximilian, et autres
Publié: (2024)

Searching by Heterogeneous Agents
par: Dereniowski, Dariusz, et autres
Publié: (2021)

Exact Algorithms for MaxCut on Split Graphs
par: Lalovic, Marko
Publié: (2024)

Local iterative algorithms for approximate symmetry guided by network centralities
par: Hartman, David, et autres
Publié: (2025)

No Traffic to Cry: Traffic-Oblivious Link Deactivation for Green Traffic Engineering
par: Ilsen, Max, et autres
Publié: (2026)

A Systematic Evaluation Protocol of Graph-Derived Signals for Tabular Machine Learning
par: Heidrich, Mario, et autres
Publié: (2026)

A Constant-factor Approximation for Weighted Bond Cover
par: Kim, Eun Jung, et autres
Publié: (2021)

Point Location in Constant Time
par: Chaganti, Sairam, et autres
Publié: (2023)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
par: Gabryelski, Wojciech, et autres
Publié: (2026)

Finding Complex Patterns in Trajectory Data via Geometric Set Cover
par: Conradi, Jacobus, et autres
Publié: (2023)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

Computing shortest closed curves on non-orientable surfaces
par: Bulavka, Denys, et autres
Publié: (2024)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
par: Hommelsheim, Felix
Publié: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2023)

Pliability and Approximating Max-CSPs
par: Romero, Miguel, et autres
Publié: (2019)

Ordered Leaf Attachment (OLA) Vectors can Identify Reticulation Events even in Multifurcated Trees
par: Markin, Alexey, et autres
Publié: (2025)

On the difficulty of order constrained pattern matching with applications to feature matching based malware detection
par: Liyanage, Adiesha, et autres
Publié: (2025)

A $5/4$-Approximation for Two-Edge Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2024)

Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It
par: Bressan, Marco, et autres
Publié: (2026)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
par: Rockel-Wolff, Benjamin
Publié: (2024)

Drift and selection in LLM text ecosystems
par: Riis, Søren
Publié: (2026)

CyNetDiff -- A Python Library for Accelerated Implementation of Network Diffusion Models
par: Robson, Eliot W., et autres
Publié: (2024)

Fast FPT Algorithms for Grundy Number on Dense Graphs
par: Nezhad, Sina Ghasemi, et autres
Publié: (2024)

Minimum-cost paths for electric cars
par: Dorfman, Dani, et autres
Publié: (2024)

Understanding and Tackling Over-Dilution in Graph Neural Networks
par: Lee, Junhyun, et autres
Publié: (2025)

Optimizing Genetic Algorithms Using the Binomial Distribution
par: Cicirello, Vincent A.
Publié: (2024)

Spatial-Temporal Learning-Based Distributed Routing for Dynamic LEO Satellite Networks
par: Chou, Po-Heng, et autres
Publié: (2026)

On the Average-Case Performance of Greedy for Maximum Coverage
par: Balkanski, Eric, et autres
Publié: (2026)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
par: Opris, Andre
Publié: (2025)

Searching in trees with monotonic query times
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Evidence for a Functional Proximity Law in Multilayer Networks
par: Ivanov, Vladi
Publié: (2026)

Paired 2-disjoint path covers of Bcube under the partitioned edge fault model
par: Zhang, Wenjing, et autres
Publié: (2025)

Lozenge Tiling by Computing Distances
par: Favreau, Jean-Marie, et autres
Publié: (2026)

Completely independent spanning trees in the hypercube
par: Shaw, Benedict Randall
Publié: (2024)

LOFA: Online Influence Maximization under Full-Bandit Feedback using Lazy Forward Selection
par: Xu, Jinyu, et autres
Publié: (2026)

Towards a format for describing networks / 2. Format elements
par: Batagelj, Vladimir, et autres
Publié: (2025)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
par: Haslebacher, Sebastian
Publié: (2025)

A Community-Aware Framework for Influence Maximization with Explicit Accounting for Inter-Community Influence
par: Robson, Eliot W., et autres
Publié: (2025)