Related papers: Nonlinear Mapping Convergence and Application to S…
We develop an extension of the classical model of DeGroot (1974) to a continuum of agents when they interact among them according to a DiKernel. We show that, under some regularity assumptions, the continuous model is the limit case of the…
The Lefschetz fixed point theorem follows easily from the identification of the Lefschetz number with the fixed point index. This identification is a consequence of the functoriality of the trace in symmetric monoidal categories. There are…
We prove that the fixed point iteration of arbitrary positive concave mappings with nonempty fixed point set converges geometrically for any starting point. We also show that positivity is crucial for this result to hold, and the concept of…
Deep networks realize complex mappings that are often understood by their locally linear behavior at or around points of interest. For example, we use the derivative of the mapping with respect to its inputs for sensitivity analysis, or to…
We use $KKM$ theorem to prove the existence of a new fixed point theorem for non-expansive mapping:Let M be a bounded closed convex subset of Hilbert space H, and $A:M\rightarrow M$ be a non-expansive mapping, then exists a fixed point of A…
Group symmetry is inherent in a wide variety of data distributions. Data processing that preserves symmetry is described as an equivariant map and often effective in achieving high performance. Convolutional neural networks (CNNs) have been…
In this paper, a kind of neural network with time-varying delays is proposed to solve the problems of quadratic programming. The delay term of the neural network changes with time t. The number of neurons in the neural network is n + h, so…
Continuous limits of discrete systems with long-range interactions are considered. The map of discrete models into continuous medium models is defined. A wide class of long-range interactions that give the fractional equations in the…
The aim of this paper in to introduce a large class of mappings, called {\it enriched Kannan mappings}, that includes all Kannan mappings and some nonexpansive mappings. We study the set of fixed points and prove a convergence theorem for…
In this paper, we study a new iterative method for finding the fixed point of a weak Bregman relatively nonexpansive mapping and the set of solutions of generalized mixed equilibrium problems in Banach spaces.
This paper presents an analysis approach to finite-time attraction in probability concerns with nonlinear systems described by nonlinear random differential equations (RDE). RDE provide meticulous physical interpreted models for some…
The spread in time of a mutation through a population is studied analytically and computationally in fully-connected networks and on spatial lattices. The time, t_*, for a favourable mutation to dominate scales with population size N as…
We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…
Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so we are interested in finding durable patterns, such as triangles and paths, which persist…
A $1$-Lipschitz map $f$ from a convex compact set to itself has fixed points. This consequence of Brouwer's or Schauder's fixed point theorem has more elementary proofs by approximating $f$ by $\lambda$-contractions, $f_\lambda$. We study…
In this paper, we investigate stable matching in structured networks. Consider case of matching in social networks where candidates are not fully connected. A candidate on one side of the market gets acquaintance with which one on the…
Fixed-point or Newton-methods are typically employed for the numerical solution of nonlinear systems arising from discretization of nonlinear magnetic field problems. We here discuss an alternative strategy which uses local Quasi-Newton…
In this paper, using Kronecker's theorem, we discuss the set of common fixed points of an n-parameter continuous semigroup of mappings. We also discuss convergence theorems to a common fixed point of an n-parameter nonexpansive semigroup.
This article formalizes the problem of modeling social networks into an interacting particle system on random geometric graphs. Each vertex of the graph is associated with a geometric position in a latent space describing the unobserved…
In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal curve. The map matching problem is usually approached with…