„Random regular graphs“

Suchergebnisse

1.000+ Treffer

• Asymptotic study of regular planar graphs
  Requilé, Clément 2019 Freie Universität Berlin
• Complete subgraphs of random graphs
  Schickinger, Thomas
• Correction: Sandwiching dense random regular graphs between binomial random graphs
  Gao, Pu ; Isaev, Mikhail ; McKay, Brendan D.
• On the Randomized Locality of Matching Problems in Regular Graphs
  Khoury, Seri ; Purohit, Manish ; Schild, Aaron ; Wang, Joshua R. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Potts and Random Cluster Measures on Locally Regular-Tree-Like Graphs
  Basak, Anirban ; Dembo, Amir ; Sly, Allan
• Switching Graph Matrix Norm Bounds: From i.i.d. to Random Regular Graphs
  Xu, Jeff 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Non-hyperbolicity in random regular graphs and their traffic characteristics
  Tucci, Gabriel
• Tiling Random Regular Graphs Efficiently
  Diskin, Sahar ; Hoshen, Ilay ; Zhukovskii, Maksim 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Sampling from Ising Models with Spectral Constraints
  Galanis, Andreas ; Kalavasis, Alkis ; Kandiros, Anthimos Vardis 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sampling from the Random Cluster Model on Random Regular Graphs at All Temperatures via Glauber Dynamics
  Galanis, Andreas ; Goldberg, Leslie Ann ; Smolarova, Paulina 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Metastability of the Potts Ferromagnet on Random Regular Graphs
  Coja-Oghlan, Amin ; Galanis, Andreas ; Goldberg, Leslie Ann ; Ravelomanana, Jean Bernoulli ; Štefankovič, Daniel ; Vigoda, Eric 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Simple Algorithm for Graph Reconstruction
  Mathieu, Claire ; Zhou, Hang 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Counting Independent Sets and Colorings on Random Regular Bipartite Graphs
  Liao, Chao ; Lin, Jiabao ; Lu, Pinyan ; Mao, Zhenyu 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
  Blanca, Antonio ; Galanis, Andreas ; Goldberg, Leslie Ann ; Stefankovic, Daniel ; Vigoda, Eric ; Yang, Kuan 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime
  Banks, Jess ; Kleinberg, Robert ; Moore, Cristopher 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
  Galanis, Andreas ; Stefankovic, Daniel ; Vigoda, Eric ; Yang, Linji 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Replica Bounds for the Independence Ratio of Random Regular Graphs
  Harangi, Viktor
• The diameter of random regular graphs
  Bollobás, Béla ; Fernandez de la Vega, W.
• Edge rigidity and universality of random regular graphs of intermediate degree
  Bauerschmidt, Roland ; Huang, Jiaoyang ; Knowles, Antti ; Yau, Horng-Tzer
• Spectral Gap and Edge Universality of Dense Random Regular Graphs
  He, Yukun