Related papers: A Note on M-convex Functions on Jump Systems
Grip, walk, crawl, and jump. Soft robots are integrated functional structures composed of compliant mechanisms, whose activity spans various industrial applications such as surgery, healthcare, surveillance, and even planetary exploration.…
A classical result of variational analysis, known as Attouch theorem, establishes the equivalence between epigraphical convergence of a sequence of proper convex lower semicontinuous functions and graphical convergence of the corresponding…
Determining functionals are tools to describe the finite dimensional long-term dynamics of infinite dimensional dynamical systems. There also exist several applications to infinite dimensional {\em random} dynamical systems. In these…
Rate-independent systems allow for solutions with jumps that need additional modeling. Here we suggest a formulation that arises as limit of viscous regularization of the solutions in the extended state space. Hence, our parametrized metric…
Consider a system $X = ((x_\xi(t)), \xi \in \Omega_N)_{t \geq 0}$ of interacting Fleming-Viot diffusions with mutation and selection which is a strong Markov process with continuous paths and state space $(\CP(\I))^{\Omega_N}$, where $\I$…
Diffusion processes have been applied with great success to model the dynamics of large populations throughout science, in particular biology. One advantage is that they bridge two different scales: the microscopic and the macroscopic one.…
This paper studies three ways to construct a nonhomogeneous jump Markov process: (i) via a compensator of the random measure of a multivariate point process, (ii) as a minimal solution of the backward Kolmogorov equation, and (iii) as a…
We show that a class of dynamical systems induces an associated operator system in Hilbert space. The dynamical systems are defined from a fixed finite-to-one mapping in a compact metric space, and the induced operators form a covariant…
In this paper, a new class of convex functions as a generalization of convexity which is called (h-m)-convex functions and some properties of this class is given. We also prove some Hadamard's type inequalities.
In this paper we study subdiffusion in a system with a thin membrane. At the beginning, the random walk of a particle is considered in a system with a discrete time and space variable and then the probability describing the evolution of the…
Collective behaviors that emerge from interactions are fundamental to numerous biological systems. To learn such interacting forces from observations, we introduce a measure-valued neural network that infers measure-dependent interaction…
In this paper, an upper semismooth function is defined to be a lower semicontinuous function whose radial subderivative satisfies a mild directional upper semicontinuity property. Examples of upper semismooth functions are the proper lower…
The consistency across scales of a recently developed mathematical thermodynamic structure, between a continuous stochastic nonlinear dynamical system (diffusion process with Langevin or Fokker-Planck equations) and its emergent discrete,…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
We formalize and study the natural approach of designing convex surrogate loss functions via embeddings, for problems such as classification, ranking, or structured prediction. In this approach, one embeds each of the finitely many…
Submodularity is an important concept in combinatorial optimization, and it is often regarded as a discrete analog of convexity. It is a fundamental fact that the set of minimizers of any submodular function forms a distributive lattice.…
We investigate the geometric properties of the convex hull over $n$ successive positions of a planar random walk, with a symmetric continuous jump distribution. We derive the large $n$ asymptotic behavior of the mean perimeter. In addition,…
We define polygonal dynamics as a family of dynamical systems acting on points in projective spaces. The most famous example is the pentagram map. Similar collapsing phenomena seem to occur in most of these systems. We prove it in some…
Convexity, though extremely important in mathematical programming, has not drawn enough attention in the field of dynamic programming. This paper gives conditions for verifying convexity of the cost-to-go functions, and introduces an…
We study the behaviour of discrete dynamical systems generated by a continuous map $f$ of a compact real interval into itself where at randomly chosen times a function different from $f$ - so called impulse function is applied. We show that…