Searcharxiv⌕ Search

arXiv subjects

David Hartman

Publications and source records attributed to David Hartman.

At least 19 recordsLinked to original sources

Similarity-Guided Optimization Strategies for Approximate Network Symmetry Detection

Symmetry in complex networks is a structural property with broad implications for network function, dynamics, and robustness. While classical approaches rely on exact automorphisms and thus remain highly sensitive to small perturbations, recent work of Liu has introduced approximate formulations that relax the strict invariance condition and recast symmetry detection as an optimization problem over permutations. We investigate how node-level similarity information can be used to bias the search toward structurally plausible vertex correspondences, with network centralities serving as one interpretable instance. Building on this perspective, we adapt simulated annealing, genetic algorithms, tabu search, particle swarm optimization, differential evolution and the quadratic symmetry approximator to this problem, add similarity guidance to each, and introduce Bilinear Approximate Symmetry Inference (BASIN), which learns a soft assignment matrix via bilinear embeddings. Using a unified evaluation pipeline, we compare their guided and unguided variants, BASIN and a random baseline on four synthetic graph families, structural brain connectomes, and three empirical networks with known automorphism groups. Node-similarity guidance is decisive where a planted orbit exists that the unguided search misses, and algorithm-dependent elsewhere, on synthetic and empirical networks alike. Overall, tabu search achieves the strongest performance; its guided variant (SGTS) has the lowest median score among the guided variants in all 44 synthetic conditions, while BASIN is the better of the continuous relaxations on rewired lateral graphs. The effect of node-similarity guidance is therefore regime-dependent rather than uniformly positive.

cs.NE↗

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↗

Local iterative algorithms for approximate symmetry guided by network centralities

Recently, the influence of potentially present symmetries has begun to be studied in complex networks. A typical way of studying symmetries is via the automorphism group of the corresponding graph. Since complex networks are often subject to uncertainty and automorphisms are very sensitive to small changes, this characterization needs to be modified to an approximate version for successful application. This paper considers a recently introduced approximate symmetry of complex networks computed as an automorphism with acceptance of small edge preservation error, see Liu 2020. This problem is generally very hard with respect to the large space of candidate permutations, and hence the corresponding computation methods typically lead to the utilization of local algorithms such as the simulated annealing used in the original work. This paper proposes a new heuristic algorithm extending such iterative search algorithm method by using network centralities as heuristics. Centralities are shown to be a good tool to navigate the local search towards more appropriate permutations and lead to better search results.

cs.SI↗

Structure of betweenness uniform graphs with low values of betweenness centrality

This work deals with undirected graphs that have the same betweenness centrality for each vertex, so-called betweenness uniform graphs (or BUGs). The class of these graphs is not trivial and its classification is still an open problem. Recently, Gago, Coroničová-Hurajová and Madaras conjectured that for every rational $α\ge 3/4$ there exists a BUG having betweenness centrality~$α$. We disprove this conjecture, and provide an alternative view of the structure of betweenness-uniform graphs from the point of view of their complement. This allows us to characterise all the BUGs with betweennes centrality at most 9/10, and show that their betweenness centrality is equal to $\frac{\ell}{\ell+1}$ for some integer $\ell\le 9$. We conjecture that this characterization extends to all the BUGs with betweenness centrality smaller than~1.

math.CO↗

Computing approximate symmetries of complex networks

The symmetry of complex networks is a global property that has recently gained attention since MacArthur et al. 2008 showed that many real-world networks contain a considerable number of symmetries. These authors work with a very strict symmetry definition based on the network's automorphism. The potential problem with this approach is that even a slight change in the graph's structure can remove or create some symmetry. Recently, Liu 2020 proposed to use an approximate automorphism instead of strict automorphism. This method can discover symmetries in the network while accepting some minor imperfections in their structure. The proposed numerical method, however, exhibits some performance problems and has some limitations while it assumes the absence of fixed points. In this work, we exploit alternative approaches recently developed for treating the Graph Matching Problem and propose a method, which we will refer to as Quadratic Symmetry Approximator (QSA), to address the aforementioned shortcomings. To test our method, we propose a set of random graph models suitable for assessing a wide family of approximate symmetry algorithms. The performance of our method is also demonstrated on brain networks.

cs.SI↗

Structural convergence and algebraic roots

