Robert ghrist professor of mathematics & electrical/systems engineering the university of pennsylvania topological methods for networks infodynets kickoff.

Slides:



Advertisements
Similar presentations
Alpha Shapes. Used for Shape Modelling Creates shapes out of point sets Gives a hierarchy of shapes. Has been used for detecting pockets in proteins.
Advertisements

Euler calculus for data focm : budapest : july : 2011 robert ghrist andrea mitchell university professor of mathematics & electrical/systems engineering.
8.2 Kernel And Range.
euler calculus & data robert ghrist university of pennsylvania
Lect.3 Modeling in The Time Domain Basil Hamed
Yang Yang, Miao Jin, Hongyi Wu Presenter: Buri Ban The Center for Advanced Computer Studies (CACS) University of Louisiana at Lafayette 3D Surface Localization.
Kick-off Meeting, July 28, 2008 ONR MURI: NexGeNetSci Distributed Coordination, Consensus, and Coverage in Networked Dynamic Systems Ali Jadbabaie Electrical.
Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks Xiaorui Wang, Guoliang Xing, Yuanfang Zhang*, Chenyang Lu, Robert Pless,
Persistent Homology and Sensor Networks Persistent homology motivated by an application to sensor nets.
Omer Bobrowski Mathematics Department Duke University Joint work with Sayan Mukherjee 6/19/13.
Matthew L. WrightMatthew L. Wright Institute for Mathematics and its ApplicationsInstitute for Mathematics and its Applications University of MinnesotaUniversity.
Computational Geometry II Brian Chen Rice University Computer Science.
Beyond Trilateration: On the Localizability of Wireless Ad Hoc Networks Reported by: 莫斌.
Basic Feasible Solutions: Recap MS&E 211. WILL FOLLOW A CELEBRATED INTELLECTUAL TEACHING TRADITION.
CHAPTER 5: CONVEX POLYTOPES Anastasiya Yeremenko 1.
Topological Data Analysis
CWIT Robust Entropy Rate for Uncertain Sources: Applications to Communication and Control Systems Charalambos D. Charalambous Dept. of Electrical.
Delaunay Triangulation Computational Geometry, WS 2006/07 Lecture 11 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Based on the paper by M. Farber and D. Schütz Presented by Yair.
Compressed Sensing for Networked Information Processing Reza Malek-Madani, 311/ Computational Analysis Don Wagner, 311/ Resource Optimization Tristan Nguyen,
Algorithmic Classification of Resonant Orbits Using Persistent Homology in Poincaré Sections Thomas Coffee.
Universidad de La Habana Lectures 5 & 6 : Difference Equations Kurt Helmes 22 nd September - 2nd October, 2008.
Lecture 10 : Delaunay Triangulation Computational Geometry Prof. Dr. Th. Ottmann 1 Overview Motivation. Triangulation of Planar Point Sets. Definition.
ONR MURI: NexGeNetSci From Consensus to Social Learning in Complex Networks Ali Jadbabaie Skirkanich Associate Professor of innovation Electrical & Systems.
EXPANDER GRAPHS Properties & Applications. Things to cover ! Definitions Properties Combinatorial, Spectral properties Constructions “Explicit” constructions.
Lecture 8 : Arrangements and Duality Computational Geometry Prof. Dr. Th. Ottmann 1 Duality and Arrangements Duality between lines and points Computing.
CS Subdivision I: The Univariate Setting Peter Schröder.
Exposure In Wireless Ad-Hoc Sensor Networks S. Megerian, F. Koushanfar, G. Qu, G. Veltri, M. Potkonjak ACM SIG MOBILE 2001 (Mobicom) Journal version: S.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Sistem Kontrol I Kuliah II : Transformasi Laplace Imron Rosyadi, ST 1.
Lifetime and Coverage Guarantees Through Distributed Coordinate- Free Sensor Activation ACM MOBICOM 2009.
A Delaunay Triangulation Architecture Supporting Churn and User Mobility in MMVEs Mohsen Ghaffari, Behnoosh Hariri and Shervin Shirmohammadi Advanced Communications.
Scalable and Fully Distributed Localization With Mere Connectivity.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Robert ghrist university of pennsylvania depts. of mathematics & electrical/systems engineering euler calculus & data machine learning summer school :
Chapter 3 mathematical Modeling of Dynamic Systems
Integration of 3-body encounter. Figure taken from
MATH4248 Weeks Topics: review of rigid body motion, Legendre transformations, derivation of Hamilton’s equations of motion, phase space and Liouville’s.
Ad Hoc and Sensor Networks – Roger Wattenhofer –3/1Ad Hoc and Sensor Networks – Roger Wattenhofer – Topology Control Chapter 3 TexPoint fonts used in EMF.
Stable, Circulation- Preserving, Simplicial Fluids Sharif Elcott, Yiying Tong, Eva Kanso, Peter Schröder, and Mathieu Desbrun.
Advanced Higher Mathematics Methods in Algebra and Calculus Geometry, Proof and Systems of Equations Applications of Algebra and Calculus AH.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Precise and Approximate Representation of Numbers 1.The Cartesian-Lagrangian representation of numbers. 2.The homotopic representation of numbers 3.Loops.
Dr. Wang Xingbo Fall , 2005 Mathematical & Mechanical Method in Mechanical Engineering.
Positioning in Ad-Hoc Networks - A Problem Statement Jan Beutel Computer Engineering and Networks Lab Swiss Federal Institute of Technology (ETH) Zurich.
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks Qing Fang, Jie Gao, Leonidas J. Guibas, Vin de Silva, Li Zhang Department of Electrical.
SenSys 2003 Differentiated Surveillance for Sensor Networks Ting Yan Tian He John A. Stankovic Department of Computer Science, University of Virginia November.
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
Wayne Lawton Department of Mathematics National University of Singapore Convergence of Infinite Products.
Algebraic Topology Dr. SOHAIL IQBAL MTH 477 For Master of Mathematics
An Introduction to Computational Fluids Dynamics Prapared by: Chudasama Gulambhai H ( ) Azhar Damani ( ) Dave Aman ( )
Amir Yavariabdi Introduction to the Calculus of Variations and Optical Flow.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
Delaunay Triangulations and Control-Volume Meshing Michael Murphy.
Algebraic Topology Simplicial Homology Wayne Lawton
Zigzag Persistent Homology Survey
Image Morphing © Zooface Many slides from Alexei Efros, Berkeley.
State Space Representation
Mathematical Descriptions of Systems
Algebraic Topology and Distributed Computing
Modeling in the Time Domain
§2-3 Observability of Linear Dynamical Equations
State Space Analysis UNIT-V.
§1—2 State-Variable Description The concept of state
Chapter 5: Morse functions and function-induced persistence
Physics 451/551 Theoretical Mechanics
Chapter 3: Simplicial Homology Instructor: Yusu Wang
Presentation transcript:

