Analyzing wireless communication network vulnerability with homological invariants

This article explains how sheaves and homology theory can be applied to simplicial complex models of wireless communication networks to study their vulnerability to jamming. It develops two classes of invariants (one local and one global) for studying which nodes and links present more of a liability to the network's performance when under attack.Comment: Submitted to ICASSP 201

2-vertex Lorentzian Spin Foam Amplitudes for Dipole Transitions

We compute transition amplitudes between two spin networks with dipole graphs, using the Lorentzian EPRL model with up to two (non-simplicial) vertices. We find power-law decreasing amplitudes in the large spin limit, decreasing faster as the complexity of the foam increases. There are no oscillations nor asymptotic Regge actions at the order considered, nonetheless the amplitudes still induce non-trivial correlations. Spin correlations between the two dipoles appear only when one internal face is present in the foam. We compute them within a mini-superspace description, finding positive correlations, decreasing in value with the Immirzi parameter. The paper also provides an explicit guide to computing Lorentzian amplitudes using the factorisation property of SL(2,C) Clebsch-Gordan coefficients in terms of SU(2) ones. We discuss some of the difficulties of non-simplicial foams, and provide a specific criterion to partially limit the proliferation of diagrams. We systematically compare the results with the simplified EPRLs model, much faster to evaluate, to learn evidence on when it provides reliable approximations of the full amplitudes. Finally, we comment on implications of our results for the physics of non-simplicial spin foams and their resummation.Comment: 27 pages + appendix, many figures. v2: one more numerical result, plus minor amendment

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