Random recursive hypergraphs
From MaRDI portal
Publication:5889873
DOI10.1088/1751-8121/ACCAC0OpenAlexW4362603456MaRDI QIDQ5889873FDOQ5889873
Authors: P. L. Krapivsky 
Publication date: 27 April 2023
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.07371
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Title not available (Why is that?)
- Analytic combinatorics
- Networks, crowds and markets. Reasoning about a highly connected world.
- Networks. An introduction.
- Random Trees
- Title not available (Why is that?)
- Spanning trees in random regular uniform hypergraphs
- Homological connectivity of random k -dimensional complexes
- Title not available (Why is that?)
- Homological connectivity of random 2-complexes
- Finiteness and fluctuations in growing networks
- Asymptotic degree distribution in random recursive trees
- A directed hypergraph model for random time dependent shortest paths
- The cut-tree of large recursive trees
- Eulerian Numbers
- Component structure in the evolution of random hypergraphs
- Hypergraph theory. An introduction
- Note on the heights of random recursive trees and random m‐ary search trees
- On the phase transition in random simplicial complexes
- Euler-Frobenius numbers and rounding
- Title not available (Why is that?)
- Introduction to Random Graphs
- Preferential attachment with choice
- The power of choice combined with preferential attachement
- The power of choice in the construction of recursive trees
- The power of choice in growing trees
- Topological characteristics of random triangulated surfaces
- The asymptotics of the clustering transition for random constraint satisfaction problems
- Social balance on networks: the dynamics of friendship and enmity
- Exponential random simplicial complexes
- Multilayer Networks
- Biased landscapes for random constraint satisfaction problems
- A model for random three-manifolds
- Large random simplicial complexes, II; the fundamental group
- On a surface formed by randomly gluing together polygonal discs
- Spectra of random regular hypergraphs
- Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
- On the vanishing of homology in random Čech complexes
- Large random simplicial complexes, I
- Configuration models of random hypergraphs
- Largest Components in Random Hypergraphs
- Network geometry and complexity
- Emergent network modularity
- An asymptotic distribution theory for Eulerian recurrences with applications
- Large random simplicial complexes, III the critical dimension
- Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication
- Choice-driven phase transition in complex networks
- Random Recursive Trees and Preferential Attachment Trees are Random Split Trees
- The diameter of random Belyĭ surfaces
- Random Simplicial Complexes: Models and Phenomena
- Opinion Dynamics on Discourse Sheaves
- Sparse SYK and traversable wormholes
- Analytical results for the in-degree and out-degree distributions of directed random networks that grow by node duplication
- Title not available (Why is that?)
- Highly dispersed networks generated by enhanced redirection
- Spectral form factor in sparse SYK models
- Phase transitions in theq-coloring of random hypergraphs
- First-passage properties of the Pólya urn process
Cited In (3)
This page was built for publication: Random recursive hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889873)