robert ghrist professor of mathematics & electrical/systems engineering the university of pennsylvania topological methods for networks infodynets kickoff : sept 2009

tools for applied mathematics…

differential equations

linear algebra

numerical analysis

novel challenges necessitate novel mathematics

hardware improves...

topology

topological methods for networks…

homological coverage

sensors and simplices each have knowledge only of their identities and of their local connectivity... sensorssimplices homological coverage

the flag complex of a network is the maximal simplicial completion given node id’s, local communication links count nodes & cancel via signal connectivity C 0 ← C 1 ← C 2 ← C 3 ←... [nodes][pairs] [triples][quads] homology converts higher-order network connectivity into global structure... [1-d network] [flag complex] [environment] [H 1 generator]...without coordinates; density assumptions; uniform distributions, etc. networks & complexes

1. compact polygonal domain D in R 2 2. nodes broadcast unique id’s to neighbors 3. coverage regions of a 2-simplex of connected nodes contain the convex hull 4. dedicated fence cycle defines ∂D F coverage assumptions

Theorem [DG]: under above assumptions, the sensor network covers the domain without gaps if there exists [α] in H 2 ( R, F ) with ∂α≠0 F H 2 ( R, F )H1(F)H1(F) H 2 ( R 2,∂D )H 1 ( ∂D ) H 2 ( R 2 -p,∂D ) ∂*∂* ∂*∂* σ * ≈σ*σ* =0 proof: build a commutative diagram of homology groups map σ:( R, F )→(R 2,∂D) convex hulls of simplices if p lies in D-σ( R ), then the left passes through zero commutativity of diagram yields a contradiction intuition: [α] “triangulates” the domain with covered simplices coverage criterion

