Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 24 min ago
PreprintarXiv licencearXiv

On kinetic alignment models with rough communication kernel

  • Roman Shvydkoy
Open at sourcePDFDOICite

Abstract

We prove the weak maximum principle and the Cucker-Smale flocking theorem for a general class of kinetic alignment models with rough communication kernels. This includes the classical Cucker-Smale and Motsch-Tadmor systems with defining kernel ϕ assumed to be merely continuous or even ϕ∈ L∞ for solutions in the Lebesgue class f∈ L1. For such models the characteristic flow-map is not well-defined and therefore the classical approaches of Cucker-Smale \cite{CS2007a,CS2007b} or Ha-Liu-Tadmor \cite{HL2009,HT2008} break down. We develop a new method adopted to rough settings based on Ambrossio's probabilistic representation of solutions and construction of dynamic barriers. All proofs are performed in the framework of so called bounded communication protocols, a non-smooth variant of regular protocols introduced in \cite{Shv-CPAM, Shv-EA} and representing a broad range of models of collective dynamics.

Related

  1. An Aleksandrov estimate for kinetic equations with rough coefficients
    Amélie Loher, Connor Mooney, Clément Mouhot +3
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  2. EXISTENCE AND UPPER BOUNDS OF FUNDAMENTAL SOLUTIONS TO KINETIC EQUATIONS WITH ROUGH NON-LOCAL DIFFUSION
    Pascal Auscher, Lukas Niebel
    HALPreprintCC BY 4.0Full textAnalysis & PDEsHALarXiv
  3. Signature Kernel and Schwinger-Dyson Kernel Equations as Two-Parameter Rough Differential Equations
    Thomas Cass, Dan Crisan, Andrea Iannucci +1
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingProbabilityarXiv
  4. Rough Axisymmetric Euler Dynamics: Global Energy Compactness and Kinetic Passage Across Regularity Breakdown
    Gi-Chan Bae, Hongxu Chen, Chanwoo Kim
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  5. Isothermal hydrodynamic limit for kinetic flocking models with nonlinear velocity alignment
    Roman Shvydkoy, Changhui Tan
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv

Cite

BibTeXRIS
BibTeX
@misc{shvydkoy2026kinetic,
  title = {{On kinetic alignment models with rough communication kernel}},
  author = {Roman Shvydkoy},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.41047},
  eprint = {2610.41047},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.41047},
}
RIS
TY  - UNPB
TI  - On kinetic alignment models with rough communication kernel
AU  - Roman Shvydkoy
PY  - 2026
DA  - 2026/10/29
PB  - arXiv
DO  - 10.48550/arxiv.2610.41047
UR  - https://arxiv.org/abs/2610.41047
AB  - We prove the weak maximum principle and the Cucker-Smale flocking theorem for a general class of kinetic alignment models with rough communication kernels. This includes the classical Cucker-Smale and Motsch-Tadmor systems with defining kernel ϕ assumed to be merely continuous or even ϕ∈ L^∞ for solutions in the Lebesgue class f∈ L^1. For such models the characteristic flow-map is not well-defined and therefore the classical approaches of Cucker-Smale \cite{CS2007a,CS2007b} or Ha-Liu-Tadmor \cite{HL2009,HT2008} break down. We develop a new method adopted to rough settings based on Ambrossio's probabilistic representation of solutions and construction of dynamic barriers. All proofs are performed in the framework of so called bounded communication protocols, a non-smooth variant of regular protocols introduced in \cite{Shv-CPAM, Shv-EA} and representing a broad range of models of collective dynamics.
ER  -