Structural convergence is a framework for convergence of graphs by Nešetřil and Ossona de Mendez that unifies the dense (left) graph convergence and Benjamini-Schramm convergence. They posed a problem asking whether for a given sequence of graphs $(G_n)$ converging to a limit $L$ and a vertex $r$ of $L$ it is possible to find a sequence of vertices $(r_n)$ such that $L$ rooted at $r$ is the limit of the graphs $G_n$ rooted at $r_n$. A counterexample was found by Christofides and Král', but they showed that the statement holds for almost all vertices $r$ of $L$. We offer another perspective to the original problem by considering the size of definable sets to which the root $r$ belongs. We prove that if $r$ is an algebraic vertex (i.e. belongs to a finite definable set), the sequence of roots $(r_n)$ always exists.

math.CO↗

On the Connectivity and the Diameter of Betweenness-Uniform Graphs

Betweenness centrality is a centrality measure based on the overall amount of shortest paths passing through a given vertex. A graph is betweenness-uniform if all its vertices have the same betweenness centrality. We study the properties of betweenness-uniform graphs. In particular, we show that every connected betweenness-uniform graph is either a cycle or a $3$-connected graph. Also, we show that betweenness uniform graphs of high maximal degree have small diameter.

math.CO↗

Gadget construction and structural convergence

Nešetřil and Ossona de Mendez recently proposed a new definition of graph convergence called structural convergence. The structural convergence framework is based on the probability of satisfaction of logical formulas from a fixed fragment of first-order formulas. The flexibility of choosing the fragment allows to unify the classical notions of convergence for sparse and dense graphs. Since the field is relatively young, the range of examples of convergent sequences is limited and only a few methods of construction are known. Our aim is to extend the variety of constructions by considering the gadget construction. We show that, when restricting to the set of sentences, the application of gadget construction on elementarily convergent sequences yields an elementarily convergent sequence. On the other hand, we show counterexamples witnessing that a generalization to the full first-order convergence is not possible without additional assumptions. We give several different sufficient conditions to ensure the full convergence. One of them states that the resulting sequence is first-order convergent if the replaced edges are dense in the original sequence of structures.

math.CO↗

Absolute value linear programming

We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth, so hard to solve. In this paper, we study fundamental properties on the topology and the geometric shape of the solution set, and also conditions for convexity, connectedness, boundedness and integrality of the vertices. Further, we address various complexity issues, showing that many basic questions are NP-hard to solve. We show that the feasible set is a (nonconvex) polyhedral set and, more importantly, every nonconvex polyhedral set can be described by means of absolute value constraints. We also provide a necessary and sufficient condition when a KKT point of a nonconvex quadratic programming reformulation solves the original problem.

math.OC↗

Positivity and convexity in incomplete cooperative games

Incomplete cooperative games generalise the classical model of cooperative games by omitting the values of some of the coalitions. This allows to incorporate uncertainty into the model and study the underlying games as well as possible payoff distribution based only on the partial information. In this paper we perform a systematic study of incomplete games, focusing on two important classes of cooperative games: positive and convex games. Regarding positivity, we generalise previous results for a special class of minimal incomplete games to general setting. We characterise non-extendability to a positive game by the existence of a certificate and provide a description of the set of positive extensions using its extreme games. The results are then used to obtain explicit formulas for several classes of incomplete games with special structures. The second part deals with convexity. We begin with considering the case of non-negative minimal incomplete games. Then we survey existing results in the related theory of set functions, namely providing context to the problem of completing partial functions. We provide a characterisation of extendability and a full description of the set of symmetric convex extensions. The set serves as an approximation of the set of convex extensions. Finally, we outline an entirely new perspective on a connection between incomplete cooperative games and cooperative interval games.

cs.GT↗

Sensor Scheduling for Linear Systems: A Covariance Tracking Approach

We consider the classical sensor scheduling problem for linear systems where only one sensor is activated at each time. We show that the sensor scheduling problem has a close relation to the sensor design problem and the solution of a sensor schedule problem can be extracted from an equivalent sensor design problem. We propose a convex relaxation to the sensor design problem and a reference covariance trajectory is obtained from solving the relaxed sensor design problem. Afterwards, a covariance tracking algorithm is designed to obtain an approximate solution to the sensor scheduling problem using the reference covariance trajectory obtained from the sensor design problem. While the sensor scheduling problem is NP-hard, the proposed framework circumvents this computational complexity by decomposing this problem into a convex sensor design problem and a covariance tracking problem. We provide theoretical justification and a sub-optimality bound for the proposed method using dynamic programming. The proposed method is validated over several experiments portraying the efficacy of the framework.

eess.SY↗

Constructions of betweenness-uniform graphs from trees