Not an if & only if statement: provides a certificate The relative condition really is necessary coverage remarks

power conservation via minimal homology generators hole detection & repair via H 1 basis computation distributed (gossip) algorithms for homology computation pursuit/evasion results for time-dependent nodes current results

idea: choose a minimal generator [α] in H 2 ( R, F ) Corollary: [DG] nodes implicated in generator of H 2 ( R, F ) suffice to cover domain question: is the cover redundant? idea: choose a generating set {[α i ]} for H 1 ( R ) where |α i |=N i Theorem: [DG] expanding r c at the nodes α i of to the value ½ r b csc (π/N i ) suffices to cover domain question: how to fix the holes? coverage power

question: is the computation distributable? Jadbabaie & Tahbaz-Salehi C0C0 C1C1 ← ∂ C2C2 ← ∂ C3C3 ← ∂ 0 ← ∂ … ← ∂ ← ∂* ← ← ← ← Laplacian: L = ∂*∂ + ∂∂* Hodge theory: ker( L k ) ≈ H k use dynamics… Egerstedt & Muhammad = - L k c(t) dt dc dynamics of heat flow is globally asymptotically stable iff H k = 0 distributed (“gossip”) algorithms to compute ker L Mrozek et al. distributed algebraic algorithms… bonus: subgradient methods yield sparse generators for homology… Tahbaz-Salehi and Jadbabaie distributed coverage

question: what happens when the sensors (and an evader) are in motion? dynamic coverage

a network is the skeleton of higher order structure… C0C0 C1C1 0 ← ∂ ← ∂ C2C2 C3C3 ← ∂ ← ∂ ← ∂ moral

euler calculus

χ = Σ (-1) k # { k-dimensional cells } k χ = 2 χ = Σ (-1) k rank H k k euler calculus χ (AuB) = χ (A)+ χ (B) – χ (A B) u euler characteristic is a topological invariant of spaces thus: euler measure d χ explicit definition: euler integral ∫ h d χ = ∫ ( Σ c i 1 U i ) d χ = Σ ( ∫ c i 1 U i ) d χ = Σ c i χ (U i )

signal processing ∫ h d χ geometry probability topology networks kashiwara macpherson schapira viro blaschke hadwiger rota chen adler taylor

target detection

a network of simple sensors returns target counts without IDs how many targets are there? = 0= 1= 2= 3= 4 problem

theorem: [baryshnikov-g.] assuming target footprints have uniform χ (U i )=c≠0 # targets = ( 1/c ) ∫ h d χ ∫ h d χ = ∫ ( Σ 1 U i ) d χ = Σ ( ∫ 1 U i d χ ) = Σ χ ( U i ) = c # i “ target space ” “ sensor space ” “ target footprint ” U i for each i “ local count ” h(x) = #{ i : x lies in U i } h trivial proof: ∫ h d χ = ∫ ( Σ 1 U i ) d χ = Σ ( ∫ 1 U i d χ ) = Σ χ ( U i ) = N # i amazingly, one needs no convexity, no leray (“good cover”) condition, etc. this is a purely topological result.

example

numerical analysis for (planar) sampled integrand via alexander duality integration formulae for counting time-dependent waves or moving targets via fubini theorem extensions to real-valued integrands for numerical analysis integral transforms for topological signal processing current results

topological integration theories aggregate data moral F*F* XY CF(X)CF(Y) F pt CF( pt )=Z ∫ d χ

what is the right global tool for this infdynets muri?

sheaf theory

closing credits… research sponsored by professional supportuniversity of pennsylvania a. mitchell darpa (stomp program) primary collaboratorsy. baryshnikov, bell labs v. de silva, pomona acme klein bottleb. mann