相关论文: Incorporating non-local anyonic statistics into a …

Nontrivial topology in physical systems is the driving force behind many phenomena. Notably, phases of matter must be classified in part by their topological properties. Phases with topological order (TO), such as the fractional quantum…

The last few years have seen remarkably fast progress in the understanding of statistics and epidemic dynamics of various clustered networks. This paper considers a class of networks based around a concept (the locale) that allows…

We show that non-abelian quantum statistics can be studied using certain topological invariants which are the homology groups of configuration spaces. In particular, we formulate a general framework for describing quantum statistics of…

We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…

This paper continues the investigation of the configuration space of two distinct points on a graph. We analyze the process of adding an additional edge to the graph and the resulting changes in the topology of the configuration space. We…

We introduce a white graph expansion for the method of perturbative continuous unitary transformations when implemented as a linked cluster expansion. The essential idea behind an expansion in white graphs is to perform an optimized…

The present work studies the influence of nonlocal spatial coupling on the existence of localized structures in 1-dimensional extended systems. We consider systems described by a real field with a nonlocal coupling that has a linear…

Finding the dense regions of a graph and relations among them is a fundamental problem in network analysis. Core and truss decompositions reveal dense subgraphs with hierarchical relations. The incremental nature of algorithms for computing…

We study the entropy of chiral 2+1-dimensional topological phases, where there are both gapped bulk excitations and gapless edge modes. We show how the entanglement entropy of both types of excitations can be encoded in a single partition…

Full Bayesian computational inference for model determination in undirected graphical models is currently restricted to decomposable graphs, except for problems of very small scale. In this paper we develop new, more efficient methodology…

We construct a symplectic realisation of the twisted Poisson structure on the phase space of an electric charge in the background of an arbitrary smooth magnetic monopole density in three dimensions. We use the extended phase space…

This paper introduces and demonstrates a computational pipeline for the statistical analysis of shape graph datasets, namely geometric networks embedded in 2D or 3D spaces. Unlike traditional abstract graphs, our purpose is not only to…

The standard topological approach to indistinguishable particles formulates exchange statistics by using the fundamental group to analyze the connectedness of the configuration space. Although successful in two and more dimensions, this…

We compute the off-shell 1-loop tadpole amplitude in heterotic string field theory. With a special choice of cubic vertex, we show that this amplitude can be computed exactly. We obtain explicit and elementary expressions for the Feynman…

We discuss the phase dependent nonlocal thermoelectric effect in a topological Josephson junction in contact with a normal-metal probe. We show that, due to the helical nature of topological edge states, nonlocal thermoelectricity is…

The classification and characterization of topological phases of matter is well understood for ground states of gapped Hamiltonians that are well isolated from the environment. However, decoherence due to interactions with the environment…

We investigate domain walls between topologically ordered phases in two spatial dimensions and present a simple but general framework from which their degrees of freedom can be understood. The approach we present exploits the results on…

We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve…

We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to decompose a graph into a set of possibly overlapping clusters,…

A symmetry broken phase of a system with internal degrees of freedom often features a complex order parameter, which generates a rich variety of topological excitations and imposes topological constraints on their interaction (topological…