Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023
Collections of abstracts of lectures (00B05) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Random matrices (probabilistic aspects) (60B20) Combinatorial probability (60Cxx) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Statistical mechanics, structure of matter (82-XX)
Summary: Since the turn of the millennium the theory of random graphs has advanced by leaps and bounds. Random graphs have found very many applications, and many unexpected applications, in a remarkable variety of disciplines, and they are nowadays studied by mathematicians with various backgrounds (combinatorialists, probabilists, mathematical physicists), computer scientists and physicists. While this diversity has led to a proliferation of new models, questions and results, the community also has shattered, and by now different methods, terminologies and research agendas have come to coexist without much interaction. The workshop brought together distinct communities, who don't typically interact at their own intra-community events, but have each made significant contributions to the recent advancements in the theory. The workshop provided an effective platform for exchanging ideas, sharing insights, and building bridges across their respective domains.
- Combinatorics, probability and computing. Abstracts from the workshop held April 14--20, 2019
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- (Dis)assortative partitions on random regular graphs
- A note on random minimum length spanning trees
- An axiomatic characterization of the Brownian map
- Convergence of non-bipartite maps via symmetrization of labeled trees
- Critical random graphs: limiting constructions and distributional properties
- Cubic graphs and related triangulations on orientable surfaces
- Enumeration of labeled 4-regular planar graphs
- Extremal Parameters in Sub-Critical Graph Classes
- Further results on random cubic planar graphs
- Graph classes with given 3-connected components: asymptotic enumeration and random graphs
- Joint convergence of random quadrangulations and their cores
- Large-scale behavior of the partial duplication random graph
- Limit of normalized quadrangulations: the Brownian map
- Liouville quantum gravity and the Brownian map II: geodesics and continuity of the embedding
- Liouville quantum gravity and the Brownian map. I: The \(\text{QLE}(8/3,0)\) metric
- Liouville quantum gravity and the Brownian map. III: The conformal structure is determined
- Minimum cost matching in a random graph with random costs
- Multi-point functions of weighted cubic maps
- On scaling limits of planar maps with stable face-degrees
- On the Analysis of a Label Propagation Algorithm for Community Detection
- On the diameter of random planar graphs
- On the expected number of perfect matchings in cubic planar graphs
- Random cubic planar graphs
- Random minimum length spanning trees in regular graphs
- Rescaled bipartite planar maps converge to the Brownian map
- Scaling limits of random graphs from subcritical classes
- The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
- The Brownian map is the scaling limit of uniform random plane quadrangulations
- The connected component of the partial duplication graph
- The continuum limit of critical random graphs
- The continuum random tree. I
- The expected degree distribution in transient duplication divergence models
- The Maximum Label Propagation Algorithm on Sparse Random Graphs
- The scaling limit of random simple triangulations and random simple quadrangulations
- The scaling limit of the minimum spanning tree of the complete graph
- The scaling limit of uniform random plane maps, via the Ambjørn-Budd bijection
- Triangles in random cubic planar graphs
- Uniqueness and universality of the Brownian map
This page was built for publication: Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076086)
