Image de couverture de livre

A convenient trick to compute cluster sizes in a Network

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hsieh, Hsun-Yi, Kao, Yu-Chun
Format:	Preprint
Publié:	2024
Sujets:	Discrete Mathematics Social and Information Networks
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Laplacian Network Optimization via Information Functions
par: Rosa, Samuel, et autres
Publié: (2025)

Real-World Networks are Low-Dimensional: Theoretical and Practical Assessment
par: Friedrich, Tobias, et autres
Publié: (2023)

Age of Information Diffusion on Social Networks
par: Li, Songhua, et autres
Publié: (2023)

A Cheeger Inequality for Size-Specific Conductance
par: Huang, Yufan, et autres
Publié: (2023)

A Hierarchical Scale-free Graph Generator under Limited Resources
par: Qi, Xiaorui, et autres
Publié: (2024)

Clustering Coefficient Reflecting Pairwise Relationships within Hyperedges
par: Miyashita, Rikuya, et autres
Publié: (2024)

How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs
par: Deligkas, Argyrios, et autres
Publié: (2024)

Expressivity of Geometric Inhomogeneous Random Graphs -- Metric and Non-Metric
par: Dayan, Benjamin, et autres
Publié: (2024)

Ellipsoidal embeddings of graphs
par: Fanuel, Michaël, et autres
Publié: (2024)

Constructing and Sampling Directed Graphs with Linearly Rescaled Degree Matrices
par: Yan, Yunxiang, et autres
Publié: (2025)

Forming Coordinated Teams that Balance Task Coverage and Expert Workload
par: Vombatkere, Karan, et autres
Publié: (2025)

Schemes of Propagation Models and Source Estimators for Rumor Source Detection in Online Social Networks: A Short Survey of a Decade of Research
par: Jin, Rong, et autres
Publié: (2021)

From Signed Networks to Group Graphs
par: Evans, Tim S.
Publié: (2025)

A comprehensive generalization of the Friendship Paradox to weights and attributes
par: Evtushenko, Anna, et autres
Publié: (2024)

Zoo of Centralities: Encyclopedia of Node Metrics in Complex Networks
par: Shvydun, Sergey
Publié: (2025)

Scale Free Projections Arise from Bipartite Random Networks
par: Johnston, Josh, et autres
Publié: (2024)

Counting simplicial pairs in hypergraphs
par: Barrett, Jordan, et autres
Publié: (2024)

Geometric characterisation of structural and regular equivalences in undirected (hyper)graphs
par: Eidi, Marzieh, et autres
Publié: (2025)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
par: Basu, Sabyasachi, et autres
Publié: (2024)

Spectral Triadic Decompositions of Real-World Networks
par: Basu, Sabyasachi, et autres
Publié: (2022)

A QUBO Framework for Team Formation
par: Vombatkere, Karan, et autres
Publié: (2025)

Frustrated Random Walks: A Fast Method to Compute Node Distances on Hypergraphs
par: Li, Enzhi, et autres
Publié: (2024)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
par: Davot, Tom, et autres
Publié: (2024)

Overlapping community detection algorithms using Modularity and the cosine
par: Hieu, Do Duy, et autres
Publié: (2024)

Revisiting Graph Homophily Measures
par: Mironov, Mikhail, et autres
Publié: (2024)

MPXGAT: An Attention based Deep Learning Model for Multiplex Graphs Embedding
par: Bongiovanni, Marco, et autres
Publié: (2024)

Universal vulnerability in strong modular networks with various degree distributions between inequality and equality
par: Hayashi, Yukio, et autres
Publié: (2025)

A Parallel Hierarchical Approach for Community Detection on Large-scale Dynamic Networks
par: Bokov, Grigoriy, et autres
Publié: (2025)

Error Bounds for the Network Scale-Up Method
par: Díaz-Aranda, Sergio, et autres
Publié: (2024)

Identifying and Characterising Higher Order Interactions in Mobility Networks Using Hypergraphs
par: Sambaturu, Prathyush, et autres
Publié: (2025)

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution
par: Li, Songhua, et autres
Publié: (2023)

Computing Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs
par: Vombatkere, Karan, et autres
Publié: (2026)

Aggregating maximal cliques in real-world graphs
par: Alon, Noga, et autres
Publié: (2025)

Characterizing Graph Datasets for Node Classification: Homophily-Heterophily Dichotomy and Beyond
par: Platonov, Oleg, et autres
Publié: (2022)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
par: Huang, Yufan, et autres
Publié: (2023)

Causal Models for Growing Networks
par: Bravo-Hermsdorff, Gecia, et autres
Publié: (2025)

Discrete scalar curvature as a weighted sum of Ollivier-Ricci curvatures
par: Hickok, Abigail, et autres
Publié: (2025)

Larger holes as narrower degree distributions in complex networks
par: Kawato, Kiri, et autres
Publié: (2025)

Coalgebraic analysis of social systems
par: Motamed, Nima, et autres
Publié: (2026)

Multipartite Entanglement Routing as a Hypergraph Immersion Problem
par: Tian, Yu, et autres
Publié: (2024)