Related papers: A note on discrete Holonomy through directed edges…
We investigate graphs that have characteristic-dependent well-covered dimension and show how more of these graphs can be constructed from known ones.
A group topology is said to be linear if open subgroups form a base of neighborhoods of the identity element. It is proved that the existence of a nondiscrete extremally disconnected group of Ulam nonmeasurable cardinality with linear…
This paper proposes a simple procedure to decide whether the empirically-observed adjacency or weights matrix, which characterizes the graph underlying a socio-economic network, is sufficiently symmetric (respectively, asymmetric) to…
The number of nodes of a network, called its size, and the largest distance between nodes of a network, called its diameter, are among the most important network parameters. Knowing the size and/or diameter is a prerequisite of many…
We construct the holonomy groupoid of any singular foliation. In the regular case this groupoid coincides with the usual holonomy groupoid of Winkelnkemper (1983); the same holds in the singular cases of Bigonnet and Pradines (1985) and…
We characterize the representations of the fundamental group of a closed surface to $\mathrm{PSL}_2(\mathbb C)$ that arise as the holonomy of a branched complex projective structure with fixed branch divisor. In particular, we compute the…
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…
We study the structure of personal relationships among 1068 high school students using a dataset that contains the network of self-reported friendly and conflictive relationships, with information on their directionality and intensity. We…
In a graph, nodes can be characterized locally (with their degree $k$) or globally (e.g. with their average length path $\xi$ to other nodes). Here we investigate how $\xi$ depends on $k$. Our earlier algorithm of the construction of the…
The major goal of the paper is to prove that discrete frames of (directional) wavelets derived from an approximate identity exist. Additionally, a kind of energy conservation property is shown to hold in the case when a wavelet family is…
The structural invariant subspaces of the discrete-time singular Hamiltonian system are used in 1] to give an analytic nonrecursive expression of all the admissible trajectories. A deeper insight into the features of these subspaces,…
Let $E \subset {\Bbb F}_q^d$, the $d$-dimensional vector space over a finite field with $q$ elements. Construct a graph, called the distance graph of $E$, by letting the vertices be the elements of $E$ and connect a pair of vertices…
Reasoning about distance is indispensable for establishing or avoiding contact in manipulation tasks. To this end, we present an online approach for learning implicit representations of signed distance using piecewise polynomial basis…
Distance geometry is the study of the arrangements of points in space using only the mutual distances between them. The basic idea in this letter is to use distance geometry for thermodynamics studies of small clusters in the microcanonical…
A list of possible holonomy groups contained the exceptional, non-compact Lie group $\mathrm{G}_2^{*}$ was provided by Fino and Kath. The classification is due to the corresponding holonomy algebras and divided into Type I, II and III,…
Here we present a range-limited approach to centrality measures in both non-weighted and weighted directed complex networks. We introduce an efficient method that generates for every node and every edge its betweenness centrality based on…
With improvements in data resolution and quality, researchers can now represent complex systems as signed, weighted, and directed networks. In this article, we introduce a framework for measuring net and indirect effects without simplifying…
We define the notions of unilateral metric derivatives and ``metric derived numbers'' in analogy with Dini derivatives (also referred to as ``derived numbers'') and establish their basic properties. We also prove that the set of points…
We introduce the concept of dynamical score networks for the representation and analysis of tonal compositions: a score is interpreted as a dynamical network where every chord is a node and each progression links successive chords. This…
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomplete set of distances, and the output is a set of points in…