Related papers: Random functions from coupled dynamical systems
This note aims to bring attention to a simple class of discrete dynamical systems exhibiting some complex behaviour. Each of these systems is defined as a self-mapping of the unit square and is obtained by coupling two families of…
We introduce the \emph{intersection orbital graph} $\Gamma(G_1, G_2; \Omega)$ associated with two permutation groups $G_1, G_2 \leq \mathrm{Sym}(\Omega)$ on a finite set $\Omega$.
We use the order complex corresponding to a symmetric matrix (defined by Giusti et al in 2015). In this note, we use it to define a class of models of random graphs, and show some surprising experimental results, showing sharp phase…
We construct random dynamics on collections of non-intersecting planar contours, leaving invariant the distributions of length- and area-interacting polygonal Markov fields with V-shaped nodes. The first of these dynamics is based on the…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
Assuming some regularity of the dynamical zeta function, we establish an explicit formula with an error term for the prime orbit counting function of a suspended flow. We define the subclass of self-similar flows, for which we give an…
A finite dynamical system (FDS) is a system of multivariate functions over a finite alphabet, that is typically used to model a network of interacting entities. The main feature of a finite dynamical system is its interaction graph, which…
We prove an analogue of the Manin-Mumford conjecture for polynomial dynamical systems over number fields. In our setting the role of torsion points is taken by the small orbit of a point $\alpha$. The small orbit of a point was introduced…
We propose a class of models which generate three-dimensional random volumes, where each configuration consists of triangles glued together along multiple hinges. The models have matrices as the dynamical variables and are characterized by…
Integrable differential identities, together with ensemble-specific initial conditions, provide an effective approach for the characterisation of relevant observables and state functions in random matrix theory. We develop this approach for…
We introduce the novel concept of a non-stationary iterated function system by considering a countable sequence of distinct set-valued maps $\{\mathcal{F}_k\}_{k\in \mathbb{N}}$ where each $\mathcal{F}_k$ maps $\mathcal{H}(X)\to…
Within the study of uncertain dynamical systems, iterated random functions are a key tool. There, one samples a family of functions according to a stationary distribution. Here, we introduce an extension, where one sample functions…
In this paper, the study of the global orbit pattern (gop) formed by all the periodic orbits of discrete dynamical systems on a finite set $X$ allows us to describe precisely the behaviour of such systems. We can predict by means of closed…
Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism $f : G \longrightarrow K$ between multiplicative systems $G$ and $K$ is a…
In this paper we obtain the set of grafts from some set of 12 elementary functions on 12 critical strips. We make use this directly for grafting of elements of the corresponding set of $\zeta$-factorization formulas. This procedure gives…
We establish the functional convex order results for two scaled McKean-Vlasov processes $X=(X_{t})_{t\in[0, T]}$ and $Y=(Y_{t})_{t\in[0, T]}$ defined on a filtered probability space $(\Omega, \mathcal{F}, (\mathcal{F}_{t})_{t\geq0},…
We propose a dynamical process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of individuals are linked by a short chain of acquaintances computable…
We study nonautonomous discrete dynamical systems with randomly perturbed trajectories. We suppose that such a system is generated by a sequence of continuous maps which converges uniformly to a map $f$. We give conditions, under which a…
Rough membership function defines the measurement of relationship between conditional and decision attribute from an Information system. In this paper we propose a new method to construct rough graph through rough membership function…
Let $f\in W^{3,1}_{\mathrm{loc}}(\Omega)$ be a function defined on a connected open subset $\Omega\subseteq\mathbb R^2$. We will show that its graph is contained in a quadratic surface if and only if $f$ is a weak solution to a certain…