We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/Local well-posedness of the generalized Cucker-Smale model with singular kernels
PeriodicalsComputer Science & Information Technology

Local well-posedness of the generalized Cucker-Smale model with singular kernels

Checking your access to this record.

Abstract & Overview

In this paper, we study the local well-posedness of two types of generalized kinetic Cucker-Smale (in short C-S) equations. We consider two different communication weights in space with nonlinear coupling of the velocities, v | v | β − 2 for β > 3-d/2, where singularities are present either in space or in velocity. For the singular communication weight in space, ψ1(x) = 1 / | x | α with α ∈ (0,d − 1), d ≥ 1, we consider smooth velocity coupling, β ≥ 2. For the regular one, we assume ψ2(x) ∈ (Lloc∞ ∩ Liploc) (Rd) but with a singular velocity coupling β ∈ (3-d/2, 2). We also present the various dynamics of the generalized C-S particle system with the communication weights ψi,i = 1,2 when β ∈ (0,3). We provide sufficient conditions of the initial data depending on the exponent β leading to finite-time alignment or to no collisions between particles in finite time.

Cite this record

José Antonio Carrillo, Young-Pil Choi, Maxime Hauray (2014). Local well-posedness of the generalized Cucker-Smale model with singular kernels. ESAIM Proceedings and Surveys, 47, 17–35. https://doi.org/10.1051/proc/201447002

Copy in another style

Carrillo, J. A., Choi, Y., & Hauray, M. (2014). Local well-posedness of the generalized Cucker-Smale model with singular kernels. ESAIM Proceedings and Surveys, 47, 17–35. https://doi.org/10.1051/proc/201447002
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.