Related papers: Nets, relations and linking diagrams
A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…
By natural way the hierarchy structure is introduced on directed graphs with weighted adjacencies. Embedded system of algebras of subsets of the set of vertices of such digraph and it's consolidations, which vertices are the elementary sets…
Classical contact Lie algebras are the fundamental algebraic structures on the manifolds of contact elements of configuration spaces in classical mechanics. In this paper, we determine the structure of the currently largest known category…
Network classification aims to group networks (or graphs) into distinct categories based on their structure. We study the connection between classification of a network and of its constituent nodes, and whether nodes from networks in…
We analyze the curriculum of the early common-years of engineering in our institute using tools of statistical physics of complex networks. Naturally, a course programme is structured in a networked form (temporal dependency and…
Alignments, i.e., position-wise comparisons of two or more strings or ordered lists are of utmost practical importance in computational biology and a host of other fields, including historical linguistics and emerging areas of research in…
Causal nets (CNs) are Petri nets where causal dependencies are modelled via inhibitor arcs. They play the role of occurrence nets when representing the behaviour of a concurrent and distributed system, even when reversibility is considered.…
We present a formalism for Petri nets based on polynomial-style finite-set configurations and etale maps. The formalism supports both a geometric semantics in the style of Goltz and Reisig (processes are etale maps from graphs) and an…
This paper concerns the algebraic structure of finite-dimensional complex Leibniz algebras. In particular, we introduce left central and symmetric Leibniz algebras, and study the poset of Lie subalgebras using an associative bilinear…
We study the distribution of arithmetic invariants associated to Alexander polynomials for certain infinite families of links. The families of links we consider arise from braids on a fixed number of strings. We explore analogies with…
The structure of the Internet at the Autonomous System (AS) level has been studied by both the Physics and Computer Science communities. We extend this work to include features of the core and the periphery, taking a radial perspective on…
We present an unified construction for algebras and modules homologies and cohomologies, in the case of associative, commuttaive, Lie and Gerstenhaber algebras. We make a distinction between the linear part of the construction of algebras…
Knot theory is the Mathematical study of knots. In this paper we have studied the Composition of two knots. Knot theory belongs to Mathematical field of Topology, where the topological concepts such as topological spaces, homeomorphisms,…
We study relationships between certain algebraic properties of groups and rings definable in a first order structure or $*$-closed in a compact $G$-space. As a consequence, we obtain a few structural results about $\omega$-categorical rings…
In this note we study a family of algebras with one parameter defined by generators and relations. The set of generators contains the generators of the usual braids algebra, and another set of generators which is interpreted as ties between…
Complex networks in natural, social, and technological systems generically exhibit an abundance of rich information. Extracting meaningful structural features from data is one of the most challenging tasks in network theory. Many methods…
Hom-algebras are generalizations of algebras obtained using a twisting by a linear map. But there is a priori a freedom on where to twist. We enumerate here all the possible choices in the Lie and associative categories and study the…
We develop a statistical theory of networks. A network is a set of vertices and links given by its adjacency matrix $\c$, and the relevant statistical ensembles are defined in terms of a partition function $Z=\sum_{\c} \exp {[}-\beta \H(\c)…
This work is divided into two main parts. The first part is devoted to exploring the connectivity of random subgraphs of cartesian products of $K_1$, $K_2$, and $P_3$. In the second part, the author presents a short review of the results…
Collaboration networks are studied as an example of growing bipartite networks. These have been previously observed to have structure such as positive correlations between nearest-neighbour degrees. However, a detailed understanding of the…