Ultra-small world detection in networks: subgraphs with prescribed distance distributions

Abstract We introduce a class of distance-based clique relaxation models, which enforce certain distributions on vertex pairwise distances in the corresponding induced subgraphs. Both “local” and “global” versions of the proposed approach are studied. For the global case, the distribution of distances is considered for all vertex pairs in the subgraph. For the local (and, in a sense, more restrictive) case, the required property must be satisfied for any vertex with respect to its distances to the other vertices in the subgraph. We refer to the proposed clique relaxations as global and local $$\varvec{\gamma }$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>γ</mml:mi> </mml:mrow> </mml:math> - ultra-small worlds , respectively, where parameter $$\varvec{\gamma }$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>γ</mml:mi> </mml:mrow> </mml:math> controls the required distance distributions. Our modeling approach has several meaningful interpretations; in particular, it is closely related to the concept of an “effective” graph diameter. Furthermore, density- and degree-based quasi-cliques are two well-known special cases of the proposed concept. We exploit these relationships to develop mixed integer programs (MIPs) that can be used with an off-the-shelf solver for finding maximum global and local ultra-small worlds. Then, we outline a simple-to-implement algorithm that iteratively solves feasibility versions of our MIPs for each possible subgraph size within some lower and upper bounds; we derive one non-trivial upper bound using the linear programming relaxations. Our modeling approach also generalizes the k -club concept; hence, some links to this well-known distance-based clique relaxation are also explored. Finally, to illustrate the obtained results, we perform a computational study on graphs representing various types of real-world datasets and systems. Some interesting empirical observations and insights are provided.

Authors

Institutions

Publication Details

Journal
Computational Optimization and Applications
Published
2025-02-05
DOI
https://doi.org/10.1007/s10589-024-00640-1
Citations
2
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
2.65

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Ultra-small world detection in networks: subgraphs with prescribed distance distributions

Vladimir Boginski, Alexander Veremyev, Eduardo L. Pasiliao, Oleg A. Prokopyev
2 citations
Computational Optimization and Applications
Complex Network Analysis Techniques
2.65
article

Ultra-small world detection in networks: subgraphs with prescribed distance distributions

Vladimir Boginski, Alexander Veremyev, Eduardo L. Pasiliao, Oleg A. Prokopyev
article en
2 citations

Abstract

Abstract We introduce a class of distance-based clique relaxation models, which enforce certain distributions on vertex pairwise distances in the corresponding induced subgraphs. Both “local” and “global” versions of the proposed approach are studied. For the global case, the distribution of distances is considered for all vertex pairs in the subgraph. For the local (and, in a sense, more restrictive) case, the required property must be satisfied for any vertex with respect to its distances to the other vertices in the subgraph. We refer to the proposed clique relaxations as global and local $$\varvec{\gamma }$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>γ</mml:mi> </mml:mrow> </mml:math> - ultra-small worlds , respectively, where parameter $$\varvec{\gamma }$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>γ</mml:mi> </mml:mrow> </mml:math> controls the required distance distributions. Our modeling approach has several meaningful interpretations; in particular, it is closely related to the concept of an “effective” graph diameter. Furthermore, density- and degree-based quasi-cliques are two well-known special cases of the proposed concept. We exploit these relationships to develop mixed integer programs (MIPs) that can be used with an off-the-shelf solver for finding maximum global and local ultra-small worlds. Then, we outline a simple-to-implement algorithm that iteratively solves feasibility versions of our MIPs for each possible subgraph size within some lower and upper bounds; we derive one non-trivial upper bound using the linear programming relaxations. Our modeling approach also generalizes the k -club concept; hence, some links to this well-known distance-based clique relaxation are also explored. Finally, to illustrate the obtained results, we perform a computational study on graphs representing various types of real-world datasets and systems. Some interesting empirical observations and insights are provided.

Computational Optimization and ApplicationsVol. 92(3)
University of Central Florida (US), Zurich University of Applied Sciences in Business Administration (CH), Eglin Air Force Base (US)
University of Pittsburgh, Universität Zürich, U.S. Air Force, Office of Naval Research, Air Force Research Laboratory
Openalex Percentile: Top 12%
Complex Network Analysis Techniques
2.65
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.