3 papers
math.PR2026
Local Search for Almost-Spanning Square Grids in Erdős--Rényi Random Graphs
Dávid Ferenczi, Alexander Grigoriev
Finding large lattice subgraphs in sparse Erdős--Rényi random graphs is a classical problem at the interface of random graph theory and algorithms. General bounded-degree embedding…
cs.SI2026
Constrained graph generation: Preserving diameter and clustering coefficient simultaneously
Dávid Ferenczi, Alexander Grigoriev
Generating graphs subject to strict structural constraints is a fundamental computational challenge in network science. Simultaneously preserving interacting properties-such as the…
cs.SI2026
Inferring signed social networks from contact patterns
Dávid Ferenczi, Jean-Gabriel Young, Leto Peel
Social networks are typically inferred from indirect observations, such as proximity data; yet, most methods cannot distinguish between absent relationships and actual negative tie…