531 research outputs found
Renormalization: an advanced overview
We present several approaches to renormalization in QFT: the multi-scale
analysis in perturbative renormalization, the functional methods \`a la
Wetterich equation, and the loop-vertex expansion in non-perturbative
renormalization. While each of these is quite well-established, they go beyond
standard QFT textbook material, and may be little-known to specialists of each
other approach. This review is aimed at bridging this gap.Comment: Review, 130 pages, 33 figures; v2: misprints corrected, refs. added,
minor improvements; v3: some changes to sect. 5, refs. adde
Local Certification of Some Geometric Intersection Graph Classes
In the context of distributed certification, the recognition of graph classes
has started to be intensively studied. For instance, different results related
to the recognition of planar, bounded tree-width and -minor free graphs have
been recently obtained. The goal of the present work is to design compact
certificates for the local recognition of relevant geometric intersection graph
classes, namely interval, chordal, circular arc, trapezoid and permutation.
More precisely, we give proof labeling schemes recognizing each of these
classes with logarithmic-sized certificates. We also provide tight logarithmic
lower bounds on the size of the certificates on the proof labeling schemes for
the recognition of any of the aforementioned geometric intersection graph
classes
Graph embeddings for low-stretch greedy routing
The simplest greedy geometric routing forwards packets to make most progress in terms of geometric distance within reach. Its notable advantages are low complexity, and the use of local information only. However, two problems of greedy routing are that delivery is not always guaranteed, and that the greedy routes may take more hops than the corresponding shortest paths. Additionally, in dynamic multihop networks, routing elements can join or leave during network operation or exhibit intermittent failures. Even a single link or node removal may invalidate the greedy routing success guarantees.
Greedy embedding is a graph embedding that makes the simple greedy packet forwarding successful for every source-destination pair. In this dissertation, we consider the problems of designing greedy graph embeddings that also yield low hop stretch of the greedy paths over the shortest paths and can accommodate network dynamics.
In the first part of the dissertation, we consider embedding and routing for arbitrary unweighted network graphs, based on greedy routing and utilizing virtual node coordinates. We propose an algorithm for online greedy graph embedding in the hyperbolic plane that enables incremental embedding of network nodes as they join the network, without disturbing the global embedding. As an alternative to frequent reembedding of temporally dynamic network graphs in order to retain the greedy embedding property, we propose a simple but robust generalization of greedy geometric routing called Gravity--Pressure (GP) routing. Our routing method always succeeds in finding a route to the destination provided that a path exists, even if a significant fraction of links or nodes is removed subsequent to the embedding. GP routing does not require precomputation or maintenance of special spanning subgraphs and is particularly suitable for operation in tandem with our proposed algorithm for online graph embedding.
In the second part of the dissertation we study how topological and geometric properties of embedded graphs influence the hop stretch. Based on the obtained insights, we synthesize embedding heuristics that yield minimal hop stretch greedy embeddings. Finally, we verify their effectiveness on models of synthetic graphs as well as instances of several classes of real-world network graphs
Fluctuation Spectra and Coarse Graining in Stochastic Dynamics
Fluctuations in small biological systems can be crucial for their function.
Large-deviation theory characterizes such rare events from the perspective of
stochastic processes. In most cases it is very difficult to directly determine
the large-deviation functions. Circumventing this necessity, I present a method
to quantify the fluctuation spectra for arbitrary Markovian models with finite
state space. Under non-equilibrium conditions, current-like observables are of
special interest. The space of all current-like observables has a natural
decomposition into orthogonal complements. Remarkably, the fluctuation spectrum
of any observable is entirely determined by only one of these components. The
method is applied to study differences of fluctuations in setups sampling the
same dynamics at different resolutions. Coarse graining relates these models
and can be done in a way that preserves expectation values of observables.
However, the effects of the coarse graining on the fluctuations are not
obvious. These differences are explicitly worked out for a simple model system.Comment: Master's thesis, 79 pages, 21 figure
Networks, (K)nots, Nucleotides, and Nanostructures
Designing self-assembling DNA nanostructures often requires the identification of a route for a scaffolding strand of DNA through the target structure. When the target structure is modeled as a graph, these scaffolding routes correspond to Eulerian circuits subject to turning restrictions imposed by physical constraints on the strands of DNA. Existence of such Eulerian circuits is an NP-hard problem, which can be approached by adapting solutions to a version of the Traveling Salesperson Problem. However, the author and collaborators have demonstrated that even Eulerian circuits obeying these turning restrictions are not necessarily feasible as scaffolding routes by giving examples of nontrivially knotted circuits which cannot be traced by the unknotted scaffolding strand.
Often, targets of DNA nanostructure self-assembly are modeled as graphs embedded on surfaces in space. In this case, Eulerian circuits obeying the turning restrictions correspond to A-trails, circuits which turn immediately left or right at each vertex. In any graph embedded on the sphere, all A-trails are unknotted regardless of the embedding of the sphere in space. We show that this does not hold in general for graphs on the torus. However, we show this property does hold for checkerboard-colorable graphs on the torus, that is, those graphs whose faces can be properly 2-colored, and provide a partial converse to this result. As a consequence, we characterize (with one exceptional family) regular triangulations of the torus containing unknotted A-trails. By developing a theory of sums of A-trails, we lift constructions from the torus to arbitrary n-tori, and by generalizing our work on A-trails to smooth circuit decompositions, we construct all torus links and certain sums of torus links from circuit decompositions of rectangular torus grids.
Graphs embedded on surfaces are equivalent to ribbon graphs, which are particularly well-suited to modeling DNA nanostructures, as their boundary components correspond to strands of DNA and their twisted ribbons correspond to double-helices. Every ribbon graph has a corresponding delta-matroid, a combinatorial object encoding the structure of the ribbon-graph\u27s spanning quasi-trees (substructures having exactly one boundary component). We show that interlacement with respect to quasi-trees can be generalized to delta-matroids, and use the resulting structure on delta-matroids to provide feasible-set expansions for a family of delta-matroid polynomials, both recovering well-known expansions of this type (such as the spanning-tree expansion of the Tutte polynnomial) as well as providing several previously unknown expansions. Among these are expansions for the transition polynomial, a version of which has been used to study DNA nanostructure self-assembly, and the interlace polynomial, which solves a problem in DNA recombination
IST Austria Thesis
This thesis considers two examples of reconfiguration problems: flipping edges in edge-labelled triangulations of planar point sets and swapping labelled tokens placed on vertices of a graph. In both cases the studied structures – all the triangulations of a given point set or all token placements on a given graph – can be thought of as vertices of the so-called reconfiguration graph, in which two vertices are adjacent if the corresponding structures differ by a single elementary operation – by a flip of a diagonal in a triangulation or by a swap of tokens on adjacent vertices, respectively. We study the reconfiguration of one instance of a structure into another via (shortest) paths in the reconfiguration graph.
For triangulations of point sets in which each edge has a unique label and a flip transfers the label from the removed edge to the new edge, we prove a polynomial-time testable condition, called the Orbit Theorem, that characterizes when two triangulations of the same point set lie in the same connected component of the reconfiguration graph. The condition was first conjectured by Bose, Lubiw, Pathak and Verdonschot. We additionally provide a polynomial time algorithm that computes a reconfiguring flip sequence, if it exists. Our proof of the Orbit Theorem uses topological properties of a certain high-dimensional cell complex that has the usual reconfiguration graph as its 1-skeleton.
In the context of token swapping on a tree graph, we make partial progress on the problem of finding shortest reconfiguration sequences. We disprove the so-called Happy Leaf Conjecture and demonstrate the importance of swapping tokens that are already placed at the correct vertices. We also prove that a generalization of the problem to weighted coloured token swapping is NP-hard on trees but solvable in polynomial time on paths and stars
- …