GTGabor Timar

Gabor Timar

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Gabor Timar has a total of 36 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Strongly Clustered Random Graphs via Triadic Closure: Degree Correlations and Clustering Spectrum

    by Lorenzo Cirigliano, Gareth J. Baxter, Gábor Timár

    Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding of such complex network structures. Here, we address this problem using a model for strongly clustered random graphs in which each triad of a random network backbone is closed with a certain probability. Despite the intricate loopy local structure of the graphs obtained, we provide exact expressions for the local clustering spectrum and the degree correlations, filling the gap in the theoretical description of this model for random graphs. In particular, we find positive degree assortativity accompanying high transitivity, and nontrivial structure in the clustering spectrum. Exact asymptotic analytical results, obtained for uncorrelated locally tree-like backbones, are complemented with extensive numerical characterization of finite-size effects.

  • Scaling and universality for percolation in random networks: A unified view

    by Lorenzo Cirigliano, Gábor Timár, Claudio Castellano

    Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some critical properties of the transition, in particular for heterogeneous substrates, have not been fully elucidated and contradictory results appear in the literature. In this paper we present, by means of a generating functions approach, a thorough and complete investigation of percolation critical properties in uncorrelated locally treelike random networks. We determine all critical exponents, the associated critical amplitude ratios, and the form of the cluster size distribution for networks of any level of heterogeneity. We uncover, in particular for highly heterogeneous networks, subtle crossover phenomena, nontrivial scaling forms, and violations of hyperscaling. In this way we clarify the origin of inconsistencies in the previous literature.


  • Strongly clustered random graphs via triadic closure: An exactly solvable model

    by Lorenzo Cirigliano, Claudio Castellano, Gareth J. Baxter, Gábor Timár

    Triadic closure, the formation of a connection between two nodes in a network sharing a common neighbor, is considered a fundamental mechanism determining the clustered nature of many real-world topologies. In this work we define a static triadic closure (STC) model for clustered networks, whereby starting from an arbitrary fixed backbone network, each triad is closed independently with a given probability. Assuming a locally treelike backbone we derive exact expressions for the expected number of various small, loopy motifs (triangles, 4-loops, diamonds, and 4-cliques) as a function of moments of the backbone degree distribution. In this way we determine how transitivity and its suitably defined generalizations for higher-order motifs depend on the heterogeneity of the original network, revealing the existence of transitions due to the interplay between topologically inequivalent triads in the network. Furthermore, under reasonable assumptions for the moments of the backbone network, we establish approximate relationships between motif densities, which we test in a large dataset of real-world networks. We find a good agreement, indicating that STC is a realistic mechanism for the generation of clustered networks, while remaining simple enough to be amenable to analytical treatment.


  • Open Access

    The Conditioning Bias in Binary Decision Trees and Random Forests and Its Elimination

    by Gábor Timár, György Kovács

    Decision tree and random forest classification and regression are some of the most widely used in machine learning approaches. Binary decision tree implementations commonly use conditioning in the form 'feature $\leq$ (or $<$) threshold', with the threshold being the midpoint between two observed feature values. In this paper, we investigate the bias introduced by the choice of conditioning operator (an intrinsic property of implementations) in the presence of features with lattice characteristics. We propose techniques to eliminate this bias, requiring an additional prediction with decision trees and incurring no cost for random forests. Using 20 classification and 20 regression datasets, we demonstrate that the bias can lead to statistically significant differences in terms of AUC and $r^2$ scores. The proposed techniques successfully mitigate the bias, compared to the worst-case scenario, statistically significant improvements of up to 0.1-0.2 percentage points of AUC and $r^2$ scores were achieved and the improvement of 1.5 percentage points of $r^2$ score was measured in the most sensitive case of random forest regression. The implementation of the study is available on GitHub at the following repository: \url{https://github.com/gykovacs/conditioning_bias}.

  • Extended-range percolation in complex networks

    by Lorenzo Cirigliano, Claudio Castellano, Gábor Timár

    Classical percolation theory underlies many processes of information transfer along the links of a network. In these standard situations, the requirement for two nodes to be able to communicate is the presence of at least one uninterrupted path of nodes between them. In a variety of more recent data transmission protocols, such as the communication of noisy data via error-correcting repeaters, both in classical and quantum networks, the requirement of an uninterrupted path is too strict: two nodes may be able to communicate even if all paths between them have interruptions or gaps consisting of nodes that may corrupt the message. In such a case a different approach is needed. We develop the theoretical framework for extended-range percolation in networks, describing the fundamental connectivity properties relevant to such models of information transfer. We obtain exact results, for any range R, for infinite random uncorrelated networks and we provide a message-passing formulation that works well in sparse real-world networks. The interplay of the extended range and heterogeneity leads to novel critical behavior in scale-free networks.


  • Localization of nonbacktracking centrality on dense subgraphs of sparse networks

    by G. Timár, S. N. Dorogovtsev, J. F. F. Mendes

    The nonbacktracking matrix and the related nonbacktracking centrality (NBC) play a crucial role in models of percolation-type processes on networks, such as nonrecurrent epidemics. Here we study the localization of NBC in infinite sparse networks that contain an arbitrary finite subgraph. Assuming the local tree likeness of the enclosing network, and that branches emanating from the finite subgraph do not intersect at finite distances, we show that the largest eigenvalue of the nonbacktracking matrix of the composite network is equal to the highest of the two largest eigenvalues: that of the finite subgraph and of the enclosing network. In the localized state, when the largest eigenvalue of the subgraph is the highest of the two, we derive explicit expressions for the NBCs of nodes in the subgraph and other nodes in the network. In this state, nonbacktracking centrality is concentrated on the subgraph and its immediate neighborhood in the enclosing network. We obtain simple, exact formulas in the case where the enclosing network is uncorrelated. We find that the mean NBC decays exponentially around the finite subgraph, at a rate which is independent of the structure of the enclosing network, contrary to what was found for the localization of the principal eigenvector of the adjacency matrix. Numerical simulations confirm that our results provide good approximations even in moderately sized, loopy, real-world networks.


  • Open Access

    Approximating nonbacktracking centrality and localization phenomena in large networks

    by G. Timár, R. A. da Costa, S. N. Dorogovtsev, J. F. F. Mendes

    Message-passing theories have proved to be invaluable tools in studying percolation, non-recurrent epidemics and similar dynamical processes on real-world networks. At the heart of the message-passing method is the nonbacktracking matrix whose largest eigenvalue, the corresponding eigenvector, and the closely related nonbacktracking centrality play a central role in determining how the given dynamical model behaves. Here we propose a degree-class-based method to approximate these quantities using a smaller matrix related to the joint degree-degree distribution of neighbouring nodes. Our findings suggest that in most networks degree-degree correlations beyond nearest neighbour are actually not strong, and our first-order description already results in accurate estimates, particularly when message-passing itself is a good approximation to the original model in question, that is when the number of short cycles in the network is sufficiently low. We show that localization of the nonbacktracking centrality is also captured well by our scheme, particularly in large networks. Our method provides an alternative to working with the full nonbacktracking matrix in very large networks where this may not be possible due to memory limitations.

  • Approximating nonbacktracking centrality and localization phenomena in large networks

    by G. Timár, R. A. da Costa, S. N. Dorogovtsev, J. F. F. Mendes

    Message-passing theories have proved to be invaluable tools in studying percolation, nonrecurrent epidemics, and similar dynamical processes on real-world networks. At the heart of the message-passing method is the nonbacktracking matrix, whose largest eigenvalue, the corresponding eigenvector, and the closely related nonbacktracking centrality play a central role in determining how the given dynamical model behaves. Here we propose a degree-class-based method to approximate these quantities using a smaller matrix related to the joint degree-degree distribution of neighboring nodes. Our findings suggest that in most networks, degree-degree correlations beyond nearest neighbor are actually not strong, and our first-order description already results in accurate estimates, particularly when message-passing itself is a good approximation to the original model in question, that is, when the number of short cycles in the network is sufficiently low. We show that localization of the nonbacktracking centrality is also captured well by our scheme, particularly in large networks. Our method provides an alternative to working with the full nonbacktracking matrix in very large networks where this may not be possible due to memory limitations.


  • Open Access

    Simple estimation of hierarchical positions and uncertainty in networks of asymmetric interactions

    by Gábor Timár

    In many social networks it is a useful assumption that, regarding a given quality, an underlying hierarchy of the connected individuals exists, and that the outcome of interactions is to some extent determined by the relative positions in the hierarchy. We consider a simple and broadly applicable method of estimating individual positions in a linear hierarchy, and the corresponding uncertainties. The method relies on solving a linear system characterized by a modified Laplacian matrix of the underlying network of interactions, and is equivalent to finding the equilibrium configuration of a system of directed linear springs. We provide a simple first-order approximation to the exact solution, which can be evaluated in linear time. The uncertainty of the hierarchy estimate is determined by the network structure and the potantial energy of the corresponding spring system in equilibrium. The method generalizes straightforwardly to multidimensional hierarchies and higher-order, non-pairwise interactions.

  • Open Access

    Enhanced robustness of single-layer networks with redundant dependencies

    by Gábor Timár, György Kovács, José Fernando F. Mendes

    Dependency links in single-layer networks offer a convenient way of modeling nonlocal percolation effects in networked systems where certain pairs of nodes are only able to function together. We study the percolation properties of the weak variant of this model: nodes with dependency neighbours may continue to function if at least one of their dependency neighbours is active. We show that this relaxation of the dependency rule allows for more robust structures and a rich variety of critical phenomena, as percolation is not determined strictly by finite dependency clusters. We study Erd\"os-R\'enyi and random scale-free networks with an underlying Erd\"os-R\'enyi network of dependency links. We identify a special "cusp" point above which the system is always stable, irrespective of the density of dependency links. We find continuous and discontinuous hybrid percolation transitions, separated by a tricritical point for Erd\"os-R\'enyi networks. For scale-free networks with a finite degree cutoff we observe the appearance of a critical point and corresponding double transitions in a certain range of the degree distribution exponent. We show that at a special point in the parameter space, where the critical point emerges, the giant viable cluster has the unusual critical singularity $S-S_c \propto (p-p_c)^{1/4}$. We study the robustness of networks where connectivity degrees and dependency degrees are correlated and find that scale-free networks are able to retain their high resilience for strong enough positive correlation, i.e., when hubs are protected by greater redundancy.