Imagen de Portada

Identifying and Characterising Higher Order Interactions in Mobility Networks Using Hypergraphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Sambaturu, Prathyush, Gutierrez, Bernardo, Kraemer, Moritz U. G.
Formato:	Preprint
Publicado:	2025
Materias:	Social and Information Networks Artificial Intelligence Databases Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Packing Chromatic Number of the Infinite Square Grid is 15
por: Subercaseaux, Bernardo, et al.
Publicado: (2023)

Automated Discovery of Improved Constant Weight Binary Codes
por: Rosin, Christopher D.
Publicado: (2026)

Knowledge management in House of Graphs
por: Devillez, Gauvain, et al.
Publicado: (2026)

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

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

Counting simplicial pairs in hypergraphs
por: Barrett, Jordan, et al.
Publicado: (2024)

In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator
por: Davila, Randy, et al.
Publicado: (2025)

On Hypergraph Supports
por: Raman, Rajiv, et al.
Publicado: (2023)

Geometric planted matchings beyond the Gaussian model
por: Schwengber, Lucas da Rocha, et al.
Publicado: (2024)

On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
por: Sanghi, Aryan, et al.
Publicado: (2026)

On the Modular Chromatic Index of Random Hypergraphs
por: Carenini, Gaia, et al.
Publicado: (2025)

The Phase Transition of Discrepancy in Random Hypergraphs
por: MacRury, Calum, et al.
Publicado: (2021)

Using Code Generation to Solve Open Instances of Combinatorial Design Problems
por: Rosin, Christopher D.
Publicado: (2025)

Hypergraphs with Polynomial Representation: Introducing $r$-splits
por: Pitois, François, et al.
Publicado: (2022)

Critical Thresholds for Maximum Cardinality Matching on General Hypergraphs
por: Sumnicht, Christopher, et al.
Publicado: (2024)

Decidability of Querying First-Order Theories via Countermodels of Finite Width
por: Feller, Thomas, et al.
Publicado: (2023)

Hypergraph Representation via Axis-Aligned Point-Subspace Cover
por: Firman, Oksana, et al.
Publicado: (2021)

Optimal and Efficient Partite Decompositions of Hypergraphs
por: Krapivin, Andrew, et al.
Publicado: (2025)

Aspects of Artificial Intelligence: Transforming Machine Learning Systems Naturally
por: Guo, Xiuzhan
Publicado: (2025)

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

Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
por: Arras, Patrick, et al.
Publicado: (2024)

Price of Locality in Permutation Mastermind: Are TikTok influencers Chaotic Enough?
por: Subercaseaux, Bernardo
Publicado: (2026)

Progress on Self Identifying Codes
por: Jean, Devin, et al.
Publicado: (2025)

Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools
por: Du, Alina, et al.
Publicado: (2026)

An AI enhanced approach to the tree unimodality conjecture
por: Ramos, Eric, et al.
Publicado: (2025)

Universal cycle constructions for k-subsets and k-multisets
por: Campbell, Colin, et al.
Publicado: (2026)

Optimal Erasure Codes and Codes on Graphs
por: Chen, Yeyuan, et al.
Publicado: (2025)

Generalized Three and Four Person Hat Game
por: van Uem, Theo
Publicado: (2017)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
por: Wang, Shuche, et al.
Publicado: (2024)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
por: Gabrić, Daniel, et al.
Publicado: (2024)

Threshold rates for properties of random codes
por: Guruswami, Venkatesan, et al.
Publicado: (2020)

Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
por: Mizunuma, Yuto, et al.
Publicado: (2026)

The Labeled Coupon Collector Problem
por: Tan, Andrew, et al.
Publicado: (2025)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
por: Gabric, Daniel, et al.
Publicado: (2026)

Reconstructing graphs with subgraph compositions
por: Dailly, Antoine, et al.
Publicado: (2025)

On Average Distance, Level-1 Fourier Weight, and Chang's Lemma
por: Yu, Lei
Publicado: (2025)

Evaluating the Gilbert-Varshamov Bound for Constrained Systems
por: Goyal, Keshav, et al.
Publicado: (2024)

Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
por: Goyal, Keshav, et al.
Publicado: (2024)

Improved Upper Bound for the Size of a Trifferent Code
por: Bhandari, Siddharth, et al.
Publicado: (2024)

On the Codebook Design for NOMA Schemes from Bent Functions
por: Li, Chunlei, et al.
Publicado: (2025)