相关论文: Connected components and topological ends of stati…
This paper considers generalised network, intended as networks where (a) the edges connecting the nodes are nonlinear, and (b) stochastic processes are continuously indexed over both vertices and edges. Such topological structures are…
Given a finite group $G$ and its representation $\rho$, the corresponding McKay graph is a graph $\Gamma(G,\rho)$ whose vertices are the irreducible representations of $G$; the number of edges between two vertices $\pi,\tau$ of…
We consider a weakly coupled gauge theory where charged particles all have large gaps (ie no Higgs condensation to break the gauge "symmetry") and the field strength fluctuates only weakly. We ask what kind of topological terms can be added…
Fracton theories possess exponentially degenerate ground states, excitations with restricted mobility, and nontopological higher-form symmetries. This paper shows that such theories can be defined on arbitrary spatial lattices in three…
In the Euclidean Bottleneck Steiner Tree problem, the input consists of a set of $n$ points in $\mathbb{R}^2$ called terminals and a parameter $k$, and the goal is to compute a Steiner tree that spans all the terminals and contains at most…
Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…
We study basic spectral features of graph Laplacians associated with a class of rooted trees which contains all regular trees. Trees in this class can be generated by substitution processes. Their spectra are shown to be purely absolutely…
We introduce forest diagrams and strand diagrams for elements of Thompson's group F. A forest diagram is a pair of infinite, bounded binary forests together with an order-preserving bijection of the leaves. Using forest diagrams, we derive…
As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph $G=(V,E)$, a multiset…
Geodesic distance, sometimes called shortest path length, has proven useful in a great variety of applications, such as information retrieval on networks including treelike networked models. Here, our goal is to analytically determine the…
We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…
An $(n_k)$-configuration is a set of $n$ points and $n$ lines in the projective plane such that their point-line incidence graph is $k$-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are…
We consider $n$-component fixed-length order parameter interacting with a weak random field in $d=1,2,3$ dimensions. Relaxation from the initially ordered state and spin-spin correlation functions have been studied on lattices containing…
The aim of this article is to study the forest composed by point-to-line geodesics in the last-passage percolation model with exponential weights. We will show that the location of the root can be described in terms of the maxima of a…
In the Euclidean Steiner Tree problem, we are given as input a set of points (called terminals) in the $\ell_2$-metric space and the goal is to find the minimum-cost tree connecting them. Additional points (called Steiner points) from the…
We consider straight line drawings of a planar graph $G$ with possible edge crossings. The \emph{untangling problem} is to eliminate all edge crossings by moving as few vertices as possible to new positions. Let $fix(G)$ denote the maximum…
We highlight a general theory to engineer arbitrary Hermitian tight-binding lattice models in electrical LC circuits, where the lattice sites are replaced by the electrical nodes, connected to its neighbors and to the ground by capacitors…
The topological states of the two-leg and three-leg ladders formed by two trivial quantum wires with different lattice constants are theoretically investigated. Firstly, we take two trivial quantum wires with a lattice constant ratio of 1:2…
The set of real finite-gap Sine-Gordon solutions corresponding to a fixed spectral curve consists of several connected components. A simple explicit description of these components obtained by the authors recently is used to study the…
Recently, the second and third author showed that complete geometric graphs on $2n$ vertices in general cannot be partitioned into $n$ plane spanning trees. Building up on this work, in this paper, we initiate the study of partitioning into…