539 Moderne Physik
Refine
Has Fulltext
- yes (172)
Is part of the Bibliography
- yes (172)
Year of publication
Document Type
- Journal article (133)
- Doctoral Thesis (38)
- Working Paper (1)
Language
- English (172) (remove)
Keywords
- Hadron-Hadron scattering (experiments) (27)
- High energy physics (24)
- ATLAS detector (20)
- hadron-hadron scattering (15)
- proton-proton collision (14)
- Higgs boson (12)
- physics (9)
- systematic uncertainty (9)
- Topologischer Isolator (8)
- jet energy scale (8)
Institute
Sonstige beteiligte Institutionen
- Arizona State University, Tempe, Arizona, USA (1)
- Fraunhofer-Institute for Applied Optics and Precision Engineering IOF Jena, Germany (1)
- Friedrich Schiller University Jena, Germany (1)
- LMU München (1)
- Max Planck School of Photonics Jena, Germany (1)
- National Institute for Materials Science, Tsukuba, Japan (1)
- University of Oldenburg, Germany (1)
- University of Science and Technology of China, Hefei, China (1)
- Universität Bielefeld (1)
- Wilhelm Conrad Röntgen-Center for Complex Material Systems, Würzburg (1)
In the course of the growth of the Internet and due to increasing availability of data, over the last two decades, the field of network science has established itself as an own area of research. With quantitative scientists from computer science, mathematics, and physics working on datasets from biology, economics, sociology, political sciences, and many others, network science serves as a paradigm for interdisciplinary research.
One of the major goals in network science is to unravel the relationship between topological graph structure and a network’s function. As evidence suggests, systems from the same fields, i.e. with similar function, tend to exhibit similar structure. However, it is still vague whether a similar graph structure automatically implies likewise function. This dissertation aims at helping to bridge this gap, while particularly focusing on the role of triadic structures.
After a general introduction to the main concepts of network science, existing work devoted to the relevance of triadic substructures is reviewed. A major challenge in modeling triadic structure is the fact that not all three-node subgraphs can be specified independently
of each other, as pairs of nodes may participate in multiple of those triadic subgraphs.
In order to overcome this obstacle, we suggest a novel class of generative network models based on so called Steiner triple systems. The latter are partitions of a graph’s vertices into pair-disjoint triples (Steiner triples). Thus, the configurations on Steiner triples can be specified independently of each other without overdetermining the network’s link
structure.
Subsequently, we investigate the most basic realization of this new class of models. We call it the triadic random graph model (TRGM). The TRGM is parametrized by a probability distribution over all possible triadic subgraph patterns. In order to generate a network instantiation of the model, for all Steiner triples in the system, a pattern is drawn from the distribution and adjusted randomly on the Steiner triple. We calculate the degree distribution of the TRGM analytically and find it to be similar to a Poissonian distribution. Furthermore, it is shown that TRGMs possess non-trivial triadic structure. We discover inevitable correlations in the abundance of certain triadic subgraph
patterns which should be taken into account when attributing functional relevance to particular motifs – patterns which occur significantly more frequently than expected at random. Beyond, the strong impact of the probability distributions on the Steiner triples on the occurrence of triadic subgraphs over the whole network is demonstrated. This interdependence allows us to design ensembles of networks with predefined triadic substructure. Hence, TRGMs help to overcome the lack of generative models needed for assessing the relevance of triadic structure.
We further investigate whether motifs occur homogeneously or heterogeneously distributed over a graph. Therefore, we study triadic subgraph structures in each node’s neighborhood individually. In order to quantitatively measure structure from an individual node’s perspective, we introduce an algorithm for node-specific pattern mining for both directed unsigned, and undirected signed networks. Analyzing real-world datasets, we find that there are networks in which motifs are distributed highly heterogeneously, bound to the proximity of only very few nodes. Moreover, we observe indication for the potential sensitivity of biological systems to a targeted removal of these critical vertices. In addition, we study whole graphs with respect to the homogeneity and homophily of their node-specific triadic structure. The former describes the similarity of subgraph distributions in the neighborhoods of individual vertices. The latter quantifies whether connected vertices
are structurally more similar than non-connected ones. We discover these features to be characteristic for the networks’ origins. Moreover, clustering the vertices of graphs regarding their triadic structure, we investigate structural groups in the neural network of C. elegans, the international airport-connection network, and the global network of diplomatic sentiments between countries. For the latter we find evidence for the instability of triangles considered socially unbalanced according to sociological theories.
Finally, we utilize our TRGM to explore ensembles of networks with similar triadic substructure in terms of the evolution of dynamical processes acting on their nodes. Focusing on oscillators, coupled along the graphs’ edges, we observe that certain triad motifs impose a clear signature on the systems’ dynamics, even when embedded in a larger
network structure.
Leptoquarks are hypothetical particles that attempt to explain the coincidental similarities between leptons and quarks included in SM. Their exact properties vary between different theoretical models, and there are no strong theoretical constraints on their possible mass values. They can possibly be produced from particle
collisions, and there have already been searching efforts at previous collider experiments. Their presence have yet been observed, and this fact has been translated into lower bound exclusions on their possible mass values. The Large Hadron Collider (LHC) being the most recently constructed particle collider with the highest collision energies ever achieved experimentally, provides a new platform to continue the search for Leptoquarks at even higher mass ranges.
This thesis describes a search for pair-produced second-generation Leptoquarks using 20.3 fb−1 of data recorded by the ATLAS detector of LHC at √s = 8 TeV. Events with two oppositely charged muons and two or more jets in the final state were used. Candidate leptoquark events were selected with the help of four observables: the di-muon invariant mass (Mμμ ), the sum of the pT of the two muons
(LT ), the sum of the pT of the two leading jets (HT ) and the average Leptoquark mass (MLQ ). Monte Carlo simulations of SM background processes have shown
to be in good agreement with data, both in the region constructed using selection requirements for candiate leptoquark events and in the designated control regions.
Since no significant excess of events was observed in data, a exclusion limit was set as a function of the Leptoquark mass.