Tilings, Geometric Representations, and Discrete Analytic Functions László Lovász Microsoft Research

Slides:



Advertisements
Similar presentations
Quantum Lovasz local lemma Andris Ambainis (Latvia), Julia Kempe (Tel Aviv), Or Sattath (Hebrew U.) arXiv:
Advertisements

B ETTI NUMBERS OF RANDOM SIMPLICIAL COMPLEXES MATTHEW KAHLE & ELIZABETH MECKE Presented by Ariel Szapiro.
Planar graphs Algorithms and Networks. Planar graphs2 Can be drawn on the plane without crossings Plane graph: planar graph, given together with an embedding.
Slides from: Doug Gray, David Poole
Discrete Differential Geometry Planar Curves 2D/3D Shape Manipulation, 3D Printing March 13, 2013 Slides from Olga Sorkine, Eitan Grinspun.
Greedy Routing with Guaranteed Delivery Using Ricci Flow Jie Gao Stony Brook University Rik Sarkar, Xiaotian Yin, Feng Luo, Xianfeng David Gu.
Kick-off Meeting, July 28, 2008 ONR MURI: NexGeNetSci Distributed Coordination, Consensus, and Coverage in Networked Dynamic Systems Ali Jadbabaie Electrical.
Nonlinear methods in discrete optimization László Lovász Eötvös Loránd University, Budapest
Eigenvalues and geometric representations of graphs László Lovász Microsoft Research One Microsoft Way, Redmond, WA 98052
Steinitz Representations László Lovász Microsoft Research One Microsoft Way, Redmond, WA 98052
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Random graphs and limits of graph sequences László Lovász Microsoft Research
Topological nonexistence results in complexity theory and combinatorics László Lovász Microsoft Research One Microsoft Way, Redmond, WA 98052
Entropy Rates of a Stochastic Process
many branches of mathematics
Graph Drawing Introduction 2005/2006. Graph Drawing: Introduction2 Contents Applications of graph drawing Planar graphs: some theory Different types of.
Rectangle Visibility Graphs: Characterization, Construction, Compaction Ileana Streinu (Smith) Sue Whitesides (McGill U.)
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Theory of Data Flow and Random Placement.
Line of Best Fit Geometry of Linear Maps Markov Chains Orthonormal Matrices 3. Topics.
EXPANDER GRAPHS Properties & Applications. Things to cover ! Definitions Properties Combinatorial, Spectral properties Constructions “Explicit” constructions.
Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.
Theta Function Lecture 24: Apr 18. Error Detection Code Given a noisy channel, and a finite alphabet V, and certain pairs that can be confounded, the.
CTIS 154 Discrete Mathematics II1 8.2 Paths and Cycles Kadir A. Peker.
1 University of Denver Department of Mathematics Department of Computer Science.
6 6.3 © 2012 Pearson Education, Inc. Orthogonality and Least Squares ORTHOGONAL PROJECTIONS.
Curve Curve: The image of a continous map from [0,1] to R 2. Polygonal curve: A curve composed of finitely many line segments. Polygonal u,v-curve: A polygonal.
cover times, blanket times, and majorizing measures Jian Ding U. C. Berkeley James R. Lee University of Washington Yuval Peres Microsoft Research TexPoint.
Graph Theory Chapter 6 Planar Graphs Ch. 6. Planar Graphs.
A Study of The Applications of Matrices and R^(n) Projections By Corey Messonnier.
Chapter 5: The Orthogonality and Least Squares
How to reform a terrain into a pyramid Takeshi Tokuyama (Tohoku U) Joint work with Jinhee Chun (Tohoku U) Naoki Katoh (Kyoto U) Danny Chen (U. Notre Dame)
AN ORTHOGONAL PROJECTION
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster 2012.
Why is it useful to walk randomly? László Lovász Mathematical Institute Eötvös Loránd University October
1 CS104 : Discrete Structures Chapter V Graph Theory.
October Large networks: a new language for science László Lovász Eötvös Loránd University, Budapest
Theory of impedance networks: A new formulation F. Y. Wu FYW, J. Phys. A 37 (2004)
Graph algebras and extremal graph theory László Lovász April
Local and global convergence in bounded degree graphs László Lovász Eötvös Loránd University, Budapest Joint work with Christian Borgs, Jennifer Chayes.
Cover times, blanket times, and the GFF Jian Ding Berkeley-Stanford-Chicago James R. Lee University of Washington Yuval Peres Microsoft Research.
Stefan Felsner planar graph G planar embedding of G A graph G is planar if it can be drawn on the plane with no crossing edges.
Chap. 5 Inner Product Spaces 5.1 Length and Dot Product in R n 5.2 Inner Product Spaces 5.3 Orthonormal Bases: Gram-Schmidt Process 5.4 Mathematical Models.
Theory of electric networks: The two-point resistance and impedance F. Y. Wu Northeastern University Boston, Massachusetts USA.
Flow Algorithms Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Analysis of Algorithms Week 9, Lecture 2.
Regularity partitions and the topology of graphons László Lovász Eötvös Loránd University, Budapest Joint work Balázs Szegedy August
Embeddings, flow, and cuts: an introduction University of Washington James R. Lee.
CS 484 Load Balancing. Goal: All processors working all the time Efficiency of 1 Distribute the load (work) to meet the goal Two types of load balancing.
Spectral Partitioning: One way to slice a problem in half C B A.
A perfect notion László Lovász Microsoft Research To the memory of Claude Berge.
Random Geometric Graph Model Model for ad hoc/sensor networks n nodes placed in d-dim space Connectivity threshold r Two nodes u,v connected iff ||u-v||
6.4 Random Fields on Graphs 6.5 Random Fields Models In “Adaptive Cooperative Systems” Summarized by Ho-Sik Seok.
Discrete mathematics: the last and next decade László Lovász Microsoft Research One Microsoft Way, Redmond, WA 98052
January 2016 Spectra of graphs and geometric representations László Lovász Hungarian Academy of Sciences Eötvös Loránd University
Euler characteristic (simple form):
Algorithms and Networks
Peer-to-Peer Networks 07 Degree Optimal Networks
IERG6120 Lecture 22 Kenneth Shum Dec 2016.
Vector representations of graphs
Matrices Definition: A matrix is a rectangular array of numbers or symbolic elements In many applications, the rows of a matrix will represent individuals.
Probabilistic existence of regular combinatorial objects
geometric representations of graphs
Preliminary.
Lecture 29 Oscillation, linear superposition, and wave
Lecture 13 Operations in Graphics and Geometric Modeling I: Projection, Rotation, and Reflection Shang-Hua Teng.
Around the Regularity Lemma
Lecture 13 Operations in Graphics and Geometric Modeling I: Projection, Rotation, and Reflection Shang-Hua Teng.
N(S) ={vV|uS,{u,v}E(G)}
Topological Signatures For Fast Mobility Analysis
Approximation of Functions
Drawing a graph
Presentation transcript:

