Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Ugalde, Edgardo"'
R. Burton and J. Steif developed a strategy to construct examples of strongly irreducible subshifts of finite type admitting several measures of maximal entropy. This strategy exploits a correspondence between equilibrium statistical mechanics and sy
Externí odkaz:
http://arxiv.org/abs/2104.07503
We consider a basic one-dimensional model of diffusion which allows to obtain a diversity of diffusive regimes whose speed depends on the moments of the per-site trapping time. This model is closely related to the continuous time random walks widely
Externí odkaz:
http://arxiv.org/abs/1903.02916
This work is devoted to the study of processes generated by random substitutions over a finite alphabet. We prove, under mild conditions on the substitution's rule, the existence of a unique process which remains invariant under the substitution, and
Externí odkaz:
http://arxiv.org/abs/1712.00586
Publikováno v:
Applied Network Science; 11/8/2024, Vol. 9 Issue 1, p1-14, 14p
We introduce a distance in the space of fully-supported probability measures on one-dimensional symbolic spaces. We compare this distance to the $\bar{d}$-distance and we prove that in general they are not comparable. Our projective distance is inspi
Externí odkaz:
http://arxiv.org/abs/1503.00749
Autor:
Salgado-García, Raúl, Ugalde, Edgardo
This work is devoted to the study of the scaling, and the consequent power-law behavior, of the correlation function in a mutation-replication model known as the expansion-modification system. The latter is a biology inspired random substitution mode
Externí odkaz:
http://arxiv.org/abs/1202.2549
We study the dynamical properties of small regulatory networks treated as non autonomous dynamical systems called modules when working inside larger networks or, equivalently when subject to external signal inputs. Particular emphasis is put on the i
Externí odkaz:
http://arxiv.org/abs/0907.1056
Autor:
Chazottes, Jean-Rene, Ugalde, Edgardo
Starting from the full--shift on a finite alphabet $A$, mingling some symbols of $A$, we obtain a new full shift on a smaller alphabet $B$. This amalgamation defines a factor map from $(A^{\mathbb N},T_A)$ to $(B^{\mathbb N},T_B)$, where $T_A$ and $T
Externí odkaz:
http://arxiv.org/abs/0907.0528
Autor:
Luna, Beatriz, Ugalde, Edgardo
Discrete-time regulatory networks are dynamical systems on directed graphs, with a structure inspired on natural systems of interacting units. There is a natural notion of determination amongst vertices, which we use to classify the nodes of the netw
Externí odkaz:
http://arxiv.org/abs/0708.0595
We study the dynamics of discrete-time regulatory networks on random digraphs. For this we define ensembles of deterministic orbits of random regulatory networks, and introduce some statistical indicators related to the long-term dynamics of the syst
Externí odkaz:
http://arxiv.org/abs/0707.1551