Cover Image

Local Limits of Small World Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alimohammadi, Yeganeh, Işık, Senem, Saberi, Amin
Format:	Preprint
Published:	2025
Subjects:	Probability Data Structures and Algorithms Social and Information Networks Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Metric Dimension of Sparse Random Graphs
by: Díaz, Josep, et al.
Published: (2025)

Modularity and partially observed graphs
by: McDiarmid, Colin, et al.
Published: (2021)

Finding the root in random nearest neighbor trees
by: Brandenberger, Anna, et al.
Published: (2024)

Influence Maximization in Ising Models
by: Chen, Zongchen, et al.
Published: (2023)

Analysis of a Random Local Search Algorithm for Dominating Set
by: Higl, Hendrik
Published: (2026)

Node Similarities under Random Projections: Limits and Pathological Cases
by: Tadić, Tvrtko, et al.
Published: (2024)

$k$-local Graphs
by: Beth, Christian, et al.
Published: (2024)

Overlap Analysis of the Shortest Path Problem: Local Search, Landscapes, and Franz--Parisi Potential
by: Koehler, Frederic, et al.
Published: (2025)

Heights of butterfly trees
by: Peca-Medlin, John, et al.
Published: (2025)

Zero-Freeness is All You Need: A Weitz-Type FPTAS for the Entire Lee-Yang Zero-Free Region
by: Shao, Shuai, et al.
Published: (2025)

The Horton-Strahler number of butterfly trees
by: Peca-Medlin, John
Published: (2025)

An Easy Proof of a Weak Version of Chernoff inequality
by: Har-Peled, Sariel
Published: (2025)

Mixing on Generalized Associahedra
by: Chang, William, et al.
Published: (2024)

Fast Mixing in Sparse Random Ising Models
by: Liu, Kuikui, et al.
Published: (2024)

Minimal spanning arborescence
by: Ray, Gourab, et al.
Published: (2024)

Burning rooted graph products
by: Peca-Medlin, John
Published: (2026)

A Method for Generating Connected Erdos-Renyi Random Graphs
by: Chinyaev, Boris
Published: (2025)

Approximate Counting in Local Lemma Regimes
by: Mann, Ryan L., et al.
Published: (2025)

Errors are Robustly Tamed in Cumulative Knowledge Processes
by: Brandenberger, Anna, et al.
Published: (2023)

Greedy Routing in a Sequentially Grown One-Dimensional Random Graph
by: Ponomarenko, Alexander
Published: (2026)

Source Coding with Free Bits and the Multi-Way Number Partitioning Problem
by: Ahmadypour, Niloufar, et al.
Published: (2020)

Local Centrality Minimization with Quality Guarantees
by: Miyauchi, Atsushi, et al.
Published: (2024)

Efficient and Adaptive Estimation of Local Triadic Coefficients
by: Sarpe, Ilie, et al.
Published: (2025)

Polynomial-time sampling despite disorder chaos
by: Ma, Eric, et al.
Published: (2025)

Cycle-factors of regular graphs via entropy
by: Christoph, Micha, et al.
Published: (2025)

Quality control in sublinear time: a case study via random graphs
by: Marcussen, Cassandra, et al.
Published: (2025)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
by: Bansal, Nikhil, et al.
Published: (2025)

An Improved Upper Bound for the Euclidean TSP Constant Using Band Crossovers
by: Gaudio, Julia, et al.
Published: (2026)

Boltzmann Sampling for Powersets without an Oracle
by: Peyen, Jean
Published: (2026)

From Zero-Freeness to Strong Spatial Mixing via a Christoffel-Darboux Type Identity
by: Shao, Shuai, et al.
Published: (2024)

Integrating High-Dimensional Functions Deterministically
by: Gamarnik, David, et al.
Published: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
by: Kunisky, Dmitriy, et al.
Published: (2023)

The Compilability Thresholds of 2-CNF to OBDD
by: de Colnet, Alexis, et al.
Published: (2026)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
by: Kunisky, Dmitriy, et al.
Published: (2024)

Strong spatial mixing for colorings on trees and its algorithmic applications
by: Chen, Zongchen, et al.
Published: (2023)

Some easy optimization problems have the overlap-gap property
by: Li, Shuangping, et al.
Published: (2024)

Probabilistic estimates of the diameters of the Rubik's Cube groups
by: Hirata, So
Published: (2024)

Locally Differentially Private Graph Clustering via the Power Iteration Method
by: Suppakitpaisarn, Vorapong, et al.
Published: (2025)

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
by: Lin, Wenqing, et al.
Published: (2025)

Efficient Graph Matching for Correlated Stochastic Block Models
by: Chai, Shuwen, et al.
Published: (2024)