Balanced Bidirectional Breadth-First Search on Scale-Free Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cerf, Sacha, Dayan, Benjamin, De Ambroggio, Umberto, Kaufmann, Marc, Lengler, Johannes, Schaller, Ulysse
Format:	Preprint
Published:	2024
Subjects:	Social and Information Networks Combinatorics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Expanders in Models of Social Networks
by: Kaufmann, Marc, et al.
Published: (2025)

Assortativity in geometric and scale-free networks
by: Kaufmann, Marc, et al.
Published: (2025)

Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models
by: Kaufmann, Marc, et al.
Published: (2024)

Degree-dependent and distance-dependent contact rates interpolate between explosive, exponential and polynomial epidemic growth
by: Benjert, Zylan, et al.
Published: (2026)

Expressivity of Geometric Inhomogeneous Random Graphs -- Metric and Non-Metric
by: Dayan, Benjamin, et al.
Published: (2024)

Sublinear Cuts are the Exception in BDF-GIRGs
by: Kaufmann, Marc, et al.
Published: (2024)

Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I
by: Komjáthy, Júlia, et al.
Published: (2023)

Polynomial growth in degree-dependent first passage percolation on spatial random graphs
by: Komjáthy, Júlia, et al.
Published: (2023)

Faster Optimization Through Genetic Drift
by: Florescu, Cella, et al.
Published: (2024)

Limit Laws for Critical Dispersion on Complete Graphs
by: De Ambroggio, Umberto, et al.
Published: (2024)

Dispersion on the Complete Graph
by: De Ambroggio, Umberto, et al.
Published: (2023)

The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs
by: Benjert, Zylan, et al.
Published: (2025)

Repeat times and a two-weight UST model
by: De Ambroggio, Umberto, et al.
Published: (2025)

Improved bounds for polylogarithmic graph distances in scale-free percolation and related models
by: Lakis, Kostas, et al.
Published: (2024)

Local Limits of Small World Networks
by: Alimohammadi, Yeganeh, et al.
Published: (2025)

Multiplexons: Limits of Multiplex Networks
by: Ganguly, Ankan, et al.
Published: (2025)

Ginzburg--Landau Functionals in the Large-Graph Limit
by: Zhang, Edith, et al.
Published: (2024)

Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
by: Mossel, Elchanan, et al.
Published: (2024)

Small maximal clusters are very unlikely in critical random graphs
by: De Ambroggio, Umberto
Published: (2024)

The Random Subsequence Model and Uniform Codes for the Deletion Channel
by: Jeong, Ryan, et al.
Published: (2026)

Dynamic random graphs with vertex removal
by: Díaz, Josep, et al.
Published: (2022)

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

How Population Diversity Influences the Efficiency of Crossover
by: Cerf, Sacha, et al.
Published: (2024)

Inference of Hierarchical Core-Periphery Structure in Temporal Networks
by: Faust, Theodore Y., et al.
Published: (2025)

Comparison of modularity-based approaches for nodes clustering in hypergraphs
by: Poda, Veronica, et al.
Published: (2024)

ABCD: Algorithm for Balanced Component Discovery in Signed Networks
by: Shebaro, Muhieddine, et al.
Published: (2023)

Scaling Frustration Index and Corresponding Balanced State Discovery for Real Signed Graphs
by: Shebaro, Muhieddine, et al.
Published: (2023)

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

The Lovász number of random circulant graphs
by: Bandeira, Afonso S., et al.
Published: (2025)

Information Inequalities for Joint Distributions, with Interpretations and Applications
by: Madiman, Mokshay, et al.
Published: (2008)

Individual testing is optimal for nonadaptive group testing in the linear regime
by: Aldridge, Matthew
Published: (2018)

The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice
by: Bruno, Roberto, et al.
Published: (2026)

Equal Requests are Asymptotically Hardest for Data Recovery
by: Lember, Jüri, et al.
Published: (2024)

Bernoulli sums and Rényi entropy inequalities
by: Madiman, Mokshay, et al.
Published: (2021)

Geometry of Rényi Entropy on the Majorization Lattice
by: Yadav, Anuj Kumar, et al.
Published: (2026)

Quenched scaling limit for biased random walks on random, heavy tailed conductances: low dimensions
by: De Ambroggio, Umberto, et al.
Published: (2025)

Stable Boundaries of Opinion Dynamics in Heterogeneous Spatial Complex Networks
by: Bierwirth, Mats, et al.
Published: (2026)

Modularity and random graphs
by: McDiarmid, Colin, et al.
Published: (2025)

Hardest Monotone Functions for Evolutionary Algorithms
by: Kaufmann, Marc, et al.
Published: (2023)

Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity
by: Yu, Lei, et al.
Published: (2021)