Andrea Bertozzi University of California Los Angeles Thanks to contributions from Laura Smith, Rachel Danson, George Tita, Jeff Brantingham.

Slides:



Advertisements
Similar presentations
FMRI Methods Lecture 10 – Using natural stimuli. Reductionism Reducing complex things into simpler components Explaining the whole as a sum of its parts.
Advertisements

P.W. Terry K.W. Smith University of Wisconsin-Madison Outline
Sampling Research Questions
Statistical perturbation theory for spectral clustering Harrachov, 2007 A. Spence and Z. Stoyanov.
CSCE643: Computer Vision Bayesian Tracking & Particle Filtering Jinxiang Chai Some slides from Stephen Roth.
Andrea Bertozzi University of California Los Angeles Thanks to contributions from Martin Short, George Mohler, Jeff Brantingham, and Erik Lewis.
Self-propelled motion of a fluid droplet under chemical reaction Shunsuke Yabunaka 1, Takao Ohta 1, Natsuhiko Yoshinaga 2 1)Department of physics, Kyoto.
School of Information University of Michigan Network resilience Lecture 20.
Computer vision: models, learning and inference
Random walk models in biology
STAT 497 APPLIED TIME SERIES ANALYSIS
Corporate Banking and Investment Mathematical issues with volatility modelling Marek Musiela BNP Paribas 25th May 2005.
Jonathan R. Potts, Luca Giuggioli, Steve Harris, Bristol Centre for Complexity Sciences & School of Biological Sciences, University of Bristol. 20 September.
Solving Dynamic Stochastic General Equilibrium Models Eric Zwick ’07 Swarthmore College, Department of Mathematics & Statistics References Boyd and Smith.
Introduction to Sampling based inference and MCMC Ata Kaban School of Computer Science The University of Birmingham.
Dr. Chris L. S. Coryn Spring 2012
Blogosphere  What is blogosphere?  Why do we need to study Blog-space or Blogosphere?
Applications of Wavelet Transform and Artificial Neural Network in Digital Signal Detection for Indoor Optical Wireless Communication Sujan Rajbhandari.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (II) 11th Week
Given the Uncertainty Principle, how do you write an equation of motion for a particle? First, remember that a particle is only a particle sort of, and.
Review of Probability and Random Processes
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
Physics of fusion power
Chapter 7: The Normal Probability Distribution
QBM117 - Business Statistics Estimating the population mean , when the population variance  2, is unknown.
Human Travel Patterns Albert-László Barabási Center for Complex Networks Research, Northeastern U. Department of Medicine, Harvard U. BarabasiLab.com.
A Statistical Model of Criminal Behavior M.B. Short, M.R. D’Orsogna, V.B. Pasour, G.E. Tita, P.J. Brantingham, A.L. Bertozzi, L.B. Chayez Maria Pavlovskaia.
Swarm Computing Applications in Software Engineering By Chaitanya.
Probabilistic Robotics Bayes Filter Implementations Gaussian filters.
Probabilistic Robotics Bayes Filter Implementations.
Presentation: Random walk models in biology E.A.Codling et al. Journal of The Royal Society Interface R EVIEW March 2008 Random walk models in biology.
Chapter 7 Sample Variability. Those who jump off a bridge in Paris are in Seine. A backward poet writes inverse. A man's home is his castle, in a manor.
Copyright © 2012, SAS Institute Inc. All rights reserved. ANALYTICS IN BIG DATA ERA ANALYTICS TECHNOLOGY AND ARCHITECTURE TO MANAGE VELOCITY AND VARIETY,
Chapter 5 Parameter estimation. What is sample inference? Distinguish between managerial & financial accounting. Understand how managers can use accounting.
Lévy copulas: Basic ideas and a new estimation method J L van Velsen, EC Modelling, ABN Amro TopQuants, November 2013.
Evacuaiton Problem: Group Search on the Line
Introduction: Lattice Boltzmann Method for Non-fluid Applications Ye Zhao.
Anomalous Diffusion, Fractional Differential Equations, High Order Discretization Schemes Weihua Deng Lanzhou University
Chapter 15 – CTRW Continuous Time Random Walks. Random Walks So far we have been looking at random walks with the following Langevin equation  is a.
Weak Solutions of Kinematic Aggregation Equations Andrea Bertozzi Department of Mathematics UCLA Thanks to Thomas Laurent for contributing to the slides.
© 2009 Ilya O. Ryzhov 1 © 2008 Warren B. Powell 1. Optimal Learning On A Graph INFORMS Annual Meeting October 11, 2009 Ilya O. Ryzhov Warren Powell Princeton.
Lecture 10: Anomalous diffusion Outline: generalized diffusion equation subdiffusion superdiffusion fractional Wiener process.
MA354 An Introduction to Math Models (more or less corresponding to 1.0 in your book)
1/18/2016Atomic Scale Simulation1 Definition of Simulation What is a simulation? –It has an internal state “S” In classical mechanics, the state = positions.
Chernoshtanov I.S., Tsidulko Yu.A.
Lab for Remote Sensing Hydrology and Spatial Modeling Dept of Bioenvironmental Systems Engineering National Taiwan University 1/45 GEOSTATISTICS INTRODUCTION.
Discrete and Continuum Models of Crime Pattern Formation
ECE-7000: Nonlinear Dynamical Systems 2. Linear tools and general considerations 2.1 Stationarity and sampling - In principle, the more a scientific measurement.
The Unscented Particle Filter 2000/09/29 이 시은. Introduction Filtering –estimate the states(parameters or hidden variable) as a set of observations becomes.
MA354 Math Modeling Introduction. Outline A. Three Course Objectives 1. Model literacy: understanding a typical model description 2. Model Analysis 3.
1 Review of Probability and Random Processes. 2 Importance of Random Processes Random variables and processes talk about quantities and signals which.
Chapter 1 Key Issue 3 Why Are Different Places Similar?
Finding Clusters within a Class to Improve Classification Accuracy Literature Survey Yong Jae Lee 3/6/08.
6/11/2016Atomic Scale Simulation1 Definition of Simulation What is a simulation? –It has an internal state “S” In classical mechanics, the state = positions.
Scaling mobility patterns and collective movements: deterministic walks in lattice Han Xiao-Pu Zhou Tao Wang Bing-Hong University of Science and Technology.
Bounded Solutions of Kinematic Aggregation Equations Andrea Bertozzi Department of Mathematics, UCLA Thanks to support from ARO, NSF, and ONR and to contributions.
Numerical Solutions to the Diffusion Equation
Introduction to Sampling based inference and MCMC
What is cognitive psychology?
Theory of Capital Markets
An Investigation of Market Dynamics and Wealth Distributions
Analytics and OR DP- summary.
Stochastic Simulation of thymic Selection
Chapter 4 – Part 3.
Filtering and State Estimation: Basic Concepts
Special Topics in Geo-Business Data Analysis
Quantum Mechanics.
Ariel Lubelski, Joseph Klafter  Biophysical Journal 
Intrinsically Motivated Collective Motion
Lecturer Dr. Veronika Alhanaqtah
Presentation transcript:

