Gabor Timar

Dr. Gabor Timar


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 March 2010 in Physical Review Letters
Verified
Journal Article
Closed access
GTGabor Timar
Gabor Timar
JBJ. Blömer
J. Blömer
Ferenc KunFerenc Kun
Ferenc Kun
HHH. J. Herrmann
H. J. Herrmann
We present an experimental and theoretical study of the fragmentation of polymeric materials by impacting polypropylene particles of spherical shape against a hard wall. Experiments reveal a power law mass distribution of fragments with an exponent close to 1.2, which is significantly different from the known exponents of three-dimensional bulk materials. A 3D discrete element model is introduced which reproduces both the large permanent deformation of the polymer during impact and the novel value of the mass distribution exponent. We demonstrate that the dominance of shear in the crack formation and the plastic response of the material are the key features which give rise to the emergence of the novel universality class of fragmentation phenomena.

27 July 2012 in Physical Review E
Verified
Journal Article
Closed access
GTGabor Timar
Gabor Timar
Ferenc KunFerenc Kun
Ferenc Kun
HCH. A. Carmona
H. A. Carmona
HHH. J. Herrmann
H. J. Herrmann
We investigate the impact fragmentation of spherical solid bodies made of heterogeneous brittle materials by means of a discrete element model. Computer simulations are carried out for four different system sizes varying the impact velocity in a broad range. We perform a finite size scaling analysis to determine the critical exponents of the damage-fragmentation phase transition and deduce scaling relations in terms of radius R and impact velocity v0. The scaling analysis demonstrates that the exponent of the power law distributed fragment mass does not depend on the impact velocity; the apparent change of the exponent predicted by recent simulations can be attributed to the shifting cutoff and to the existence of unbreakable discrete units. Our calculations reveal that the characteristic time scale of the breakup process has a power law dependence on the impact speed and on the distance from the critical speed in the damaged and fragmented states, respectively. The total amount of damage is found to have a similar behavior, which is substantially different from the logarithmic dependence on the impact velocity observed in two dimensions.

17 February 2017 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
GTGabor Timar
Gabor Timar
AGAlexander Goltsev
Alexander Goltsev
SDSergey Dorogovtsev
Sergey Dorogovtsev
José Fernando F. MendesJosé Fernando F. Mendes
José Fernando F. Mendes
We reveal a hierarchical, multilayer organization of finite components—i.e., tendrils and tubes—around the giant connected components in directed networks and propose efficient algorithms allowing one to uncover the entire organization of key real-world directed networks, such as the World Wide Web, the neural network of Caenorhabditis elegans, and others. With increasing damage, the giant components decrease in size while the number and size of tendril layers increase, enhancing the susceptibility of the networks to damage.

18 September 2018 in Physical Review E
Verified
Journal Article
Closed access
PDF file
GBGareth Baxter
Gareth Baxter
GTGabor Timar
Gabor Timar
José Fernando F. MendesJosé Fernando F. Mendes
José Fernando F. Mendes
Complex systems consisting of interdependent subsystems may be represented by multilayer networks with interdependency links between layers. The giant mutually connected component (GMCC) of such an interdependent (or multiplex) network collapses with a discontinuous hybrid transition under random damage to the network. If the nodes to be damaged are selected in a targeted way, the collapse of the GMCC may occur significantly sooner. Understanding the limits of the resilience of such systems to targeted attacks is therefore an essential problem. Finding the minimal damage set which destroys the largest mutually connected component of a given interdependent network is a computationally prohibitive simultaneous optimization problem. We introduce a simple heuristic strategy—effective multiplex degree—for targeted attack on interdependent networks that leverages the indirect damage inherent in multiplex networks to achieve a damage set smaller than that found by any existing noncomputationally intensive algorithm. We show that the intuition from single-layer networks that decycling (damage of the 2-core) is the most effective way to destroy the giant component does not carry over to interdependent networks and in fact such approaches are worse than simply removing the highest degree nodes.

10 October 2023 in Physical Review E
Verified
Journal Article
Closed access
PDF file
LCLorenzo Cirigliano
Lorenzo Cirigliano
CCClaudio Castelano
Claudio Castelano
GTGabor Timar
Gabor Timar
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.

3 August 2016 in Physical Review E
Verified
Journal Article
Closed access
PDF file
GTGabor Timar
Gabor Timar
SDSergey Dorogovtsev
Sergey Dorogovtsev
José Fernando F. MendesJosé Fernando F. Mendes
José Fernando F. Mendes
A majority of studied models for scale-free networks have degree distributions with exponents greater than two. Real networks, however, can demonstrate essentially more heavy-tailed degree distributions. We explore two models of scale-free equilibrium networks that have the degree distribution exponent γ=1, P(q)∼q−γ. Such degree distributions can be identified in empirical data only if the mean degree of a network is sufficiently high. Our models exploit a rewiring mechanism. They are local in the sense that no knowledge of the network structure, apart from the immediate neighborhood of the vertices, is required. These models generate uncorrelated networks in the infinite size limit, where they are solved explicitly. We investigate finite size effects by the use of simulations. We find that both models exhibit disassortative degree-degree correlations for finite network sizes. In addition, we observe a markedly degree-dependent clustering in the finite networks. We indicate a real-world network with a similar degree distribution.