David P. Sanders
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
David P. Sanders has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Hernán Larralde
UNAM
11 shared publications - Thomas Gilbert
Center for Nonlinear Phenomena and Complex Systems, Université Libre de Bruxelles, C P 231, Campus Plaine, B-1050 Brussels, Belgium
10 shared publications Thomas Gilbert
Universite Libre de Bruxelles
8 shared publications- Giampaolo Cristadoro
Dipartimento di Matematica e Applicazioni Università di Milano -Bicocca Via Roberto Cozzi 55 20125 Milano Italy
6 shared publications - Marco Lenci
Dipartimento di Matematica Università di Bologna Piazza di porta San Donato 5 40126 Bologna Italy
6 shared publications - Atahualpa Solórzano Kraemer
Departamento de Física, Facultad de Ciencias, Universidad Nacional Autónoma de México, Mexico City, Mexico
5 shared publications
Latest Publications
- 16 April 2021
- Published by American Physical Society (APS) in Physical Review E
- Vol. 103 (4) , 042312
Mean encounter times for multiple random walkers on networks
We introduce a general approach for the study of the collective dynamics of noninteracting random walkers on connected networks. We analyze the movement of independent (Markovian) walkers, each defined by its own transition matrix. By using the eigenvalues and eigenvectors of the 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.- 16 April 2021
- Published by American Physical Society (APS) in Physical Review E
- Vol. 103 (4) , 042312
Mean encounter times for multiple random walkers on networks
We introduce a general approach for the study of the collective dynamics of noninteracting random walkers on connected networks. We analyze the movement of independent (Markovian) walkers, each defined by its own transition matrix. By using the eigenvalues and eigenvectors of the 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.- Open Access
Mean encounter times for multiple random walkers on networks
We introduce a general approach for the study of the collective dynamics of non-interacting 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 non-local random walk strategies on different types of networks, with both synchronous and asynchronous motion.Open AccessMean encounter times for multiple random walkers on networks
We introduce a general approach for the study of the collective dynamics of non-interacting 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 non-local random walk strategies on different types of networks, with both synchronous and asynchronous motion. - Open Access
- 7 April 2019
- Published by The Open Journal in Journal of Open Source Software
- Vol. 4 (36)
TaylorSeries.jl: Taylor expansions in one and several variables in Julia
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 April 2019
- Published by The Open Journal in Journal of Open Source Software
- Vol. 4 (36)
Open AccessTaylorSeries.jl: Taylor expansions in one and several variables in Julia
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.
- 1 May 2018
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 28 (5) , 053113
Monte Carlo sampling in diffusive dynamical systems
We introduce a Monte Carlo algorithm to efficiently compute transport properties of chaotic dynamical systems. Our method exploits the importance sampling technique that favors trajectories in the tail of the distribution of displacements, where deviations from a diffusive process are most prominent. We search for initial conditions using a proposal that correlates states in the Markov chain constructed via a Metropolis-Hastings algorithm. We show that our method outperforms the direct sampling method and also Metropolis-Hastings methods with alternative proposals. We test our general method through numerical simulations in 1D (box-map) and 2D (Lorentz gas) systems.
- 1 May 2018
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 28 (5) , 053113
Monte Carlo sampling in diffusive dynamical systems
We introduce a Monte Carlo algorithm to efficiently compute transport properties of chaotic dynamical systems. Our method exploits the importance sampling technique that favors trajectories in the tail of the distribution of displacements, where deviations from a diffusive process are most prominent. We search for initial conditions using a proposal that correlates states in the Markov chain constructed via a Metropolis-Hastings algorithm. We show that our method outperforms the direct sampling method and also Metropolis-Hastings methods with alternative proposals. We test our general method through numerical simulations in 1D (box-map) and 2D (Lorentz gas) systems.
- Open Access
Monte Carlo sampling in diffusive dynamical systems
We introduce a Monte Carlo algorithm to efficiently compute transport properties of chaotic dynamical systems. Our method exploits the importance sampling technique that favors trajectories in the tail of the distribution of displacements, where deviations from a diffusive process are most prominent. We search for initial conditions using a proposal that correlates states in the Markov chain constructed via a Metropolis-Hastings algorithm. We show that our method outperforms the direct sampling method and also Metropolis-Hastings methods with alternative proposals. We test our general method through numerical simulations in 1D (box-map) and 2D (Lorentz gas) systems.
Open AccessMonte Carlo sampling in diffusive dynamical systems
We introduce a Monte Carlo algorithm to efficiently compute transport properties of chaotic dynamical systems. Our method exploits the importance sampling technique that favors trajectories in the tail of the distribution of displacements, where deviations from a diffusive process are most prominent. We search for initial conditions using a proposal that correlates states in the Markov chain constructed via a Metropolis-Hastings algorithm. We show that our method outperforms the direct sampling method and also Metropolis-Hastings methods with alternative proposals. We test our general method through numerical simulations in 1D (box-map) and 2D (Lorentz gas) systems.
- 29 March 2017
- Published by ICHB PAS Poznan Supercomputing and Networking Center in Computational Methods in Science and Technology
- Vol. 23 (1) , 11-18
Ergodicity of One-dimensional Systems Coupled to the Logistic Thermostat
- 29 March 2017
- Published by ICHB PAS Poznan Supercomputing and Networking Center in Computational Methods in Science and Technology
- Vol. 23 (1) , 11-18
Ergodicity of One-dimensional Systems Coupled to the Logistic Thermostat
- Open Access
Ergodicity of one-dimensional systems coupled to the logistic thermostat
We analyze the ergodicity of three one-dimensional Hamiltonian systems, with harmonic, quartic and Mexican-hat potentials, coupled to the logistic thermostat. As criteria for ergodicity we employ: the independence of the Lyapunov spectrum with respect to initial conditions; the absence of visual "holes" in two-dimensional Poincar\'e sections; the agreement between the histograms in each variable and the theoretical marginal distributions; and the convergence of the global joint distribution to the theoretical one, as measured by the Hellinger distance. Taking a large number of random initial conditions, for certain parameter values of the thermostat we find no indication of regular trajectories and show that the time distribution converges to the ensemble one for an arbitrarily long trajectory for all the systems considered. Our results thus provide a robust numerical indication that the logistic thermostat can serve as a single one-parameter thermostat for stiff one-dimensional systems.
Open AccessErgodicity of one-dimensional systems coupled to the logistic thermostat
We analyze the ergodicity of three one-dimensional Hamiltonian systems, with harmonic, quartic and Mexican-hat potentials, coupled to the logistic thermostat. As criteria for ergodicity we employ: the independence of the Lyapunov spectrum with respect to initial conditions; the absence of visual "holes" in two-dimensional Poincar\'e sections; the agreement between the histograms in each variable and the theoretical marginal distributions; and the convergence of the global joint distribution to the theoretical one, as measured by the Hellinger distance. Taking a large number of random initial conditions, for certain parameter values of the thermostat we find no indication of regular trajectories and show that the time distribution converges to the ensemble one for an arbitrarily long trajectory for all the systems considered. Our results thus provide a robust numerical indication that the logistic thermostat can serve as a single one-parameter thermostat for stiff one-dimensional systems.
- Open Access
Geometric integrator for simulations in the canonical ensemble
In this work we introduce a geometric integrator for molecular dynamics simulations of physical systems in the canonical ensemble. In particular, we consider the equations arising from the so-called density dynamics algorithm with any possible type of thermostat and provide an integrator that preserves the invariant distribution. Our integrator thus constitutes a unified framework that allows the study and comparison of different thermostats and of their influence on the equilibrium and non-equilibrium (thermo-)dynamic properties of the system. To show the validity and the generality of the integrator, we implement it with a second-order, time-reversible method and apply it to the simulation of a Lennard-Jones system with three different thermostats, obtaining good conservation of the geometrical properties and recovering the expected thermodynamic results.
Open AccessGeometric integrator for simulations in the canonical ensemble
In this work we introduce a geometric integrator for molecular dynamics simulations of physical systems in the canonical ensemble. In particular, we consider the equations arising from the so-called density dynamics algorithm with any possible type of thermostat and provide an integrator that preserves the invariant distribution. Our integrator thus constitutes a unified framework that allows the study and comparison of different thermostats and of their influence on the equilibrium and non-equilibrium (thermo-)dynamic properties of the system. To show the validity and the generality of the integrator, we implement it with a second-order, time-reversible method and apply it to the simulation of a Lennard-Jones system with three different thermostats, obtaining good conservation of the geometrical properties and recovering the expected thermodynamic results.
- Open Access
Efficient algorithms for general periodic Lorentz gases in two and three dimensions
We present efficient algorithms to calculate trajectories for periodic Lorentz gases consisting of square lattices of circular obstacles in two dimensions, and simple cubic lattices of spheres in three dimensions; these become increasingly efficient as the radius of the obstacles tends to 0, the so-called Boltzmann-Grad limit. The 2D algorithm applies continued fractions to obtain the exact disc with which a particle will collide at each step, instead of using periodic boundary conditions as in the classical algorithm. The 3D version incorporates the 2D algorithm by projecting to the three coordinate planes. As an application, we calculate distributions of free path lengths close to the Boltzmann-Grad limit for certain Lorentz gases. We also show how the algorithms may be applied to deal with general crystal lattices.
Open AccessEfficient algorithms for general periodic Lorentz gases in two and three dimensions
We present efficient algorithms to calculate trajectories for periodic Lorentz gases consisting of square lattices of circular obstacles in two dimensions, and simple cubic lattices of spheres in three dimensions; these become increasingly efficient as the radius of the obstacles tends to 0, the so-called Boltzmann-Grad limit. The 2D algorithm applies continued fractions to obtain the exact disc with which a particle will collide at each step, instead of using periodic boundary conditions as in the classical algorithm. The 3D version incorporates the 2D algorithm by projecting to the three coordinate planes. As an application, we calculate distributions of free path lengths close to the Boltzmann-Grad limit for certain Lorentz gases. We also show how the algorithms may be applied to deal with general crystal lattices.
- 1 May 2015
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2015 (5) , P05012
Lévy walks on lattices as multi-state processes
Continuous-time random walks combining diffusive scattering and ballistic propagation on lattices model a class of Lévy walks. The assumption that transitions in the scattering phase occur with exponentially-distributed waiting times leads to a description of the process in terms of multiple states, whose distributions evolve according to a set of delay differential equations, amenable to analytic treatment. We obtain an exact expression of the mean squared displacement associated with such processes and discuss the emergence of asymptotic scaling laws in regimes of diffusive and superdiffusive (subballistic) transport, emphasizing, in the latter case, the effect of initial conditions on the transport coefficients. Of particular interest is the case of rare ballistic propagation, in which a regime of superdiffusion may lurk underneath one of normal diffusion.
- 1 May 2015
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2015 (5) , P05012
Lévy walks on lattices as multi-state processes
Continuous-time random walks combining diffusive scattering and ballistic propagation on lattices model a class of Lévy walks. The assumption that transitions in the scattering phase occur with exponentially-distributed waiting times leads to a description of the process in terms of multiple states, whose distributions evolve according to a set of delay differential equations, amenable to analytic treatment. We obtain an exact expression of the mean squared displacement associated with such processes and discuss the emergence of asymptotic scaling laws in regimes of diffusive and superdiffusive (subballistic) transport, emphasizing, in the latter case, the effect of initial conditions on the transport coefficients. Of particular interest is the case of rare ballistic propagation, in which a regime of superdiffusion may lurk underneath one of normal diffusion.