Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023
DOI10.4171/owr/2023/16zbMath1525.00014MaRDI QIDQ6076086
No author found.
Publication date: 23 October 2023
Published in: Oberwolfach Reports (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Collections of abstracts of lectures (00B05) Graph algorithms (graph-theoretic aspects) (05C85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Statistical mechanics, structure of matter (82-XX) Combinatorial probability (60Cxx)
Cites Work
- Multi-point functions of weighted cubic maps
- Rescaled bipartite planar maps converge to the Brownian map
- Triangles in random cubic planar graphs
- Scaling limits of random graphs from subcritical classes
- Uniqueness and universality of the Brownian map
- The Brownian map is the scaling limit of uniform random plane quadrangulations
- Critical random graphs: limiting constructions and distributional properties
- The scaling limit of uniform random plane maps, via the Ambjørn-Budd bijection
- The continuum random tree. I
- Limit of normalized quadrangulations: the Brownian map
- Random minimum length spanning trees in regular graphs
- Random planar lattices and integrated superBrownian excursion
- A note on random minimum length spanning trees
- The scaling limit of random simple triangulations and random simple quadrangulations
- The scaling limit of the minimum spanning tree of the complete graph
- Enumeration of labeled 4-regular planar graphs
- Joint convergence of random quadrangulations and their cores
- Cubic graphs and related triangulations on orientable surfaces
- Liouville quantum gravity and the Brownian map II: geodesics and continuity of the embedding
- On the expected number of perfect matchings in cubic planar graphs
- Convergence of non-bipartite maps via symmetrization of labeled trees
- Liouville quantum gravity and the Brownian map. I: The \(\text{QLE}(8/3,0)\) metric
- The continuum limit of critical random graphs
- An axiomatic characterization of the Brownian map
- Liouville quantum gravity and the Brownian map. III: The conformal structure is determined
- Large-scale behavior of the partial duplication random graph
- Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
- On the diameter of random planar graphs
- Minimum Cost Matching in a Random Graph with Random Costs
- Random cubic planar graphs
- The connected component of the partial duplication graph
- On scaling limits of planar maps with stable face-degrees
- The expected degree distribution in transient duplication divergence models
- Further results on random cubic planar graphs
- Extremal Parameters in Sub-Critical Graph Classes
- On the Analysis of a Label Propagation Algorithm for Community Detection
- The Maximum Label Propagation Algorithm on Sparse Random Graphs
- (Dis)assortative partitions on random regular graphs
- The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
This page was built for publication: Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023
