Pith. sign in

REVIEW

Role of obstacle softness in the diffusive behavior of active Particles

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.16223 v1 pith:LKHXN3CK submitted 2024-10-21 cond-mat.soft physics.bio-ph

Role of obstacle softness in the diffusive behavior of active Particles

classification cond-mat.soft physics.bio-ph
keywords particlesactiveobstaclesbehaviordiffusiondiffusivesoftnessbarriers
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We numerically investigate the diffusive behavior of active Brownian particles in a two-dimensional confined channel filled with soft obstacles, whose softness is controlled by a parameter $K$. Here, active particles are subjected to external bias $F$. Particle diffusion is influenced by entropic barriers that arise due to variations in the shape of the chosen channel geometry. We observed that the interplay between obstacle softness, entropic barriers, and external bias leads to striking transport characteristics of the active particles. For instance, with increasing $F$, the non-linear mobility exhibits non-monotonic behavior, and effective diffusion is greatly enhanced, showing multiple peaks in the presence of soft obstacles. Further, as a function of $K$ and $F$, particles exhibit various diffusive behaviors, e.g., normal diffusion - where the role of obstacles is insignificant, subdiffusion or superdiffusion - where the particles are partially trapped by the obstacles, and particles are ultimately caged by the obstacles. These findings help understand the physical situations wherein active agents diffuse in crowded environments.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.