Related papers: Coupling Dimers to CDT
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…
In a bidirected graph an edge has a direction at each end, so bidirected graphs generalize directed graphs. We generalize the definitions of transitive closure and transitive reduction from directed graphs to bidirected graphs by…
Instead of evaluating the gradient field of the brightness map of an image, we propose the use of dipole vectors. This approach is obtained by adapting to the image gray-tone distribution the definition of the dipole moment of charge…
The graph alignment problem explores the concept of node correspondence and its optimality. In this paper, we focus on purely geometric graph alignment methods, namely our newly proposed Ricci Matrix Comparison (RMC) and its original form,…
Most robot mapping techniques for lidar sensors tessellate the environment into pixels or voxels and assume uniformity of the environment within them. Although intuitive, this representation entails disadvantages: The resulting grid maps…
${\mathcal PT}-$symmetric dimers with a time-periodic gain/loss function in a balanced configuration where the amount of gain equals that of loss are investigated analytically and numerically. Two prototypical dimers in the linear regime…
In this work, we propose trait-based merge trees a generalization of merge trees to feature level sets, targeting the analysis of tensor field or general multi-variate data. For this, we employ the notion of traits defined in attribute…
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.
We give an overview of recent developments in the theory of dimer models. The viewpoint we take is inspired by mirror symmetry. After an introduction to the combinatorics of dimer models, we will first look at dimers in dynamical systems…
We consider the model of hard dimers coupled to two-dimensional Causal Dynamical Triangulations (CDT) with all dimer types present and solve it exactly subject to a single restriction. Depending on the dimer weights there are, in addition…
The concept of pendant-tree connectivity, introduced by Hager in 1985, is a generalization of classical vertex-connectivity. In this paper, we study pendant-tree connectivity of line graphs.
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…
We define the $d$-defective incidence chromatic number of a graph, generalizing the notion of incidence chromatic number, and determine it for some classes of graphs including trees, complete bipartite graphs, complete graphs, and…
We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number of symmetric group divisible designs which…
CDT is an attempt to formulate a non-perturbative lattice theory of quantum gravity. We describe the phase diagram and analyse the phase transition between phase B and phase C (which is the analogue of the de Sitter phase observed for the…
Homology groups of labelled asynchronous transition systems and Petri nets are introduced. Examples of computing the homology groups are given. It is proved that if labelled asynchronous transition systems are bisimulation equivalent, then…
Complex unit gain graphs may exhibit various kinds of symmetry. In this work, we explore structural symmetry, spectral symmetry and sign-symmetry in such graphs, and their respective relations to one-another. Our main result is a…
In this paper, we introduce a matrix for a mixed graph, called the integrated adjacency matrix. This matrix uniquely determines a mixed graph, as long as the indices of the matrix are specified. Additionally, we associate an (undirected)…
Computed Tomography (CT) is widely used in healthcare for detailed imaging. However, Low-dose CT, despite reducing radiation exposure, often results in images with compromised quality due to increased noise. Traditional methods, including…
In this paper, we study merge trees induced by a discrete Morse function on a tree. Given a discrete Morse function, we provide a method to constructing an induced merge tree and define a new notion of equivalence of discrete Morse…