Related papers: On evolution PDEs on co-evolving graphs
It is well known that fixed point problems of contractive-type mappings defined on cone metric spaces over Banach algebras are not equivalent to those in usual metric spaces (see [3] and [10]). In this framework, the novelty of the present…
Time dependence is a universal phenomenon in nature, and a variety of mathematical models in terms of dynamical systems have been developed to understand the time-dependent behavior of real-world problems. Originally constructed to analyze…
We propose numerical schemes for the approximate solution of problems defined on the edges of a one-dimensional graph. In particular, we consider linear transport and a drift-diffusion equations, and discretize them by extending Finite…
The article deals with the description of the statistical behavior of Gaussian packets on a metric graph. Semiclassical asymptotics of solutions of the Cauchy problem for the Schr\"{o}dinger equation with initial data concentrated in 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…
In this paper, we are devoted to consider the periodic problem for the impulsive evolution equations with delay in Banach space. By using operator semigroups theory and fixed point theorem, we establish some new existence theorems of…
In this paper, we study the stability result of a well-known theorem of Bondy. We prove that for any 2-connected non-hamiltonian graph, if every vertex except for at most one vertex has degree at least $k$, then it contains a cycle of…
This paper is concerned with a fluidodynamic model for traffic flow. More precisely, we consider a single conservation law, deduced from conservation of the number of cars, defined on a road network that is a collection of roads with…
We propose an extension of the Contextual Graph Markov Model, a deep and probabilistic machine learning model for graphs, to model the distribution of edge features. Our approach is architectural, as we introduce an additional Bayesian…
The problem of finding the maximum-weight, planar subgraph of a finite, simple graph with nonnegative real edge weights is well known in industrial and electrical engineering, systems biology, sociology and finance. As the problem is known…
Social networks have become an inseparable part of human life and processing them in an efficient manner is a top priority in the study of networks. These networks are highly dynamic and they are growing incessantly. Inspired by the concept…
We propose the convergent graph solver (CGS), a deep learning method that learns iterative mappings to predict the properties of a graph system at its stationary state (fixed point) with guaranteed convergence. CGS systematically computes…
In this study, we take a systematic look at the unrealised part of public transport networks (PTNs) with functional connections. We consider their complement graphs and study their structure. The complement graph $\bar G$ of an unweighted…
We introduce the notion of globally updating evolution for a class of weighted networks, in which the weight of a link is characterized by the amount of data packet transport flowing through it. By noting that the packet transport over the…
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…
Unique continuation properties for a class of evolution equations defined on Banach spaces are considered from two different point of views: the first one is based on the existence of conserved quantities, which very often translates into…
In this paper, we introduce a class of backward stochastic equations (BSEs) that extend classical BSDEs and include many interesting examples of generalized BSDEs as well as semimartingale backward equations. We show that a BSE can be…
In this paper, we study stability properties of nonuniform hyperbolicity for evolution processes associated with differential equations in Banach spaces. We prove a robustness result of nonuniform hyperbolicity for linear evolution…
Edge connectivity and vertex connectivity are two fundamental concepts in graph theory. Although by now there is a good understanding of the structure of graphs based on their edge connectivity, our knowledge in the case of vertex…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…