Cover Image

On the effect of the average clustering coefficient on topology-based link prediction in featureless graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rafiepour, Mehrdad, Vahidipour, S. Mehdi
Format:	Preprint
Published:	2025
Subjects:	Social and Information Networks 05C85 G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Community Detection using Fortunato's Performance Measure
by: Thakar, Srushti, et al.
Published: (2025)

Constrained graph generation: Preserving diameter and clustering coefficient simultaneously
by: Ferenczi, Dávid, et al.
Published: (2026)

How Local Separators Shape Community Structure in Large Networks
by: Frenkel, Sarah, et al.
Published: (2025)

Expanded-clique graphs and the domination problem
by: Dourado, Mitre C., et al.
Published: (2022)

(Even hole, triangle)-free graphs revisited
by: Martins, Beatriz, et al.
Published: (2026)

Unavoidable induced subgraphs in graphs with complete bipartite induced minors
by: Chudnovsky, Maria, et al.
Published: (2024)

New results on graph matching from degree preserving growth
by: Erdős, Péter L., et al.
Published: (2022)

On treewidth and maximum cliques
by: Chudnovsky, Maria, et al.
Published: (2024)

An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes
by: de Verdière, Éric Colin, et al.
Published: (2021)

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
by: Gartland, Peter, et al.
Published: (2023)

Shortest two disjoint paths in conservative graphs
by: Schlotter, Ildikó
Published: (2023)

Finding Diverse Minimum s-t Cuts
by: de Berg, Mark, et al.
Published: (2023)

Independent Locating-Dominating Sets in Pseudotrees
by: Cáceres, José, et al.
Published: (2026)

A new density limit for unanimity in majority dynamics on random graphs
by: Kim, Jeong Han, et al.
Published: (2025)

Open Packing in Graphs: Bounds and Complexity
by: Shalu, M. A., et al.
Published: (2024)

BLISS: Bandit Layer Importance Sampling Strategy for Efficient Training of Graph Neural Networks
by: Alsaqa, Omar, et al.
Published: (2025)

Note on edge expansion and modularity in preferential attachment graphs
by: McDiarmid, Colin, et al.
Published: (2026)

Simultaneous recovery of a sparse topology and the admittance of an electrical network
by: Samperio, Álvaro
Published: (2023)

Bipartite Turán problem on cographs
by: Zimmermann, Jakob Paul
Published: (2026)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
by: Koutsoutis, Alex, et al.
Published: (2025)

Reconstructing graphs and their connectivity using graphlets
by: Hartman, David, et al.
Published: (2025)

Correlation Clustering with Vertex Splitting
by: Bentert, Matthias, et al.
Published: (2024)

Compact Representation of Semilinear and Terrain-like Graphs
by: Cardinal, Jean, et al.
Published: (2025)

Proper colorings of a graph in linear time using a number of colors linear in the maximum degree of the graph
by: Bhandari, Kritika, et al.
Published: (2025)

T3former: Temporal Graph Classification with Topological Machine Learning
by: Uddin, Md. Joshem, et al.
Published: (2025)

Optimal List Recoloring of Subcubic Graphs and Complete Multipartite Graphs
by: De Meyer, Lucas
Published: (2025)

On the Boxicity of Line Graphs and of Their Complements
by: Caoduro, Marco, et al.
Published: (2025)

An Overview of Universal Obstructions for Graph Parameters
by: Paul, Christophe, et al.
Published: (2023)

Graph Parameters, Universal Obstructions, and WQO
by: Paul, Christophe, et al.
Published: (2023)

Finding irrelevant vertices in linear time on bounded-genus graphs
by: Golovach, Petr A., et al.
Published: (2019)

Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
by: Masařík, Tomáš, et al.
Published: (2026)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
by: Krishnaswamy, Ravishankar, et al.
Published: (2014)

On the parameterized complexity of computing good edge-labelings
by: de Andrade, Davi, et al.
Published: (2024)

CyNetDiff -- A Python Library for Accelerated Implementation of Network Diffusion Models
by: Robson, Eliot W., et al.
Published: (2024)

Lozenge Tiling by Computing Distances
by: Favreau, Jean-Marie, et al.
Published: (2026)

Exploration of $k$-edge-deficient temporal graphs in linear time
by: Lahtin, Ivan, et al.
Published: (2026)

Games on deBruijn Graphs and Cycle Means
by: Drenska, Nadejda
Published: (2026)

Kernelization dichotomies for hitting minors under structural parameterizations
by: Bougeret, Marin, et al.
Published: (2025)