Related papers: Signed Chord Length Distribution. I
A centrality measure of the cut-edges of an undirected graph, given in [Altafini et al.~SIMAX 2023] and based on Kemeny's constant, is revisited. A numerically more stable expression is given to compute this measure, and an explicit…
We measure and compare three correlation lengths proposed to describe the extent of structural order in amorphous systems. In particular, the recently proposed "patch correlation length" is measured as a function of temperature and…
The paper develops new methods of non-parametric estimation a compound Poisson distribution. Such a problem arise, in particular, in the inference of a Levy process recorded at equidistant time intervals. Our key estimator is based on…
The buildup and release of a sense of tension is one of the most essential aspects of the process of listening to music. A veridical computational model of perceived musical tension would be an important ingredient for many music…
In the study of the geometrically regular weighted shifts (GRWS) -- see [5] -- signed power representing measures (which we call Berger-type charges) played an important role. Motivated by their utility in that context, we establish a…
By adding or removing appropriate structures to Gauss diagram, one can create useful objects related to virtual links. In this paper few objects of this kind are studied: twisted virtual links generalizing virtual links; signed chord…
In this paper we consider measures of similarity between two sets of strings built up using the Hamming distance and tools of persistence homology as a basis. First we describe the construction of the \v Cech filtration adjoined to the set…
In a signed graph, each link is labeled with either a positive or a negative sign. This is particularly appropriate to model polarized systems. Such a graph can be characterized through the notion of structural balance, which relies on the…
A signed graph $G$ is a graph where each edge is assigned a + (positive edge) or a - (negative edge). The signed degree of a vertex $v$ in a signed graph, denoted by $sdeg(v)$, is the number of positive edges incident to $v$ subtracted by…
Variable-length feedback codes can provide advantages over fixed-length feedback or non-feedback codes. This letter focuses on uncoded variable-symbol-length feedback communication and analyzes the autocorrelation and spectrum of the…
We investigate numerically the scattering of waves on discrete graphs. An efficient algorithm is developed to compute the reflection and transmission (spectral) coefficients. We then explore various configurations of input and output leads,…
Many biomolecules have flexible structures, requiring distributional estimates of their conformations. Experiments to acquire distributional data typically measure pairs of labels separately, losing information on the joint distribution.…
We develop further a new geometrical model of a discretized string, proposed in [1] and establish its basic physical properties. The model can be considered as the natural extention of the usual Feynman amplitude of the random walks to…
Structure perception is a fundamental aspect of music cognition in humans. Historically, the hierarchical organization of music into structures served as a narrative device for conveying meaning, creating expectancy, and evoking emotions in…
The distribution of individual Dirac eigenvalues is derived by relating them to the density and higher eigenvalue correlation functions. The relations are general and hold for any gauge theory coupled to fermions under certain conditions…
Distributed-order time-fractional wave equations appear in the modeling of wave propagation in viscoelastic media. The material characteristics of the medium are modeled through constitutive functions or distributions in the…
In this paper we study integer multiplicity rectifiable currents carried by the subgradient (subdifferential) graphs of semi-convex functions on a $n$-dimensional convex domain, and show a weak continuity theorem with respect to pointwise…
Ideas about a duality between gauge fields and strings have been around for many decades. During the last ten years, these ideas have taken a much more concrete mathematical form. String descriptions of the strongly coupled dynamics of…
We demonstrate that certain Johnson-type bounds are asymptotically exact for a variety of classes of codes, namely, constant-composition codes, nonbinary constant-weight codes and multiply constant-weight codes. This was achieved via an…
In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…