Search arXiv⌕ Search

arXiv subjects

Daniel Trlifaj

Publications and source records attributed to Daniel Trlifaj.

2 recordsLinked to original sources

Graphlets as structural fingerprints of complex networks

Complex networks are often compared using selected graph-theoretical measures that capture a selected set of properties with effects ranging from local to global, such as degree, clustering or betweenness centrality. Here we introduce a structural fingerprinting framework based on graphlets: small rooted subgraphs whose distributions provide a systematic description of local-to-mesoscale topology. Across synthetic networks generated from several random graph models, graphlet fingerprints capture parameter-dependent structural differences, outperform standard graph-theoretical measures, and identify even subtle local patterns driving discrimination. We then apply the framework to empirical resting-state functional connectomes, documenting that while graphlets show superior sensitivity also to controlled topological perturbations of brain connectivity, specifically in schizophrenia-control classification they perform only comparably to classical graph-theoretical features. This is in line with the notion that schizophrenia-related alterations are dominated by spatially localized connectivity changes rather than general topological reorganization. Altogether, the generative modeling, targeted perturbations and real-world neuroimaging classification challenge position graphlets as flexible structural fingerprints of complex networks, while carefully outlining their strength and weaknesses compared to more classical graph theoretical features.

cs.SI↗

Reconstructing graphs and their connectivity using graphlets

Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological description of the surrounding of the analyzed vertex. Graphlet degree distribution (gdd) of a graph is a matrix containing graphlet degree sequence for all vertices in the given graph. A long standing open problem called reconstruction conjecture (RC) asks whether the structure of a graph is uniquely determined by the multiset of its vertex-deleted subgraphs. Graphlet degree distribution up to size (n - 1), (<= n - 1)-gdd, gives more information to reconstruct the graph and we use it to reconstruct any graph having a unique almost-asymmetric vertex-deleted subgraph, where almost-asymmetric means that at most one automorphism orbit has size larger than one. Moreover, we prove that any graph containing a vertex-cut of size 1 or any graph of order n having a vertex with degree at most 2 or at least n-2 is reconstructible from its (<= n - 1)-gdd, which expands results shown in the standard RC. We also discuss the relation between gdd and graph connectivity and the conditions on (<= 3)-gdd, whose breaking means that no graph with such gdd exists.

math.CO↗