Tilings, Geometric Representations, and Discrete Analytic Functions László Lovász Microsoft Research

Harmonic functions Every non-constant function has at least 2 poles.

Example 1: Random walks S f(v)= E (f(Z v )) Z v : (random) point where random walk from v hits S v 0 v 1 f(v)= P ( random walk from v hits t before s) s t

Example 2: Electrical networks 0 v 1 f(v)= electrical potential s t

Example 3: Rubber bands f(v)= position of nodes 0 1

“Dictionary” of quantities from electrical networks, random walks, and static:

Analytic functions on the lattice (Ferrand 1944, Duffin 1956) z z+1 z+i z+i+1

“z”“z” i 2-i 1+i 1-i-i i 2i 3i 1+2i 4 3+i 3-i

i 3-4i 2i -2i i i 8-6i

i -1+i i -i-i -6i -19i -7-2i i -1-i2-7i i 1-i 1+i

Brooks-Smith-Stone-Tutte

Rotation-free circulation: Discrete holomorphic forms on surfaces Mercat 2001 Weighted version:

Grid on the torus

A : null-homologous circulationsdim( A ) = #faces-1= f-1 B : potentials dim( B ) = #nodes-1= n-1 C : rotation-free circulations dim( C ) = #edges- (#nodes-1)- (#faces-1) = 2·genus mutually orthogonal Discrete Hodge decomposition

“Analytic function cannot vanish on a large set’’ “Large” is not size: planar piece separating set of size < 2g

f : nonzero rotation-free circulation G ’: subgraph where f does not vanish U : connected subgraph such that f vanishes on all edges incident with U “Analytic function cannot vanish on a large set’’ U can be separated from G ’ by at most 4g-3 nodes. Benjamini-L

Main (easy) topological lemma:

(assume no other 0’s) Proof of Theorem u

Which sets of edges can be supports of rotation-free circulations? -  weighting of the edges - for weights =1 - for some weighting Can be characterized using matroid theory LL-Schrijver Combinatorially analytic maps:

incidence vector of edge uv projection of  uv on C If g>0 and G is 3-connected and simple, then  uv  0 for every edge uv. u v qp If g=0, then  uv =0 for every edge uv.

ee e

incidence vector of edge uv projection of  uv on C If g>0 and G is 3-connected and simple, then  uv  0 for every edge uv. u v qp If g>0 and G is 3-connected and simple, then  nowhere-0 rotation-free circulation on G.

A strange identity: If G is a 3-connected map, then

Toroidal maps: analytic functions, straight line embeddings, rubber bands, square tilings

Universal cover map

g=1 : Two linearly independent rotation-free circulations

Two linearly independent harmonic functions

Two coordinates  periodic embedding in the plane  embedding in the torus This gives an embedding in the torus

Horizontal coordinate is nowhere-zero flow  nondegenerate squares Edge  square horizontal length  size

R. Kenyon

Which other properties of analytic functions have discrete analogues? Multiplication of analytic (meromorphic) functions? Merkat: weight the edges, “critical” weighting Riemann-Roch? (Cai)

Global information from local observation “Can you hear the shape of a drum?” - Observe a graph locally (a single node, a neighborhood of a node, a “window”) - There is a local random process on the graph (random walk, heat bath,...) - Infer global properties of the graph

The graph, with the window:

The Noisy Circulator: (face balancing) (edge excitation) frequency 1 frequency p (node balancing)

If no edge excitation occurs, then the weighting converges to a rotation-free flow. dimension of rotation-free flows =2g dimension of rotation-free flows in window =2g if edge excitations occur infrequently: random vectors from a (2g) -dimensional subspace with errors

If p<N -c, then observing the Noisy Circulator for N c /p steps, we can determine g with high probability.