Related papers: Nonlinear Mapping Convergence and Application to S…
Dynamic network data have become ubiquitous in social network analysis, with new information becoming available that captures when friendships form, when corporate transactions happen and when countries interact with each other. Flexible…
The Banach-Picard iteration is widely used to find fixed points of locally contractive (LC) maps. This paper extends the Banach-Picard iteration to distributed settings; specifically, we assume the map of which the fixed point is sought to…
In this paper by using the measure of noncompactness concept, we present new fixed point theorems for multivalued maps. In further we introduce a new class of mappings which are general than Meir-Keeler mappings. Finally, we use these…
We deal with germs of diffeomorphisms that are reversible under an involution. We establish that this condition implies that, in general, both the family of reversing symmetries and the group of symmetries are not finite, in contrast with…
We study the complexity of equilibrium computation in discrete preference games. These games were introduced by Chierichetti, Kleinberg, and Oren (EC '13, JCSS '18) to model decision-making by agents in a social network that choose a…
In this paper we explore the PageRank of temporal networks on both discrete and continuous time scales in the presence of personalization vectors that vary over time. Also the underlying interplay between the discrete and continuous…
We provide a framework for modeling social network formation through conditional multinomial logit models from discrete choice and random utility theory, in which each new edge is viewed as a "choice" made by a node to connect to another…
This paper addresses analytical aspects of deterministic, continuous-time dynamical systems defined on networks. The goal is to model and analyze certain phenomena which must be framed beyond the context of networked dynamical systems,…
Stream graphs are a very useful mode of representation for temporal network data, whose richness offers a wide range of possible approaches. The various methods aimed at generalising the classical approaches applied to static networks are…
First order optimization algorithms play a major role in large scale machine learning. A new class of methods, called adaptive algorithms, were recently introduced to adjust iteratively the learning rate for each coordinate. Despite great…
In this paper, we explore the fixed point theory of $n$-valued maps using configuration spaces and braid groups, focussing on two fundamental problems, the Wecken property, and the computation of the Nielsen number. We show that the…
This paper studies inference in models of discrete choice with social interactions when the data consists of a single large network. We provide theoretical justification for the use of spatial and network HAC variance estimators in applied…
This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…
This paper studies the properties of convergence of distances between points and the existence and uniqueness of best proximity and fixed points of the so-called semi-cyclic impulsive self-mappings on the union of a number of nonempty…
This paper treats the global stabilization problem of continuous-time switched affine systems that have rank-deficient convex combinations of their dynamic matrices. For these systems, the already known set of attainable equilibrium points…
For discrete groups G, we introduce equivariant Nielsen invariants. They are equivariant analogs of the Nielsen number and give lower bounds for the number of fixed point orbits in the G-homotopy class of an equivariant endomorphism f:X->X.…
The recently formulated theory of horizontal visibility graphs transforms time series into graphs and allows the possibility of studying dynamical systems through the characterization of their associated networks. This method leads to a…
We introduce and study a general concept of multiple fixed point for mappings defined on partially ordered distance spaces in the presence of a contraction type condition and appropriate monotonicity properties. This notion and the obtained…
Estimation of solution norms and stability for time-dependent nonlinear systems is ubiquitous in numerous applied and control problems. Yet, practically valuable results are rare in this area. This paper develops a novel approach, which…
In this paper, we introduce several types of correspondences: weakly naturally quasiconvex, *-weakly naturally quasiconvex, weakly biconvex and correspondences with *--weakly convex graph and we prove some fixed point theorems for these…