Andrea Bertozzi University of California Los Angeles Thanks to contributions from Laura Smith, Rachel Danson, George Tita, Jeff Brantingham.

Rivalry network among 29 street gangs in Hollenbeck, Los Angeles Tita et al. (2003)

Movie by Alethea Barbaro.

From Metzler and Klafter, 2000.

 PDF for Brownian walk in 1D:  Using Taylor expansions in space and time and passing to the limit one gets  Propagator:

 Fourier transform

 Fickian diffusion has certain statistics, in particular ~Kt, characteristic of Brownian motion.  Sub-diffusion has different scaling ~K a t a and occurs in many systems. This is the case where jump lengths are the same but one can have a waiting time between jumps that has a long tail distribution.  Levy process occurs when the jump length is taken from a long-tailed distribution however the waiting times are normally distributed. In this case the variance is infinite and one has to look to other statistics to define the Levy behavior.

 Brownian(le ft)  Levy (right)

 Length of jump as well as waiting time between jumps are drawn from PDF.  Levy has jump length PDF   >0  Propagator satisfies the nonlocal PDE  Where the nonlocal operator is easily expressed in terms of its Fourier transform:

 Searching for unknown target locations  Efficiency of search can be defined as number of targets visited compared to typical distance travelled.  For destructive searches (crime applications) one takes  as close to zero as possible.  For non-destructive searches the optimal  is close to 1, with a margin that behaves like  Here is avg distance between targets and r v is the vision distance.  Searchin g for unknown target locations  Efficiency of search can be defined as number of targets visited compare d to typical distance travelled.  For destructi ve searches (typical in crime applicatio ns) one takes m as close to 1 as possible.  For non- destructi ve searches the optimal m is close to 2, with a margin that behaves like G.M. Viswanathan et al, Nature 401, 911 (1999).

 Nonlinear diffusion – used sometimes in population dynamics.  Assume a motion in which the speed or jump length is a function of the local density.  Can be used to model anti-crowding in which dispersal is not needed if the group is sparse.  Satisfies a PDE W t = (W 1+a ) xx where a>0.  The propagator function is the well-known Barenblatt solution it has compact support and finite speed of propagation of the support.  This model arises in the contexts of animal populations such as herds or flocks.

 Continuum modeling with Levy processes applied to crime.  Dynamics on networks linked to spatial motion of criminals.  Stochastic models vs. deterministic – both are in the developmental stage.  Analysis of real data, inference from real data vs. agent based simulations.

 M. Bradonjic, A. Hagberg, A. Percus. Giant Component and Connectivity in Geographical Threshold Graphs (2007).  M. Egesdal, C. Fathauer, K. Louie, J. Neumann, Statistical Modeling of Gang Violence in Los Angeles, SIURO,  S. R. Jammalamadaka, A. Sengupta. Topics in Circular Statistics. World Scientific. Series on Multivariate Analysis Vol. 5.  S. Radil, C. Flint, and G. Tita,“Spatializing Social Networks: Using Social Network Analysis to Investigate Geographies of Gang Rivalry, Territoriality, and Violence in Los Angeles.”  Brantingham, P.J. and G. Tita. Offender Mobility and Crime Pattern Formation from First Principles. In Artificial Crime Analysis Systems: Using Computer Simulations and Geographic Information Systems, edite by L. Liu and J. Eck. pp Hershey, PA: Idea Press,  R. Metzler and J. Klafter, Physics Reports 339, p. 1-77,  G.M. Viswanathan et al, Nature 401, 911 (1999).  J. Bouchard and A. Georges, Physics Reports 195, p ,  C.M. Topaz, ALB, and M.A. Lewis, Bull.. of Math. Bio., 68(7), 2006.