Betweenness centrality is a measure of the importance of a vertex x inside a network based on the fraction of shortest paths passing through x. We study a blow-up construction that has been shown to produce graphs with uniform distribution of betweenness. We disprove the conjecture about this procedure's universality by showing that trees with a diameter at least three cannot be transformed into betweenness-uniform by the blow-up construction. It remains open to characterize graphs for which the blow-up construction can produce betweenness-uniform graphs.

math.CO↗

Computing the spectral decomposition of interval matrices and a study on interval matrix power

We present an algorithm for computing a spectral decomposition of an interval matrix as an enclosure of spectral decompositions of particular realizations of interval matrices. The algorithm relies on tight outer estimations of eigenvalues and eigenvectors of corresponding interval matrices. We present a method for general interval matrices as well as its modification for symmetric interval matrices. As an illustration, we apply the spectral decomposition to computing powers of interval matrices. Numerical results suggest that a simple binary exponentiation is more efficient for smaller exponents, but our approach becomes better when computing higher powers or powers of a special type of matrices. In particular, we consider symmetric interval and circulant interval matrices. In both cases we utilize some properties of the corresponding classes of matrices to make the power computation more efficient.

math.NA↗

Nonlinearity in stock networks

Stock networks, constructed from stock price time series, are a well-established tool for the characterization of complex behavior in stock markets. Following Mantegna's seminal paper, the linear Pearson's correlation coefficient between pairs of stocks has been the usual way to determine network edges. Recently, possible effects of nonlinearity on the graph-theoretical properties of such networks have been demonstrated when using nonlinear measures such as mutual information instead of linear correlation. In this paper, we quantitatively characterize the nonlinearity in stock time series and the effect it has on stock network properties. This is achieved by a systematic multi-step approach that allows us to quantify the nonlinearity of coupling; correct its effects wherever it is caused by simple univariate non-Gaussianity; potentially localize in space and time any remaining strong sources of this nonlinearity; and, finally, study the effect nonlinearity has on global network properties. By applying this multi-step approach to stocks included in three prominent indices (NYSE100, FTSE100 and SP500), we establish that the apparent nonlinearity that has been observed is largely due to univariate non-Gaussianity. Furthermore, strong nonstationarity in a few specific stocks may play a role. In particular, the sharp decrease in some stocks during the global financial crisis of 2008 gives rise to apparent nonlinear dependencies among stocks.

q-fin.ST↗

Regularity radius: Properties, approximation and a not a priori exponential algorithm

The radius of regularity sometimes spelled as the radius of nonsingularity is a measure providing the distance of a given matrix to the nearest singular one. Despite its possible application strength this measure is still far from being handled in an efficient way also due to findings of Poljak and Rohn providing proof that checking this property is NP-hard for a general matrix. To handle this we can either find approximation algorithms or making known bounds for radius of regularity tighter. Improvements of both have been recently shown by Hartman and Hladik (doi:10.1007/978-3-319-31769-4\_9) utilizing relaxation to semidefinite programming. These approaches consider general matrices without or with just mild assumptions about the original matrix. This work explores a process of regularity radius analysis and identifies useful properties enabling easier estimation of the corresponding radius values based on utilization of properties of special class of considered matrices. At first, checking finiteness of regularity radius is shown to be a polynomial problem along with determining a maximal bound on number of nonzero elements of the matrix to obtain infinite radius. Further, relationship between maximum (Chebyshev) norm and spectral norm is used to construct new bounds for the radius of regularity. A new method based on Jansson-Rohn algorithm for testing regularity of an interval matrix is presented which is not a priory exponential along with numerical experiments. For a situation where an input matrix has a special form, several results are provided such as exact formulas for several special classes of matrices, e.g., for totally positive and inverse non-negative, or approximation algorithms, e.g., rank-one radius matrices. For tridiagonal matrices, an algorithm by Bar-On, Codenotti and Leoncini is utilized to design a polynomial algorithm to compute the regularity radius.

math.NA↗

Morphism extension classes of countable $L$-colored graphs

In~\cite{Hartman:2014}, Hartman, Hubi\v cka and Ma\v sulović studied the hierarchy of morphism extension classes for finite $L$-colored graphs, that is, undirected graphs without loops where sets of colors selected from $L$ are assigned to vertices and edges. They proved that when $L$ is a linear order, the classes $MH_L$ and $HH_L$ coincide, and the same is true for vertex-uniform finite $L$-colored graphs when $L$ is a diamond. In this paper, we explore the same question for countably infinite $L$-colored graphs. We prove that $MH_L=HH_L$ if and only if $L$ is a linear order.

math.CO↗