Related papers: Verified Parameterized Choreographies Technical Re…
This document provides a detailed overview of the CLUBB-SILHS cloud and turbulence parameterization, including theoretical background, model equations, closure assumptions, simulation results, comparison with other parameterization methods,…
Distributed interactions can be suitably designed in terms of choreographies. Such abstractions can be thought of as global descriptions of the coordination of several distributed parties. Global assertions define contracts for…
These notes survey the theory of (twisted) conformal blocks from an algebro-geometric perspective and have two main goals. The first one is to summarize the construction of conformal blocks from vertex operator algebras, and to describe…
Graph vertex ordering is widely employed in spatial data analysis, especially in urban analytics, where street graphs serve as spatial discretization for modeling and simulation. It is also crucial for visualization, as many methods require…
An internal characterization of complete metric mappings (by means of Cauchy nets tied at a point) is given and a construction of the completion of a metric mapping is presented.
The intended purpose of this work is to provide the reader with a comprehensive, state-of-the art presentation of the theory of complex Hadamard matrices, or at least report on the very recent advances. This manuscript consists of three…
The completely bounded trace and spectral norms, for finite-dimensional spaces, are known to be efficiently expressible by semidefinite programs (J. Watrous, Theory of Computing 5: 11, 2009). This paper presents two new, and arguably much…
Signed graphs are studied since the middle of the last century. Recently, the notion of homomorphism of signed graphs has been introduced since this notion captures a number of well known conjectures which can be reformulated using the…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
Over the years, several Bridges papers have delved into the concept of danceability of a knot diagram. Inspired by dancing on non-orientable surfaces, in this paper, we expand danceability to twisted virtual knot diagrams. This paper is…
A discrete conformality for polyhedral metrics on surfaces is introduced in this paper which generalizes earlier work on the subject. It is shown that each polyhedral metric on a surface is discrete conformal to a constant curvature…
This is a technical report, containing all the theorem proofs and additional evaluations in paper "Efficient Identification of Additive Link Metrics via Network Tomography" by Liang Ma, Ting He, Kin K. Leung, Don Towsley, and Ananthram…
The main subject of the book is an up-to-date and in-depth survey of the theory of normal frames and coordinates in differential geometry. The book can be used as a reference manual, review of the existing results and introduction to some…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
We give an alternative treatment of the foundations of parametrized spectra, with an eye toward applications in fixed-point theory. We cover most of the central results from the book of May and Sigurdsson, sometimes with weaker hypotheses,…
We propose a choreographic model of reversible computations based on a conservative extension of global graphs and communicating finite-state machines. The main advantage of our approach is that does not require to instrument models in…
We define rectifiability in $\mathbb{R}^{n}\times\mathbb{R}$ with a parabolic metric in terms of $C^1$ graphs and Lipschitz graphs with small Lipschitz constants and we characterize it in terms of approximate tangent planes and tangent…
We present a state-of-the-art report on visualization corpora in automated chart analysis research. We survey 56 papers that created or used a visualization corpus as the input of their research techniques or systems. Based on a multi-level…
In this paper we discuss the notion of completeness of topologized posets and survey some recent results on closedness properties of complete topologized semilattices.
In this note we prove that every closed graph $G$ is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.