Related papers: The dynamics of binary alternatives for a discrete…
A model of $s$ interacting species is considered with two types of dynamical variables. The fast variables are the populations of the species and slow variables the links of a directed graph that defines the catalytic interactions among…
Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There is, however, a subtle difference between networks where weights are continuos…
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of model checking a fixed monadic second-order formula over evolving subgraphs of a fixed maximal…
We study the dynamics of the Stochastic Sandpile Model on finite graphs, with two main results. First, we describe a procedure to exactly sample from the stationary distribution of the model in all connected finite graphs, extending a…
We give a self-contained introduction to the theory of directed graphs, leading up to the relationship between the Perron-Frobenius eigenvectors of a graph and its autocatalytic sets. Then we discuss a particular dynamical system on a fixed…
Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…
Symbolic dynamics is a coarse-grained description of dynamics. By taking into account the ``geometry'' of the dynamics, it can be cast into a powerful tool for practitioners in nonlinear science. Detailed symbolic dynamics can be developed…
We extend Cellular Automata to time-varying discrete geometries. In other words we formalize, and prove theorems about, the intuitive idea of a discrete manifold which evolves in time, subject to two natural constraints: the evolution does…
Estimating the structure of directed acyclic graphs (DAGs) of features (variables) plays a vital role in revealing the latent data generation process and providing causal insights in various applications. Although there have been many…
We revisit the classic problem of determining optimal routes in a graph for transporting two given distributions defined on its nodes, originally studied by Wardrop and Beckmann in the 1950s. The global congestion profile at any given time…
A connected graph can be associated with two distinct evolution algebras. In the first case, the structural matrix is the adjacency matrix of the graph itself. In the second case, the structural matrix is the transition probabilities matrix…
Graphical causal models are an important tool for knowledge discovery because they can represent both the causal relations between variables and the multivariate probability distributions over the data. Once learned, causal graphs can be…
Stochastic dynamics is generated by a matrix of transition probabilities. Certain eigenvectors of this matrix provide observables, and when these are plotted in the appropriate multi-dimensional space the phases (in the sense of phase…
As a first step toward realizing a dynamical system that evolves while spontaneously determining its own rule for time evolution, function dynamics (FD) is analyzed. FD consists of a functional equation with a self-referential term, given…
A binary state on a graph means an assignment of binary values to its vertices. For example, if one encodes a network of spiking neurons as a directed graph, then the spikes produced by the neurons at an instant of time is a binary state on…
Graphical models provide a powerful methodology for learning the conditional independence structure in multivariate data. Inference is often focused on estimating individual edges in the latent graph. Nonetheless, there is increasing…
In the statistical analysis of shape a goal beyond the analysis of static shapes lies in the quantification of `same' deformation of different shapes. Typically, shape spaces are modelled as Riemannian manifolds on which parallel transport…
A Random Graph is a random object which take its values in the space of graphs. We take advantage of the expressibility of graphs in order to model the uncertainty about the existence of causal relationships within a given set of variables.…
A new model for biological growth is introduced that couples the geometry of an organism (or part of the organism) to the flow and deposition of material. The model has three dynamical variables (a) a Riemann metric tensor for the geometry,…
A classic approach in dynamical systems is to use particular geometric structures to deduce statistical properties, for example the existence of invariant measures with stochastic-like behaviour such as large deviations or decay of…