Related papers: Nets, relations and linking diagrams
We present a network model in which words over a specific alphabet, called {\it structures}, are associated to each node and undirected edges are added depending on some distance between different structures. It is shown that this model can…
Many real-world complex networks contain a significant amount of structural redundancy, in which multiple vertices play identical topological roles. Such redundancy arises naturally from the simple growth processes which form and shape many…
In a recent work we have shown how to construct an information algebra of coherent sets of gambles defined on general possibility spaces. Here we analyze the connection of such an algebra with the set algebra of subsets of the possibility…
It is a survey of the main results on abstract characterizations of algebras of $n$-place functions obtained in the last 40 years. A special attention is paid to those algebras of $n$-place functions which are strongly connected with groups…
This paper studies \emph{Dirichlet arrangements}, a generalization of graphic hyperplane arrangements arising from electrical networks and order polytopes of finite posets. We generalize descriptions of combinatorial features of graphic…
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical…
Complex networks are universal, arising in fields as disparate as sociology, physics, and biology. In the past decade, extensive research into the properties and behaviors of complex systems has uncovered surprising commonalities among the…
The study of networks has grown into a substantial interdisciplinary endeavour that encompasses myriad disciplines in the natural, social, and information sciences. Here we introduce a framework for constructing taxonomies of networks based…
In this article we give an in depth overview of the recent advances in the field of equilibrium networks. After outlining this topic, we provide a novel way of defining equilibrium graph (network) ensembles. We illustrate this concept on…
Let G be a simple complex algebraic group. By using a notion of a G-category we define invariants of tangles with flat G-connections in their complements. We also show that quantized universal enveloping algebras at roots of unity provide…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
A class of nets in constructive (in A.A.Markov's sense) topological space for which the convergence is equivalent to convergence of all subsequences, is described. B.A.Kushner's theorem about coincidence of strong and weak constructive…
The geometric, topological, and symplectic properties of moduli spaces (spaces of configurations modulo rotations and translations) of polygonal linkages have been studied by Kapovich, Millson, and Kamiyama, et. al. One can form a polygonal…
We discuss certain ternary algebraic structures appearing more or less naturally in various domains of theoretical and mathematical physics. Far from being exhaustive, this article is intended above all to draw attention to these algebras,…
We formalise a general concept of distributed systems as sequential components interacting asynchronously. We define a corresponding class of Petri nets, called LSGA nets, and precisely characterise those system specifications which can be…
In this article, we extend several algebraic graph analysis methods to bipartite networks. In various areas of science, engineering and commerce, many types of information can be represented as networks, and thus the discipline of network…
We review some of the endeavors in trying to connect Petri nets with free symmetric monoidal categories. We give a list of requirement such connections should respect if they are meant to be useful for practical/implementation purposes. We…
Boolean Petri nets equipped with nop allow places and transitions to be independent by being related by nop. We characterize for any fixed natural number g the computational complexity of synthesizing nop-equipped Boolean Petri nets from…
Network equilibrium models represent a versatile tool for the analysis of interconnected objects and their relationships. They have been widely employed in both science and engineering to study the behavior of complex systems under various…
Web services growth makes the composition process a hard task to solve. This numerous interacting elements can be adequately represented by a network. Discovery and composition can benefit from the knowledge of the network structure. In…