David P. Sanders

David P. Sanders

Auto-generated profile, based on publicly available information

David P. Sanders

Departamento de Física Facultad de Ciencias Universidad Nacional Autónoma de México Ciudad Universitaria Ciudad de México 04510 Mexico

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 February 2006 in Physical Review E
Verified
Journal Article
Closed access
PDF file
DSDavid P. Sanders
David P. Sanders
HLHernán Larralde
Hernán Larralde
From extensive numerical simulations, we find that periodic polygonal billiard channels with angles which are irrational multiples of π generically exhibit normal diffusion (linear growth of the mean squared displacement) when they have a finite horizon, i.e., when no particle can travel arbitrarily far without colliding. For the infinite horizon case we present numerical tests showing that the mean squared displacement instead grows asymptotically as tlnt. When the unit cell contains accessible parallel scatterers, however, we always find anomalous super-diffusion, i.e., power-law growth with an exponent larger than 1. This behavior cannot be accounted for quantitatively by a simple continuous-time random walk model. Instead, we argue that anomalous diffusion correlates with the existence of families of propagating periodic orbits. Finally we show that when a configuration with parallel scatterers is approached there is a crossover from normal to anomalous diffusion, with the diffusion coefficient exhibiting a power-law divergence.

30 January 2013 in Physical Review Letters
Verified
Journal Article
Closed access
LGLuca Giuggioli
Luca Giuggioli
SPSebastian Pérez-Becker
Sebastian Pérez-Becker
DSDavid P. Sanders
David P. Sanders
We develop an analytical method to calculate encounter times of two random walkers in one dimension when each individual is segregated in its own spatial domain and shares with its neighbor only a fraction of the available space, finding very good agreement with numerically exact calculations. We model a population of susceptible and infected territorial individuals with this spatial arrangement, and which may transmit an epidemic when they meet. We apply the results on encounter times to determine analytically the macroscopic propagation speed of the epidemic as a function of the microscopic characteristics: the confining geometry, the animal diffusion constant, and the infection transmission probability.

7 April 2019 in Journal of Open Source Software
Verified
Journal Article
Open access
PDF file
LBLuis Benet
Luis Benet
DSDavid Sanders
David Sanders
The purpose of the TaylorSeries.jl package is to provide a framework to exploit Taylor polynomials in one and several variables in the Julia programming language (Bezanson, Edelman, Karpinski, & Shah, 2017). It can be thought of as providing a primitive CAS (computer algebra system), which works numerically and not symbolically. The package allows the user to define dense polynomials p(x) of one variable and p(x) of several variables with a specified maximum degree, and perform operations on them, including powers and composition, as well as series expansions for elementary functions of polynomials, for example exp[p(x)], where techniques of automatic differentiation are used (Haro, Canadell, Figueras, Luque, & Mondelo, 2016; Tucker, 2011). Differentiation and integration are also implemented.

7 August 2014 in Physical Review E
Verified
Journal Article
Open access
GCGiampaolo Cristadoro
Giampaolo Cristadoro
TGThomas Gilbert
Thomas Gilbert
MLMarco Lenci
Marco Lenci
DSDavid P. Sanders
David P. Sanders
We perform numerical measurements of the moments of the position of a tracer particle in a two-dimensional periodic billiard model (Lorentz gas) with infinite corridors. This model is known to exhibit a weak form of superdiffusion, in the sense that there is a logarithmic correction to the linear growth in time of the mean-squared displacement. We show numerically that this expected asymptotic behavior is easily overwhelmed by the subleading linear growth throughout the time range accessible to numerical simulations. We compare our simulations to analytical results for the variance of the anomalously rescaled limiting normal distributions.

28 May 2009 in Nonlinearity
Verified
Journal Article
Open access
AAAubin Arroyo
Aubin Arroyo
RMRoberto Markarian
Roberto Markarian
DSDavid P Sanders
David P Sanders
We study the dynamics of billiard models with a modified collision rule: the outgoing angle from a collision is a uniform contraction, by a factor lambda, of the incident angle. These pinball billiards interpolate between a one-dimensional map when lambda=0 and the classical Hamiltonian case of elastic collisions when lambda=1. For all lambda<1, the dynamics is dissipative, and thus gives rise to attractors, which may be periodic or chaotic. Motivated by recent rigorous results of Markarian, Pujals and Sambarino, we numerically investigate and characterise the bifurcations of the resulting attractors as the contraction parameter is varied. Some billiards exhibit only periodic attractors, some only chaotic attractors, and others have coexistence of the two types.

16 April 2021 in Physical Review E
Verified
Journal Article
Closed access
PDF file
ARAlejandro Pérez Riascos
Alejandro Pérez Riascos
DSDavid P. Sanders
David P. Sanders
We introduce a general approach for the study of the collective dynamics of noninteracting random walkers on connected networks. We analyze the movement of R independent (Markovian) walkers, each defined by its own transition matrix. By using the eigenvalues and eigenvectors of the R independent transition matrices, we deduce analytical expressions for the collective stationary distribution and the average number of steps needed by the random walkers to start in a particular configuration and reach specific nodes the first time (mean first-passage times), as well as global times that characterize the global activity. We apply these results to the study of mean first-encounter times for local and nonlocal random walk strategies on different types of networks, with both synchronous and asynchronous motion.