Related papers: Dilations of non-Markovian dynamical systems on gr…

Let $f$ be a non-invertible $C^{1+\beta}(\beta>0)$ map with zero Lyapunov exponents and singularities on a closed Riemannian manifold $M$. We consider the symbolic dynamics of $f$. Combining the techniques in recent works of Sarig, Ovadia…

Graph convolution is a fundamental building block for many deep neural networks on graph-structured data. In this paper, we introduce a simple, yet very effective graph convolutional network with skip connections for semi-supervised anomaly…

In this paper we introduce and develop the theory of non-autonomous graph directed Markov systems which is a generalization of the theory of conformal graph directed Markov systems of Mauldin and Urba\'nski, first presented in their book,…

Graphs with diverse structural characteristics play a central role in modelling and optimization tasks. The ability to generate different types of graphs that exhibit shared properties is likewise essential for algorithm selection and…

For linear random dynamical systems in a separable Banach space $X$, we derived a series of Krein-Rutman type Theorems with respect to co-invariant cone family with rank-$k$, which present a (quasi)-equivalence relation between the…

A geometric method for obtaining an infinite family of Cayley digraphs of constant density on finite Abelian groups is presented. The method works for any given degree and it is based on consecutive dilates of a minimum distance diagram…

This article is concerned with sampling from Gibbs distributions $\pi(x)\propto e^{-U(x)}$ using Markov chain Monte Carlo methods. In particular, we investigate Langevin dynamics in the continuous- and the discrete-time setting for such…

A stable population network is hard to interrupt without any ecological consequences. A communication blockage between patches may destabilize the populations in the ecological network. This work deals with the construction of a safe cut…

We consider a class of non-linear dynamics on a graph that contains and generalizes various models from network systems and control and study convergence to uniform agreement states using gradient methods. In particular, under the…

We prove a rigidity result for pairs of mappings of integrable dilatation whose gradients pointwise deform the unit ball to similar ellipses. Our result implies as corollaries a version of the generalized Stoilow decomposition provided by…

Suppose that E is a Banach space, {\tau} a topology under which the norm of E becomes {\tau}-lower semicontinuous and S a commuting family of {\tau}-continuous nonexpansive mappings defined on a {\tau}-compact convex subset C of E: It is…

We formulate the weak separation condition and the finite type condition for conformal iterated function systems on Riemannian manifolds with nonnegative Ricci curvature, and generalize the main theorems by Lau \textit{et al.} in [Monatsch.…

We present a characterization of $(\mu,\nu)$-dichotomies in terms of the admissibility of certain pairs of weighted spaces for nonautonomous discrete time dynamics acting on Banach spaces. Our general framework enables us to treat various…

Conventional spectral digraph partitioning methods typically symmetrize the adjacency matrix, thereby transforming the directed graph partitioning problem into an undirected one, where bipartitioning is commonly linked to minimizing graph…

Let $G=(V(G),E(G))$ be a graph and $H=(V(H),E(H))$ be a hypergraph. The hypergraph $H$ is a {\it Berge-G} if there is a bijection $f : E(G) \mapsto E(H)$ such that for each $e \in E(G)$ we have $e \subseteq f(e)$. We define {\it dilations…

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

We study the interaction between unitary $\rho$-dilations of a pair of Hilbert space operators and Birkhoff-James orthogonality. We prove that for two orthogonal operators $T,A$ if $\|T\|=\rho$, then $U_T \perp_B U_A$ for any unitary…

Let $\mathcal{C}$ be a class of graphs closed under taking induced subgraphs. We say that $\mathcal{C}$ has the {\em clique-stable set separation property} if there exists $c \in \mathbb{N}$ such that for every graph $G \in \mathcal{C}$…

Let $\Delta =\{ \delta_1,\delta_2,...,\delta_m \} $ be a finite set of 2-connected patterns, i.e. graphs up to vertex relabelling. We study the generating function $D_{\Delta }(z,u_1,u_2,...,u_m),$ which counts polygon dissections and marks…

In this paper, we first develop a new family of conjugate prior distributions for the cell parameters of discrete graphical models Markov with respect to a set P of moral directed acyclic graphs with skeleton a given decomposable graph G.…