Load balancing in hypergraphs

DOI10.1007/s10955-018-1977-1zbMath1403.60015arXiv1710.00308OpenAlexW2761797504MaRDI QIDQ1633962

Payam Delgosha, Venkat Anantharam

Publication date: 21 December 2018

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.00308

zbMATH Keywords

hypergraphsunimodularityload balancinglocal weak convergenceobjective methodconfiguration modelsparse graph limits

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Stochastic network models in operations research (90B15) Combinatorial probability (60C05) Phase transitions (general) in equilibrium statistical mechanics (82B26) Information theory (general) (94A15)

Related Items (1)

Community detection in the sparse hypergraph stochastic block model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The densest subgraph problem in sparse random graphs
• Stochastic orders
• Gibbs measures and phase transitions on sparse random graphs
• Recurrence of distributional limits of finite planar graphs
• Balanced loads in infinite networks
• Processes on unimodular random networks
• Performance of global load balancing by local adjustment
• Information Theory

This page was built for publication: Load balancing in hypergraphs