English
Related papers

Related papers: Nonlinear Graphon mean-field systems

200 papers

This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…

Probability · Mathematics 2018-02-13 Bhaswar B. Bhattacharya , Persi Diaconis , Sumit Mukherjee

We consider multi-class systems of interacting nonlinear Hawkes processes modeling several large families of neurons and study their mean field limits. As the total number of neurons goes to infinity we prove that the evolution within each…

Probability · Mathematics 2016-10-04 Susanne Ditlevsen , Eva Löcherbach

Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…

Probability · Mathematics 2020-03-16 Laurent Ménard , Arvind Singh

We introduce a stochastic dynamics related to the measures that arise in harmonic analysis on the infinite-dimensional unitary group. Our dynamics is obtained as a limit of a sequence of natural Markov chains on Gelfand-Tsetlin graph. We…

Probability · Mathematics 2011-08-19 Vadim Gorin

We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend…

Adaptation and Self-Organizing Systems · Physics 2013-11-25 Georgi S. Medvedev

Statistical mechanics describes interaction between particles of a physical system. Particle properties of the system can be modelled with a random field on a lattice and studied at different distance scales using renormalization group…

Probability · Mathematics 2015-04-29 Farida Kachapova , Ilias Kachapov

We consider dynamics driven by interaction energies on graphs. We introduce graph analogues of the continuum nonlocal-interaction equation and interpret them as gradient flows with respect to a graph Wasserstein distance. The particular…

Analysis of PDEs · Mathematics 2021-03-17 Antonio Esposito , Francesco S. Patacchini , André Schlichting , Dejan Slepčev

We study the Fleming-Viot particle process formed by N interacting continuous-time asymmetric random walks on the cycle graph, with uniform killing. We show that this model has a remarkable exact solvability, despite the fact that it is…

Probability · Mathematics 2021-04-13 Josué Corujo

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…

Mathematical Physics · Physics 2025-08-26 Sidney Holden , Geoffrey Vasil

We consider a totally asymmetric exclusion process on the positive half-line. When particles enter in the system according to a Poisson source, Liggett has computed all the limit distributions when the initial distribution has an asymptotic…

Probability · Mathematics 2015-05-13 Nicky Sonigo

We consider an infinite system of particles on the positive real line, initiated from a Poisson point process, which move according to Brownian motion up until the hitting time of a barrier. The barrier increases when it is hit, allowing…

Probability · Mathematics 2025-07-23 Thomas Blore , D. G. M Flynn , Ben Hambly

A particle system is said to be non-exchangeable if two particles cannot be exchanged without modifying the overall dynamics. Because of this property, the classical mean-field approach fails to provide a limit equation when the number of…

Analysis of PDEs · Mathematics 2024-01-17 Nathalie Ayi , Nastassia Pouradier Duteil

We investigate when limits of graphs (graphons) and permutations (permutons) are uniquely determined by finitely many densities of their substructures, i.e., when they are finitely forcible. Every permuton can be associated with a graphon…

Combinatorics · Mathematics 2016-02-23 Roman Glebov , Andrzej Grzesik , Tereza Klimosova , Daniel Kral

The derivation of effective descriptions for interacting many-body systems is an important branch of applied mathematics. We prove a propagation of chaos result for a system of $N$ particles subject to Newtonian time evolution with or…

Mathematical Physics · Physics 2025-05-20 Li Chen , Jinwook Jung , Peter Pickl , Zhenfu Wang

We consider the contact process on a countable-infinite and connected graph of bounded degree. For this process started from the upper invariant measure, we prove certain uniform mixing properties under the assumption that the infection…

Probability · Mathematics 2018-10-17 Stein Andreas Bethuelsen

Graphons are analytic objects associated with convergent sequences of dense graphs. Finitely forcible graphons, i.e., those determined by finitely many subgraph densities, are of particular interest because of their relation to various…

Combinatorics · Mathematics 2018-10-17 Roman Glebov , Tereza Klimosova , Daniel Kral

The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence…

Combinatorics · Mathematics 2011-03-30 Igor Artemenko

Granular flows through pipes show interesting phenomena, e.g. clogging and density waves, 1/f-noise. These things are fairly good studied by computer-experiments, but there is a lack in theoretical and analytical consideration. We introduce…

Statistical Mechanics · Physics 2008-12-03 T. L. Riethmueller , D. Rosenkranz , L. Schimansky-Geier

Photons strongly coupled to material systems constitute a novel system for studying the dynamics of non-equilibrium quantum many-body systems. We give a fully analytical description of the dynamics of photons coupled to a one-dimensional…

Quantum Physics · Physics 2023-01-04 Björn Schrinski , Anders S. Sørensen

Most of the published articles on random motions have been devoted to the study of the telegraph process or its generalizations that describe the random motion in $R^n$ of a single particle in a Markov or semi-Markov medium. However, up to…

Probability · Mathematics 2013-12-30 A. A. Pogorui