Related papers: Nonlinear Mapping Convergence and Application to S…
Much of social network analysis is - implicitly or explicitly - predicated on the assumption that individuals tend to be more similar to their friends than to strangers. Thus, an observed social network provides a noisy signal about the…
We adopt an operator-theoretic perspective to study convergence of linear fixed-point iterations and discrete- time linear systems. We mainly focus on the so-called Krasnoselskij-Mann iteration x(k+1) = ( 1 - \alpha(k) ) x(k) + \alpha(k) A…
In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several well-known results about complete orders, often with only antisymmetry or…
A fast convergence in a fixed-time of solutions of nonlinear dynamical systems, for which special requirements are satisfied on the derivative of a quadratic function calculated along the solutions of the system, is proposed. The conditions…
A distributed discrete-time algorithm is proposed for multi-agent networks to achieve a common least squares solution of a group of linear equations, in which each agent only knows some of the equations and is only able to receive…
In this article we discuss a possibility to implement a well-known scheme of proof for contraction mapping theorems in a situation, when convergence, families of Cauchy sequences, and contractiveness of mappings are defined axiomatically.…
Temporal networks model a variety of important phenomena involving timed interactions between entities. Existing methods for machine learning on temporal networks generally exhibit at least one of two limitations. First, time is assumed to…
We use a method of Luczak (arXiv:1212.3231) to investigate the equilibrium distribution of a dynamic routing model on a network. In this model, there are $n$ nodes, each pair joined by a link of capacity $C$. For each pair of nodes, calls…
In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.
In this paper, we provide a review on both fundamentals of social networks and latent space modeling. The former discusses important topics related to network description, including vertex characteristics and network structure; whereas the…
We study diffusion in a network which is governed by non-autonomous Kirchhoff conditions at the vertices of the graph. Also the diffusion coefficients may depend on time. We prove at first a result on existence and uniqueness using form…
We establish a fixed point theorem for mappings of square matrices of all sizes which respect the matrix sizes and direct sums of matrices. The conclusions are stronger if such a mapping also respects matrix similarities, i.e., is a…
It turned out that the set of the fixed points is not necessarily the same as the set of the local minima of the energy functional. It depends on the diagonal elements of the connection matrix. The simple method which allows to cut off…
We propose generalizations of a number of standard network models, including the classic random graph, the configuration model, and the stochastic block model, to the case of time-varying networks. We assume that the presence and absence of…
This paper is concerned with the study of the stability of dynamical systems evolving on time scales. We first {formalize the notion of matrix measures on time scales, prove some of their key properties and make use of this notion to study…
We study a non-linear dynamical system on networks inspired by the pitchfork bifurcation normal form. The system has several interesting interpretations: as an interconnection of several pitchfork systems, a gradient dynamical system and…
We study weak and strong solutions of nonlinear non-compact operator equations in abstract spaces of adapted random points. The main result of the paper is similar to Schauder's fixed-point theorem for compact operators. The illustrative…
Small-world networks, known for high local clustering and short path lengths, are a fundamental structure in many real-world systems, including social, biological, and technological networks. We apply the theory of (marked) local…
This work is a comparative study between the existence of fixed point for homomorphisms in a class of binary relationnal systems and the existence of fixed point for nonexpansive mappings in semimetric spaces.
In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…