相关论文: Acyclic Solos and Differential Interaction Nets
A new link invariant is derived using the exactly solvable chiral Potts model and a generalized Gaussian summation identity. Starting from a general formulation of link invariants using edge-interaction spin models, we establish the…
Every directed acyclic graph (DAG) over a finite non-empty set of variables (= nodes) N induces an independence model over N, which is a list of conditional independence statements over N.The inclusion problem is how to characterize (in…
Delayed interactions are a common property of coupled natural systems and therefore arise in a variety of different applications. For instance, signals in neural or laser networks propagate at finite speed giving rise to delayed…
Invariants for complicated objects such as those arising in phylogenetics, whether they are invariants as matrices, polynomials, or other mathematical structures, are important tools for distinguishing and working with such objects. In this…
The co-occurrence association is widely observed in many empirical data. Mining the information in co-occurrence data is essential for advancing our understanding of systems such as social networks, ecosystem, and brain network. Measuring…
We show that a network of non-identical nodes, with excitable dynamics, pulse-coupled, with coupling delays depending on the Euclidean distance between nodes, is able to adapt the topology of its connections to obtain spike frequency…
Rate and diversity impose a fundamental trade-off in communications. This trade-off was investigated for flat-fading channels in [15] as well as for Inter-symbol Interference (ISI) channels in [1]. A different point of view was explored in…
Interaction nets are a graphical model of computation, which has been used to define efficient evaluators for functional calculi, and specifically lambda calculi with patterns. However, the flat structure of interaction nets forces pattern…
The expressiveness of communication primitives has been explored in a common framework based on the pi-calculus by considering four features: synchronism (asynchronous vs synchronous), arity (monadic vs polyadic data), communication medium…
We use dialgebras, generalising both algebras and coalgebras, as a complement of the standard coalgebraic framework, aimed at describing the semantics of an interactive system by the means of reaction rules. In this model, interaction is…
We study whether, in the pi-calculus, the match prefix-a conditional operator testing two names for (syntactic) equality-is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this…
Block encoding lies at the core of many existing quantum algorithms. Meanwhile, efficient and explicit block encodings of dense operators are commonly acknowledged as a challenging problem. This paper presents a comprehensive study of the…
We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact closed categories with biproducts. The calculus is a full and faithful representation of the free strongly compact closed category with…
Bayesian networks are directed acyclic graphs representing independence relationships among a set of random variables. A random variable can be regarded as a set of exhaustive and mutually exclusive propositions. We argue that there are…
We define a grid presentation for singular links i.e. links with a finite number of rigid transverse double points. Then we use it to generalize link Floer homology to singular links. Besides the consistency of its definition, we prove that…
We show that any quantum density matrix can be represented by a Bayesian network (a directed acyclic graph), and also by a Markov network (an undirected graph). We show that any Bayesian or Markov net that represents a density matrix, is…
Isolation is a concept from the world of clique enumeration that is mostly used to model communities that do not have much contact to the outside world. Herein, a clique is considered isolated if it has few edges connecting it to the rest…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
Formation control is concerned with the design of control laws that stabilize agents at given distances from each other, with the constraint that an agent's dynamics can depend only on a subset of other agents. When the information flow…
The importance of structured, complex connectivity patterns found in several real-world systems is to a great extent related to their respective effects in constraining and even defining the respective dynamics. Yet, while complex networks…