Related papers: String-node nets and meshes

Cosmic strings are topological defects possibly formed in the early Universe, which may be observable due to their gravitational effects on the cosmic microwave background radiation or gravitational wave experiments. To this effect it is…

Data classification techniques partition the data or feature space into smaller sub-spaces, each corresponding to a specific class. To classify into subspaces, physical features e.g., distance and distributions are utilized. This approach…

From spiking activity in neuronal networks to force chains in granular materials, the behavior of many real-world systems depends on a network of both strong and weak interactions. These interactions give rise to complex and higher-order…

A theory for studying the dynamic scaling properties of branes and relativistic topological defect networks is presented. The theory, based on a relativistic version of the level set method, well-known in other contexts, possesses…

This paper focuses on the modeling of musical melodies as networks. Notes of a melody can be treated as nodes of a network. Connections are created whenever notes are played in sequence. We analyze some main tracks coming from different…

We define a multi-scale metric $d_\rho$ on strings by aggregating angle distances between all $n$-gram count vectors with exponential weights $\rho^n$. We benchmark $d_\rho$ in DBSCAN clustering against edit and $n$-gram baselines, give a…

The tensionless limit of classical string theory may be formulated as a topological theory on the world-sheet. A vector density carries geometrical information in place of an internal metric. It is found that path-integral quantization…

We study the statistical properties of large random networks with specified degree distributions. New techniques are presented for analyzing the structure of social networks. Specifically, we address the question of how many nodes exist at…

Common experience suggests that many networks might possess community structure - division of vertices into groups, with a higher density of edges within groups than between them. Here we describe a new computer algorithm that detects…

A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if…

A string figure is topologically a trivial knot lying on an imaginary plane orthogonal to the fingers with some crossings. The fingers prevent cancellation of these crossings. As a mathematical model of string figure we consider a knot…

The network formed by ridges in a straightened sheet of crumpled paper is studied using a laser profilometer. Square sheets of paper were crumpled into balls, unfolded and their height profile measured. From these profiles the imposed…

Low-dimensional embeddings are a cornerstone in the modelling and analysis of complex networks. However, most existing approaches for mining network embedding spaces rely on computationally intensive machine learning systems to facilitate…

I suggest the possibility of a new string in ten dimensions. Evidence for this string is presented both from orientifold physics and from K-theory, along with a mystery concerning the M-theory description. Motivated by this possibility,…

Network science plays an increasingly important role to model complex data in many scientific disciplines. One notable feature of network organization is community structure, which refers to clusters of tightly interconnected nodes. A…

In the last decade it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks: separable elements, with connections (or interactions) between certain pairs of them.…

In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…

Real-world networks typically exhibit several aspects, or layers, of interactions among their nodes. By permuting the role of the nodes and the layers, we establish a new criterion to construct the dual of a network. This approach allows to…

Directed networks are ubiquitous and are necessary to represent complex systems with asymmetric interactions---from food webs to the World Wide Web. Despite the importance of edge direction for detecting local and community structure, it…

We introduce a new topological descriptor of a network called the density decomposition which is a partition of the nodes of a network into regions of uniform density. The decomposition we define is unique in the sense that a given network…