相关论文: Mixed Hegselmann-Krause Dynamics on infinite graph…

We consider the Hegselmann-Krause dynamics on a one-dimensional torus and provide the first proof of convergence of this system. The proof requires only fairly minor modifications of existing methods for proving convergence in Euclidean…

Motivated by applications to a wide range of assemble-to-order systems, operations scheduling, healthcare systems and collaborative economy applications, we introduce a stochastic matching model on hypergraphs, extending the model in [15]…

Many physical systems -- such as optical waveguide lattices and dense neuronal or vascular networks -- can be modeled by metric graphs, where slender "wires" (edges) support wave or diffusion equations subject to Kirchhoff conditions at the…

We consider two linearly coupled masses, where one mass can have inelastic impacts with a fixed, rigid stop. This leads to the study of a two degree of freedom, piecewise linear, frictionless, unforced, constrained mechanical system. The…

In the present work, we first introduce a general framework for modelling complex multiscale fluids and then focus on the derivation and analysis of a new hybrid continuum-kinetic model. In particular, we combine conservation of mass and…

Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…

Two boundary value problems for the Helmholtz equation in a semi-infinite strip are considered. The main feature of these problems is that, in addition to the function and its normal derivative on the boundary, the functionals of the…

We present a direct proof of asymptotic consensus in the nonlinear Hegselmann-Krause model with transmission-type delay, where the communication weights depend on the particle distance in phase space. Our approach is based on an explicit…

Graph similarity learning (GSL), also referred to as graph matching in many scenarios, is a fundamental problem in computer vision, pattern recognition, and graph learning. However, previous GSL methods assume that graphs are homogeneous…

We present a comparative study of several dynamical systems of increasing complexity, namely, the logistic map with additive noise, one, two and many globally-coupled standard maps, and the Hamiltonian Mean Field model (i.e., the classical…

We consider a multi component mixture of inert gas in the kinetic regime by assuming that the total number of particles of each species remains constant. In this article we shall illustrate our model for the case of two species. To account…

The unified gas kinetic scheme (UGKS) of K. Xu et al. [K. Xu and J.-C. Huang, J. Comput. Phys., 229, pp. 7747--7764, 2010], originally developed for multiscale gas dynamics problems, is applied in this paper to a linear kinetic model of…

Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…

An asymptotic analysis for a system with equation and dynamic boundary condition of Cahn-Hilliard type is carried out as the coefficient of the surface diffusion acting on the phase variable tends to 0, thus obtaining a forward-backward…

Conserving approximations are applied to the attractive Holstein and Hubbard models (on an infinite-dimensional hypercubic lattice). All effects of nonconstant density of states and vertex corrections are taken into account in the…

Given an undirected graph $G$, we define a new object $H_G$, called the mp-chart of $G$, in the max-plus algebra. We use it, together with the max-plus permanent, to describe the complexity of graphs. We show how to compute the mean and the…

In ideal MHD, the magnetic flux is advected by the plasma motion, freezing flux-surfaces into the flow. An MHD equilibrium is reached when the flow relaxes and force balance is achieved. We ask what classes of MHD equilibria can be accessed…

We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all $k \geq 3$, the $k$-CS-transitive such graphs.

In this paper, we introduce a magneto-spectral invariant for finite graphs. This invariant vanishes on trees and is maximized by complete graphs. We compute this invariant for cycles, complete graphs, wheel graphs, hypercubes, complete…

We analyze networked heterogeneous nonlinear systems, with diffusive coupling and interconnected over a generic static directed graph. Due to the network's hetereogeneity, complete synchronization is impossible, in general, but an emergent…