Imagen de Portada

Expressivity of Geometric Inhomogeneous Random Graphs -- Metric and Non-Metric

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Dayan, Benjamin, Kaufmann, Marc, Schaller, Ulysse
Formato:	Preprint
Publicado:	2024
Materias:	Social and Information Networks Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs
por: Friedrich, Tobias, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

Revisiting Graph Homophily Measures
por: Mironov, Mikhail, et al.
Publicado: (2024)

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

From Signed Networks to Group Graphs
por: Evans, Tim S.
Publicado: (2025)

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

On Function-Correcting Codes in the Lee Metric
por: Verma, Gyanendra K., et al.
Publicado: (2025)

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

Multiset Metric Dimension of Binomial Random Graphs
por: Eide, Austin, 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)

Metric-Based Granular Computing in Networks
por: Arshad, Hibba, et al.
Publicado: (2025)

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

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

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

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

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

Random Abstract Cell Complexes
por: Hoppe, Josef, et al.
Publicado: (2024)

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

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

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
por: Davot, Tom, et al.
Publicado: (2024)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
por: Basu, Sabyasachi, et al.
Publicado: (2024)

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution
por: Li, Songhua, et al.
Publicado: (2023)

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

Aggregating maximal cliques in real-world graphs
por: Alon, Noga, et al.
Publicado: (2025)

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

Spectral Triadic Decompositions of Real-World Networks
por: Basu, Sabyasachi, et al.
Publicado: (2022)

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