A new approach to the orientation of random hypergraphs

zbMath1423.05111arXiv1201.5335MaRDI QIDQ5743396

Marc Lelarge

Publication date: 10 May 2019

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20)

Related Items

Load Thresholds for Cuckoo Hashing with Overlapping Blocks, Matchings on infinite graphs, Load Thresholds for Cuckoo Hashing with Overlapping Blocks, Solution of the monomer-dimer model on locally tree-like graphs. Rigorous results, Sharp threshold for rigidity of random graphs, Thresholds for extreme orientability, Dynamic space efficient hashing, Unnamed Item, A new approach to the orientation of random hypergraphs, A faster algorithm for cuckoo insertion and bipartite matching in large graphs, Load Thresholds for Cuckoo Hashing with Double Hashing, An average study of hypergraphs and their minimal transversals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The rank of diluted random graphs
• Weighted enumeration of spanning subgraphs with degree constraints
• Fast concurrent access to parallel disks
• Recurrence of distributional limits of finite planar graphs
• Processes on unimodular random networks
• Towards a theory of negative dependence
• Load balancing and orientability thresholds for random hypergraphs
• Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
• A simple solution to the k‐core problem
• Tight Thresholds for Cuckoo Hashing via XORSAT
• Orientability of Random Hypergraphs and the Power of Multiple Choices
• Information, Physics, and Computation
• The Multiple-orientability Thresholds for Random Hypergraphs
• Convergence of Multivariate Belief Propagation, with Applications to Cuckoo Hashing and Load Balancing
• A new approach to the orientation of random hypergraphs