Consensus formation in the Deuant model

Size: px
Start display at page:

Download "Consensus formation in the Deuant model"

Transcription

1 Consensus formation in the Deuant model Timo Hirscher Chalmers University of Technology Seminarium i matematisk statistik, KTH October 29, 2014

2 Outline The seminar is structured as follows: Introduction: Description of the model Limiting behavior Essential concepts Deuant model with univariate opinions Phase transition for the model on Z Partial results for Z d, d 2 as well as the innite percolation cluster on Z d, d 2 Deuant model on Z with multivariate opinions Outline Timo Hirscher - Consensus in the Deuant model 2/26

3 Introduction The Deuant model Simple connected graph G = (V, E) represents interrelations between the individuals {η t (v)} v V denotes the opinion prole at time t 0, the initial conguration {η 0 (v)} v V being i.i.d. ν Model parameters: condence bound θ 0 and willingness to compromise µ (0, 1 2 ] Update step If at time t edge u, v is chosen and the current values are η t (u) =: a and η t (v) =: b, the update rule reads { a + µ(b a) if a b θ, η t (u) = a otherwise, { b + µ(a b) if a b θ, η t (v) = b otherwise. Introduction The model Timo Hirscher - Consensus in the Deuant model 3/26

4 Introduction Limiting behavior Scenarios, the conguration can approach: (i) No consensus There will be nally blocked edges, i.e. e = u, v s.t. for all times t large enough. η t (u) η t (v) > θ, (ii) Weak consensus Every pair of neighbors {u, v} will nally concur, i.e. lim t η t(u) η t (v) = 0 almost surely. (iii) Strong consensus The opinion value at every vertex converges to a common limit as t. Introduction The model Timo Hirscher - Consensus in the Deuant model 4/26

5 Introduction Energy For a convex function E : R R 0, dene the energy at a given vertex v V at time t to be W t (v) := E ( η t (v) ). Note that, due to convexity of E, an update step can only decrease the sum of energies of the two involved vertices. Introduction Essential concepts Timo Hirscher - Consensus in the Deuant model 5/26

6 Introduction Share a drink Fix v V, start with the initial conguration {ξ 0 (u)} u V = δ v and perform updates like in the Deuant model, with the same µ but ignoring the condence bound θ. The outcome after nitely many updates {ξ n (u)} u V is called SAD-prole. The opinion value η t (v) is a convex combination of the initial opinions {η 0 (u)} u V. If the SAD-procedure starting from δ v is mimicking the updates in the Deuant model backwards in time, the contribution of a vertex u is given by ξ n (u). Introduction Essential concepts Timo Hirscher - Consensus in the Deuant model 6/26

7 The Deuant model with univariate opinions Univariate opinions Timo Hirscher - Consensus in the Deuant model 7/26

8 Pairwise long-term behavior Lemma For the Deuant model on Z with bounded i.i.d initial opinions and threshold parameter θ, the following holds a.s. for every two neighbors u, v Z: Either η t (u) η t (v) > θ for all suciently large t, i.e. the edge u, v is nally blocked, or lim η t(u) η t (v) = 0, t i.e. the two neighbors will nally concur. Univariate opinions on Z Timo Hirscher - Consensus in the Deuant model 8/26

9 Flatness Consider the line graph Z as underlying network for the model. v Z is called ε-at to the right in the initial conguration {η 0 (u)} u Z if for all n 0: v+n 1 η 0 (u) [E η 0 ε, E η 0 + ε]. n + 1 u=v It is called ε-at to the left if the above condition is met with the sum running from v n to v instead. v is called two-sidedly ε-at if for all m, n 0: 1 m + n + 1 v+n u=v m η 0 (u) [E η 0 ε, E η 0 + ε]. Univariate opinions on Z Timo Hirscher - Consensus in the Deuant model 9/26

10 Theorem (Lanchier, Häggström) Consider the Deuant model on the graph (Z, E), where E = { v, v + 1, v Z} with ν = unif([0, 1]) and xed µ (0, 1 2 ]. Then the critical value is θ c = 1 2 : (a) If θ > 1 2, the model converges almost surely to strong consensus, i.e. with probability 1 we have: lim t η t(v) = 1 2 for all v Z. (b) If θ < 1 2 however, the integers a.s. split into nite clusters; no global consensus is approached. Univariate opinions Critical value for Z Timo Hirscher - Consensus in the Deuant model 10/26

11 Crucial properties of the initial distribution If ν, the distribution of η 0, has a nite expectation, dene its radius by R := inf{r 0, P(η 0 [E η 0 r, E η 0 + r]) = 1}. If the initial distribution is bounded, let h denote the largest gap in its support. supp(ν) R a E η 0 h b Univariate opinions Critical value for Z Timo Hirscher - Consensus in the Deuant model 11/26

12 Theorem Consider the Deuant model on Z with i.i.d. initial opinions. (a) If the initial distribution ν is bounded, there is a phase transition from a.s. no consensus to a.s. strong consensus at θ c = max{r, h}. The limit value in the supercritical regime is E η 0. (b) Suppose ν is unbounded but its expected value exists, either in the strong sense, i.e. E η 0 R, or the weak sense, i.e. E η 0 {, + }. Then for any θ (0, ), the Deuant model will a.s. approach no consensus in the long run. Univariate opinions Critical value for Z Timo Hirscher - Consensus in the Deuant model 12/26

13 Limiting behavior on Z d, d 2 Theorem (a) If the initial values are distributed uniformly on [0, 1] and θ > 3 4, the conguration will a.s. approach weak consensus, i.e. for all u, v P ( lim t η t (u) η t (v) = 0 ) = 1. (b) For general initial distributions on [0, 1], this threshold is non-trivial if the support is not {0, 1}. Higher dimensions On the full grid Z d Timo Hirscher - Consensus in the Deuant model 13/26

14 Bond percolation on Z d In i.i.d. bond percolation on the grid Z d every edge is independently chosen to be open with probability p [0, 1]. For d 2 there exists a critical probability p c (0, 1), s.t. for subcritical percolation, i.e. p < p c, one a.s. has only nite clusters and for supercritical percolation, i.e. p > p c, there a.s. exist a (unique) innite cluster. Let us consider the Deuant model on the random subgraph of supercritical i.i.d. bond percolation on Z d which is independent of the initial conguration and Poisson events. Higher dimensions On the innite percolation cluster Timo Hirscher - Consensus in the Deuant model 14/26

15 Limiting behavior on the innite percolation cluster Theorem Consider the Deuant model on the innite cluster of supercritical bond percolation with parameter p < 1 and i.i.d. bounded initial opinion values. Then the conguration can not approach strong consensus on the innite cluster for θ < R. Higher dimensions On the innite percolation cluster Timo Hirscher - Consensus in the Deuant model 15/26

16 u v u v e Copy 1 Copy 2 Higher dimensions On the innite percolation cluster Timo Hirscher - Consensus in the Deuant model 16/26

17 The Deuant model on Z with multivariate opinions Multivariate opinions Timo Hirscher - Consensus in the Deuant model 17/26

18 Crucial change for multivariate opinions If we extend the model to vector-valued opinions replacing the absolute value by the Euclidean distance there is a non-trivial change: By compromising, two opinions can get closer to a third one that was further than θ away from both. η(u) η(v) η(w) Multivariate opinions Timo Hirscher - Consensus in the Deuant model 18/26

19 Finite congurations Consider a nite section {1,..., n} of the line graph Z, a nite sequence (e i ) N i=1 of edges e i { 1, 2,..., n 1, n } and some values x 1,..., x n in supp(ν). Call such a triplet a nite conguration. To run the dynamics of the Deuant model with parameter θ on this setting will mean that we set η 0 (v) = x v for all v {1,..., n}, and then update those values interpreting (e i ) N i=1 as the locations of the rst N Poisson events on 1, 2,..., n 1, n. Multivariate opinions Achievable opinion values Timo Hirscher - Consensus in the Deuant model 19/26

20 Simultaneously achievable opinion values For θ > 0 and initial distribution ν, let D θ (ν) denote the set of vectors in R k which the opinion values of nite congurations can collectively approach, if the dynamics are run with condence bound θ. More precisely, x D θ (ν) if and only if for all r > 0, there exists a nite conguration such that running the dynamics with respect to θ will bring all its opinion values inside B(x, r). Multivariate opinions Achievable opinion values Timo Hirscher - Consensus in the Deuant model 20/26

21 Properties of D θ (ν) Lemma (a) D θ (ν) is closed and increases with θ. (b) supp(ν) D θ (ν) conv(supp(ν)) B[E η 0, R] for all θ > 0, where conv(a) denotes the convex hull, A the closure of a set A. (c) The connected components of D θ (ν) are convex and at distance at least θ from one another. If D θ (ν) is connected, then D θ (ν) = conv(supp(ν)). (d) For R <, the set-valued mapping θ D θ (ν) is piecewise constant. (e) If D θ (ν) is connected and E η 0 nite, then E η 0 D θ (ν). Multivariate opinions Achievable opinion values Timo Hirscher - Consensus in the Deuant model 21/26

22 Relation to the support of η t For θ > 0 and t 0, let the support of the distribution of η t be denoted by supp θ (η t ). Theorem If ϑ D ϑ (ν) has no jump in [θ ε, θ + ε] for xed θ and some ε > 0, the following equality holds true for all t > 0: supp θ (η t ) = D θ (ν). Multivariate opinions Achievable opinion values Timo Hirscher - Consensus in the Deuant model 22/26

23 Adapted denition of the largest gap Given an initial distribution ν, dene the length of the largest gap in its support as h := inf{θ > 0, D θ (ν) is connected}. Note that this is consistent with the univariate case. Multivariate opinions Critical value for Z Timo Hirscher - Consensus in the Deuant model 23/26

24 Limiting behaviour for the model on Z with multivariate opinions Theorem Consider the Deuant model on Z with an initial distribution on (R k,. ). (a) If the initial distribution is bounded, i.e. R = inf { r > 0, P ( η 0 B[E η 0, r] ) = 1 } <, there is a phase transition from a.s. no consensus to a.s. strong consensus at θ c = max{r, h}. The limit value in the supercritical regime is E η 0. Multivariate opinions Critical value for Z Timo Hirscher - Consensus in the Deuant model 24/26

25 Limiting behaviour for the model on Z with multivariate opinions Theorem Consider the Deuant model on Z with an initial distribution on (R k,. ). (a) Bounded initial distribution (b) Let η 0 = (η (1) 0,..., η(k) 0 ) be the random initial opinion vector. If at least one of the coordinates η (i) 0 has an unbounded marginal distribution, whose expected value exists (regardless of whether nite, + or ), then the limiting behavior will a.s. be no consensus, irrespectively of θ. Multivariate opinions Critical value for Z Timo Hirscher - Consensus in the Deuant model 25/26

26 Literature Deuant, G., Neau, D., Amblard, F. and Weisbuch, G., Mixing beliefs among interacting agents, Advances in Complex Systems, Vol. 3, pp , Häggström, O., A pairwise averaging procedure with application to consensus formation in the Deuant model, Acta Applicandae Mathematicae, Vol. 119 (1), pp , Lanchier, N., The critical value of the Deuant model equals one half, Latin American Journal of Probability and Mathematical Statistics, Vol. 9 (2), pp , Bibliography Timo Hirscher - Consensus in the Deuant model 26/26

27 Appendix Ergodicity Theorem (ergodic theorem for Z d -actions) Let ξ denote a Z d -stationary random element, (B n ) n N an increasing sequence of boxes and f be a bounded function. For n one gets 1 B n z B n f(t z ξ) E[f(ξ) ξ 1 I] a.s., where T z is the translation x x z and I the σ-algebra of Z d -invariant events. Appendix Timo Hirscher - Consensus in the Deuant model 27/26

28 Appendix General metrics Denition Consider a metric ρ on R k. (i) Call ρ locally dominated by the Euclidean distance, if there exist γ, c > 0 such that for x, y R k with x y 2 γ: ρ(x, y) c x y 2. (ii) Let ρ be called weakly convex if for all x, y, z R k : ρ(x, αy+(1 α) z) max{ρ(x, y), ρ(x, z)} for all α [0, 1]. (iii) ρ is called sensitive to coordinate i, if there exists a function ϕ : [0, ) [0, ) such that lim s ϕ(s) = and for any two vectors x, y R k with x i y i > s, it holds that ρ(x, y) > ϕ(s). Appendix Timo Hirscher - Consensus in the Deuant model 28/26

Stochastic domination in space-time for the supercritical contact process

Stochastic domination in space-time for the supercritical contact process Stochastic domination in space-time for the supercritical contact process Stein Andreas Bethuelsen joint work with Rob van den Berg (CWI and VU Amsterdam) Workshop on Genealogies of Interacting Particle

More information

Weak convergence and Brownian Motion. (telegram style notes) P.J.C. Spreij

Weak convergence and Brownian Motion. (telegram style notes) P.J.C. Spreij Weak convergence and Brownian Motion (telegram style notes) P.J.C. Spreij this version: December 8, 2006 1 The space C[0, ) In this section we summarize some facts concerning the space C[0, ) of real

More information

Studying large networks via local weak limit theory

Studying large networks via local weak limit theory Studying large networks via local weak limit theory Venkat Anantharam EECS Department University of California, Berkeley March 10, 2017 Advanced Networks Colloquium University of Maryland, College Park

More information

Consensus formation in the Deffuant model

Consensus formation in the Deffuant model THESIS FOR THE DEGREE OF LICENCIATE OF PHILOSOPHY Consensus formation in the Deffuant model TIMO HIRSCHER Division of Mathematics Department of Mathematical Sciences CHALMERS UNIVERSITY OF TECHNOLOGY AND

More information

arxiv: v2 [math.pr] 26 Aug 2017

arxiv: v2 [math.pr] 26 Aug 2017 CONSTRAINED PERCOLATION, ISING MODEL AND XOR ISING MODEL ON PLANAR LATTICES ZHONGYANG LI arxiv:1707.04183v2 [math.pr] 26 Aug 2017 Abstract. We study constrained percolation models on planar lattices including

More information

Probability and Measure

Probability and Measure Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability

More information

CONSTRAINED PERCOLATION ON Z 2

CONSTRAINED PERCOLATION ON Z 2 CONSTRAINED PERCOLATION ON Z 2 ZHONGYANG LI Abstract. We study a constrained percolation process on Z 2, and prove the almost sure nonexistence of infinite clusters and contours for a large class of probability

More information

PERCOLATION IN SELFISH SOCIAL NETWORKS

PERCOLATION IN SELFISH SOCIAL NETWORKS PERCOLATION IN SELFISH SOCIAL NETWORKS Charles Bordenave UC Berkeley joint work with David Aldous (UC Berkeley) PARADIGM OF SOCIAL NETWORKS OBJECTIVE - Understand better the dynamics of social behaviors

More information

MAT 771 FUNCTIONAL ANALYSIS HOMEWORK 3. (1) Let V be the vector space of all bounded or unbounded sequences of complex numbers.

MAT 771 FUNCTIONAL ANALYSIS HOMEWORK 3. (1) Let V be the vector space of all bounded or unbounded sequences of complex numbers. MAT 771 FUNCTIONAL ANALYSIS HOMEWORK 3 (1) Let V be the vector space of all bounded or unbounded sequences of complex numbers. (a) Define d : V V + {0} by d(x, y) = 1 ξ j η j 2 j 1 + ξ j η j. Show that

More information

arxiv: v2 [math.pr] 10 Jul 2013

arxiv: v2 [math.pr] 10 Jul 2013 On the critical value function in the divide and color model András Bálint Vincent Beffara Vincent Tassion May 17, 2018 arxiv:1109.3403v2 [math.pr] 10 Jul 2013 Abstract The divide and color model on a

More information

Distributed learning in potential games over large-scale networks

Distributed learning in potential games over large-scale networks Distributed learning in potential games over large-scale networks Fabio Fagnani, DISMA, Politecnico di Torino joint work with Giacomo Como, Lund University Sandro Zampieri, DEI, University of Padova Networking

More information

Clustering and coexistence in the one-dimensional vectorial Deffuant model

Clustering and coexistence in the one-dimensional vectorial Deffuant model ALEA,Lat. Am. J.Probab. Math. Stat.11(2),541 564(2014) Clustering and coexistence in the one-dimensional vectorial Deffuant model N. Lanchier and S. Scarlatos School of Mathematical and Statistical Sciences,

More information

Random geometric analysis of the 2d Ising model

Random geometric analysis of the 2d Ising model Random geometric analysis of the 2d Ising model Hans-Otto Georgii Bologna, February 2001 Plan: Foundations 1. Gibbs measures 2. Stochastic order 3. Percolation The Ising model 4. Random clusters and phase

More information

On the critical value function in the divide and color model

On the critical value function in the divide and color model ALEA, Lat. Am. J. Probab. Math. Stat. 10 (2), 653 666 (2013) On the critical value function in the divide and color model András Bálint, Vincent Beffara and Vincent Tassion Chalmers University of Technology

More information

Stochastic Processes

Stochastic Processes Stochastic Processes A very simple introduction Péter Medvegyev 2009, January Medvegyev (CEU) Stochastic Processes 2009, January 1 / 54 Summary from measure theory De nition (X, A) is a measurable space

More information

Propp-Wilson Algorithm (and sampling the Ising model)

Propp-Wilson Algorithm (and sampling the Ising model) Propp-Wilson Algorithm (and sampling the Ising model) Danny Leshem, Nov 2009 References: Haggstrom, O. (2002) Finite Markov Chains and Algorithmic Applications, ch. 10-11 Propp, J. & Wilson, D. (1996)

More information

Correlation dimension for self-similar Cantor sets with overlaps

Correlation dimension for self-similar Cantor sets with overlaps F U N D A M E N T A MATHEMATICAE 155 (1998) Correlation dimension for self-similar Cantor sets with overlaps by Károly S i m o n (Miskolc) and Boris S o l o m y a k (Seattle, Wash.) Abstract. We consider

More information

arxiv: v2 [math.pr] 16 Jun 2009

arxiv: v2 [math.pr] 16 Jun 2009 The Annals of Probability 2009, Vol. 37, No. 2, 654 675 DOI: 10.1214/08-AOP415 c Institute of Mathematical Statistics, 2009 arxiv:0710.0939v2 [math.pr] 16 Jun 2009 STABILIZABILITY AND PERCOLATION IN THE

More information

The Great Wall of David Shin

The Great Wall of David Shin The Great Wall of David Shin Tiankai Liu 115 June 015 On 9 May 010, David Shin posed the following puzzle in a Facebook note: Problem 1. You're blindfolded, disoriented, and standing one mile from the

More information

BOUNDED CONFIDENCE WITH REJECTION: THE INFINITE POPULATION LIMIT WITH PERFECT UNIFORM INITIAL DENSITY

BOUNDED CONFIDENCE WITH REJECTION: THE INFINITE POPULATION LIMIT WITH PERFECT UNIFORM INITIAL DENSITY BOUNDED CONFIDENCE WITH REJECTION: THE INFINITE POPULATION LIMIT WITH PERFECT UNIFORM INITIAL DENSITY Huet S., Deffuant G. Cemagref, Laboratoire d'ingénierie des Systèmes Complexes 63172 Aubière, France

More information

Midterm 1. Every element of the set of functions is continuous

Midterm 1. Every element of the set of functions is continuous Econ 200 Mathematics for Economists Midterm Question.- Consider the set of functions F C(0, ) dened by { } F = f C(0, ) f(x) = ax b, a A R and b B R That is, F is a subset of the set of continuous functions

More information

LECTURE 12 UNIT ROOT, WEAK CONVERGENCE, FUNCTIONAL CLT

LECTURE 12 UNIT ROOT, WEAK CONVERGENCE, FUNCTIONAL CLT MARCH 29, 26 LECTURE 2 UNIT ROOT, WEAK CONVERGENCE, FUNCTIONAL CLT (Davidson (2), Chapter 4; Phillips Lectures on Unit Roots, Cointegration and Nonstationarity; White (999), Chapter 7) Unit root processes

More information

Topics in Stochastic Geometry. Lecture 4 The Boolean model

Topics in Stochastic Geometry. Lecture 4 The Boolean model Institut für Stochastik Karlsruher Institut für Technologie Topics in Stochastic Geometry Lecture 4 The Boolean model Lectures presented at the Department of Mathematical Sciences University of Bath May

More information

Random sets. Distributions, capacities and their applications. Ilya Molchanov. University of Bern, Switzerland

Random sets. Distributions, capacities and their applications. Ilya Molchanov. University of Bern, Switzerland Random sets Distributions, capacities and their applications Ilya Molchanov University of Bern, Switzerland Molchanov Random sets - Lecture 1. Winter School Sandbjerg, Jan 2007 1 E = R d ) Definitions

More information

A PROBABILISTIC MODEL FOR CASH FLOW

A PROBABILISTIC MODEL FOR CASH FLOW A PROBABILISTIC MODEL FOR CASH FLOW MIHAI N. PASCU Communicated by the former editorial board We introduce and study a probabilistic model for the cash ow in a society in which the individuals decide to

More information

THEOREMS, ETC., FOR MATH 515

THEOREMS, ETC., FOR MATH 515 THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every

More information

Lecture 5. 1 Chung-Fuchs Theorem. Tel Aviv University Spring 2011

Lecture 5. 1 Chung-Fuchs Theorem. Tel Aviv University Spring 2011 Random Walks and Brownian Motion Tel Aviv University Spring 20 Instructor: Ron Peled Lecture 5 Lecture date: Feb 28, 20 Scribe: Yishai Kohn In today's lecture we return to the Chung-Fuchs theorem regarding

More information

arxiv: v1 [math.pr] 1 Jan 2013

arxiv: v1 [math.pr] 1 Jan 2013 Stochastic spatial model of producer-consumer systems on the lattice arxiv:1301.0119v1 [math.pr] 1 Jan 2013 1. Introduction N. Lanchier Abstract The objective of this paper is to give a rigorous analysis

More information

Limit shapes outside the percolation cone

Limit shapes outside the percolation cone jointly with Tuca Auffinger and Mike Hochman Princeton University July 14, 2011 Definitions We consider first-passage percolation on the square lattice Z 2. x γ - We place i.i.d. non-negative passage times

More information

Modern Discrete Probability Branching processes

Modern Discrete Probability Branching processes Modern Discrete Probability IV - Branching processes Review Sébastien Roch UW Madison Mathematics November 15, 2014 1 Basic definitions 2 3 4 Galton-Watson branching processes I Definition A Galton-Watson

More information

Ω = e E d {0, 1} θ(p) = P( C = ) So θ(p) is the probability that the origin belongs to an infinite cluster. It is trivial that.

Ω = e E d {0, 1} θ(p) = P( C = ) So θ(p) is the probability that the origin belongs to an infinite cluster. It is trivial that. 2 Percolation There is a vast literature on percolation. For the reader who wants more than we give here, there is an entire book: Percolation, by Geoffrey Grimmett. A good account of the recent spectacular

More information

Geometric inference for measures based on distance functions The DTM-signature for a geometric comparison of metric-measure spaces from samples

Geometric inference for measures based on distance functions The DTM-signature for a geometric comparison of metric-measure spaces from samples Distance to Geometric inference for measures based on distance functions The - for a geometric comparison of metric-measure spaces from samples the Ohio State University wan.252@osu.edu 1/31 Geometric

More information

MIXING TIMES OF RANDOM WALKS ON DYNAMIC CONFIGURATION MODELS

MIXING TIMES OF RANDOM WALKS ON DYNAMIC CONFIGURATION MODELS MIXING TIMES OF RANDOM WALKS ON DYNAMIC CONFIGURATION MODELS Frank den Hollander Leiden University, The Netherlands New Results and Challenges with RWDRE, 11 13 January 2017, Heilbronn Institute for Mathematical

More information

SIR epidemics on random graphs with clustering

SIR epidemics on random graphs with clustering SIR epidemics on random graphs with clustering Carolina Fransson Masteruppsats i matematisk statistik Master Thesis in Mathematical Statistics Masteruppsats 2017:3 Matematisk statistik Maj 2017 www.math.su.se

More information

A Z q -Fan theorem. 1 Introduction. Frédéric Meunier December 11, 2006

A Z q -Fan theorem. 1 Introduction. Frédéric Meunier December 11, 2006 A Z q -Fan theorem Frédéric Meunier December 11, 2006 Abstract In 1952, Ky Fan proved a combinatorial theorem generalizing the Borsuk-Ulam theorem stating that there is no Z 2-equivariant map from the

More information

The coupling method - Simons Counting Complexity Bootcamp, 2016

The coupling method - Simons Counting Complexity Bootcamp, 2016 The coupling method - Simons Counting Complexity Bootcamp, 2016 Nayantara Bhatnagar (University of Delaware) Ivona Bezáková (Rochester Institute of Technology) January 26, 2016 Techniques for bounding

More information

Return Probabilities of a Simple Random Walk on Percolation Clusters Deborah Heicklen 1;2, Christopher Homan 3;4 Abstract Benjamini and Schramm [6] sh

Return Probabilities of a Simple Random Walk on Percolation Clusters Deborah Heicklen 1;2, Christopher Homan 3;4 Abstract Benjamini and Schramm [6] sh Return Probabilities of a Simple Random Walk on Percolation Clusters Deborah Heicklen 1;2, Christopher Homan 3;4 Abstract Benjamini and Schramm [6] showed that the probability that a simple random walk

More information

l(y j ) = 0 for all y j (1)

l(y j ) = 0 for all y j (1) Problem 1. The closed linear span of a subset {y j } of a normed vector space is defined as the intersection of all closed subspaces containing all y j and thus the smallest such subspace. 1 Show that

More information

Bootstrap Percolation on Periodic Trees

Bootstrap Percolation on Periodic Trees Bootstrap Percolation on Periodic Trees Milan Bradonjić Iraj Saniee Abstract We study bootstrap percolation with the threshold parameter θ 2 and the initial probability p on infinite periodic trees that

More information

DOMINO TILINGS INVARIANT GIBBS MEASURES

DOMINO TILINGS INVARIANT GIBBS MEASURES DOMINO TILINGS and their INVARIANT GIBBS MEASURES Scott Sheffield 1 References on arxiv.org 1. Random Surfaces, to appear in Asterisque. 2. Dimers and amoebae, joint with Kenyon and Okounkov, to appear

More information

Master of Arts In Mathematics

Master of Arts In Mathematics ESTIMATING THE FRACTAL DIMENSION OF SETS DETERMINED BY NONERGODIC PARAMETERS A thesis submitted to the faculty of San Francisco State University In partial fulllment of The Requirements for The Degree

More information

Random Process Lecture 1. Fundamentals of Probability

Random Process Lecture 1. Fundamentals of Probability Random Process Lecture 1. Fundamentals of Probability Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/43 Outline 2/43 1 Syllabus

More information

Lecture Notes Introduction to Ergodic Theory

Lecture Notes Introduction to Ergodic Theory Lecture Notes Introduction to Ergodic Theory Tiago Pereira Department of Mathematics Imperial College London Our course consists of five introductory lectures on probabilistic aspects of dynamical systems,

More information

MET Workshop: Exercises

MET Workshop: Exercises MET Workshop: Exercises Alex Blumenthal and Anthony Quas May 7, 206 Notation. R d is endowed with the standard inner product (, ) and Euclidean norm. M d d (R) denotes the space of n n real matrices. When

More information

From Fractional Brownian Motion to Multifractional Brownian Motion

From Fractional Brownian Motion to Multifractional Brownian Motion From Fractional Brownian Motion to Multifractional Brownian Motion Antoine Ayache USTL (Lille) Antoine.Ayache@math.univ-lille1.fr Cassino December 2010 A.Ayache (USTL) From FBM to MBM Cassino December

More information

Removing the Noise from Chaos Plus Noise

Removing the Noise from Chaos Plus Noise Removing the Noise from Chaos Plus Noise Steven P. Lalley Department of Statistics University of Chicago November 5, 2 Abstract The problem of extracting a signal x n generated by a dynamical system from

More information

Introduction and Preliminaries

Introduction and Preliminaries Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis

More information

Universal Behavior of Connectivity Properties in Fractal Percolation Models

Universal Behavior of Connectivity Properties in Fractal Percolation Models Universal Behavior of Connectivity Properties in Fractal Percolation Models Erik I. Broman Federico Camia Abstract Partially motivated by the desire to better understand the connectivity phase transition

More information

Random measures, intersections, and applications

Random measures, intersections, and applications Random measures, intersections, and applications Ville Suomala joint work with Pablo Shmerkin University of Oulu, Finland Workshop on fractals, The Hebrew University of Jerusalem June 12th 2014 Motivation

More information

Practical conditions on Markov chains for weak convergence of tail empirical processes

Practical conditions on Markov chains for weak convergence of tail empirical processes Practical conditions on Markov chains for weak convergence of tail empirical processes Olivier Wintenberger University of Copenhagen and Paris VI Joint work with Rafa l Kulik and Philippe Soulier Toronto,

More information

An Attempt To Understand Tilling Approach In proving The Littlewood Conjecture

An Attempt To Understand Tilling Approach In proving The Littlewood Conjecture An Attempt To Understand Tilling Approach In proving The Littlewood Conjecture 1 Final Report For Math 899- Dr. Cheung Amira Alkeswani Dr. Cheung I really appreciate your acceptance in adding me to your

More information

On the cells in a stationary Poisson hyperplane mosaic

On the cells in a stationary Poisson hyperplane mosaic On the cells in a stationary Poisson hyperplane mosaic Matthias Reitzner and Rolf Schneider Abstract Let X be the mosaic generated by a stationary Poisson hyperplane process X in R d. Under some mild conditions

More information

University of California. Berkeley, CA fzhangjun johans lygeros Abstract

University of California. Berkeley, CA fzhangjun johans lygeros Abstract Dynamical Systems Revisited: Hybrid Systems with Zeno Executions Jun Zhang, Karl Henrik Johansson y, John Lygeros, and Shankar Sastry Department of Electrical Engineering and Computer Sciences University

More information

A proposal of a bivariate Conditional Tail Expectation

A proposal of a bivariate Conditional Tail Expectation A proposal of a bivariate Conditional Tail Expectation Elena Di Bernardino a joint works with Areski Cousin b, Thomas Laloë c, Véronique Maume-Deschamps d and Clémentine Prieur e a, b, d Université Lyon

More information

Detecting instants of jumps and estimating intensity of jumps from continuous or discrete data

Detecting instants of jumps and estimating intensity of jumps from continuous or discrete data Detecting instants of jumps and estimating intensity of jumps from continuous or discrete data Denis Bosq 1 Delphine Blanke 2 1 LSTA, Université Pierre et Marie Curie - Paris 6 2 LMA, Université d'avignon

More information

Stochastic dominance with imprecise information

Stochastic dominance with imprecise information Stochastic dominance with imprecise information Ignacio Montes, Enrique Miranda, Susana Montes University of Oviedo, Dep. of Statistics and Operations Research. Abstract Stochastic dominance, which is

More information

Stochastic Dynamics on Hypergraphs and the Spatial Majority Rule Model

Stochastic Dynamics on Hypergraphs and the Spatial Majority Rule Model J Stat Phys (2013) 151:21 45 DOI 10.1007/s10955-012-0543-5 Stochastic Dynamics on Hypergraphs and the Spatial Majority Rule Model N. Lanchier J. Neufer Received: 11 March 2012 / Accepted: 6 July 2012 /

More information

Resistance Growth of Branching Random Networks

Resistance Growth of Branching Random Networks Peking University Oct.25, 2018, Chengdu Joint work with Yueyun Hu (U. Paris 13) and Shen Lin (U. Paris 6), supported by NSFC Grant No. 11528101 (2016-2017) for Research Cooperation with Oversea Investigators

More information

Max-Planck-Institut fur Mathematik in den Naturwissenschaften Leipzig Uniformly distributed measures in Euclidean spaces by Bernd Kirchheim and David Preiss Preprint-Nr.: 37 1998 Uniformly Distributed

More information

The critical value of the Deffuant model equals one half

The critical value of the Deffuant model equals one half ALEA,Lat. Am. J.Probab. Math. Stat.9(2), 383 402(2012) The critical value of the Deffuant model equals one half N. Lanchier Arizona State University, School of Mathematical and Statistical Sciences. E-mail

More information

Mathematics for Economists

Mathematics for Economists Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples

More information

Percolation and Random walks on graphs

Percolation and Random walks on graphs Percolation and Random walks on graphs Perla Sousi May 14, 2018 Contents 1 Percolation 2 1.1 Definition of the model................................... 2 1.2 Coupling of percolation processes.............................

More information

Hard-Core Model on Random Graphs

Hard-Core Model on Random Graphs Hard-Core Model on Random Graphs Antar Bandyopadhyay Theoretical Statistics and Mathematics Unit Seminar Theoretical Statistics and Mathematics Unit Indian Statistical Institute, New Delhi Centre New Delhi,

More information

Finite Markov Information-Exchange processes

Finite Markov Information-Exchange processes Finite Markov Information-Exchange processes David Aldous March 30, 2011 Note that previous FMIE models were non-equilibrium. We digress to a quite different FMIE model designed to have an equilibrium.

More information

Discrete Geometry. Problem 1. Austin Mohr. April 26, 2012

Discrete Geometry. Problem 1. Austin Mohr. April 26, 2012 Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T

More information

Multitape Ordinal Machines and Primitive Recursion

Multitape Ordinal Machines and Primitive Recursion Multitape Ordinal Machines and Primitive Recursion Bernhard Irrgang and Benjamin Seyerth University of Bonn, Mathematical Institute Beringstraÿe 1, D-53115 Bonn, Germany irrgang@math.uni-bonn.de, benjamin.seyfferth@gmx.de

More information

RESISTANCE-BASED PERFORMANCE ANALYSIS OF THE CONSENSUS ALGORITHM OVER GEOMETRIC GRAPHS

RESISTANCE-BASED PERFORMANCE ANALYSIS OF THE CONSENSUS ALGORITHM OVER GEOMETRIC GRAPHS RESISTANCE-BASED PERFORMANCE ANALYSIS OF THE CONSENSUS ALGORITHM OVER GEOMETRIC GRAPHS ENRICO LOVISARI, FEDERICA GARIN, AND SANDRO ZAMPIERI Abstract. The performance of the linear consensus algorithm is

More information

ELEMENTS OF PROBABILITY THEORY

ELEMENTS OF PROBABILITY THEORY ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable

More information

arxiv: v3 [math.pr] 18 Aug 2017

arxiv: v3 [math.pr] 18 Aug 2017 Sparse Exchangeable Graphs and Their Limits via Graphon Processes arxiv:1601.07134v3 [math.pr] 18 Aug 2017 Christian Borgs Microsoft Research One Memorial Drive Cambridge, MA 02142, USA Jennifer T. Chayes

More information

High-speed Flight in an Ergodic Forest

High-speed Flight in an Ergodic Forest 1 High-speed Flight in an Ergodic Forest Sertac Karaman Emilio Frazzoli arxiv:122.253v1 [cs.ro] 1 Feb 212 Abstract Inspired by birds flying through cluttered environments such as dense forests, this paper

More information

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS PROBABILITY: LIMIT THEOREMS II, SPRING 218. HOMEWORK PROBLEMS PROF. YURI BAKHTIN Instructions. You are allowed to work on solutions in groups, but you are required to write up solutions on your own. Please

More information

Renormalization: An Attack on Critical Exponents

Renormalization: An Attack on Critical Exponents Renormalization: An Attack on Critical Exponents Zebediah Engberg March 15, 2010 1 Introduction Suppose L R d is a lattice with critical probability p c. Percolation on L is significantly differs depending

More information

Virtual Robust Implementation and Strategic Revealed Preference

Virtual Robust Implementation and Strategic Revealed Preference and Strategic Revealed Preference Workshop of Mathematical Economics Celebrating the 60th birthday of Aloisio Araujo IMPA Rio de Janeiro December 2006 Denitions "implementation": requires ALL equilibria

More information

MA651 Topology. Lecture 10. Metric Spaces.

MA651 Topology. Lecture 10. Metric Spaces. MA65 Topology. Lecture 0. Metric Spaces. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Linear Algebra and Analysis by Marc Zamansky

More information

Random graphs: Random geometric graphs

Random graphs: Random geometric graphs Random graphs: Random geometric graphs Mathew Penrose (University of Bath) Oberwolfach workshop Stochastic analysis for Poisson point processes February 2013 athew Penrose (Bath), Oberwolfach February

More information

ON SCALAR CONSERVATION LAWS WITH POINT SOURCE AND STEFAN DIEHL

ON SCALAR CONSERVATION LAWS WITH POINT SOURCE AND STEFAN DIEHL ON SCALAR CONSERVATION LAWS WITH POINT SOURCE AND DISCONTINUOUS FLUX FUNCTION STEFAN DIEHL Abstract. The conservation law studied is @u(x;t) + @ F u(x; t); x @t @x = s(t)(x), where u is a f(u); x > 0 concentration,

More information

Solving models with (lots of) idiosyncratic risk

Solving models with (lots of) idiosyncratic risk Solving models with (lots of) idiosyncratic risk Wouter J. Den Haan November 8, 2009 Models with heterogeneous agents 1 Lots of idiosyncratic risk 2 If #2 leads to strong non-linearities in the policy

More information

Fractional Roman Domination

Fractional Roman Domination Chapter 6 Fractional Roman Domination It is important to discuss minimality of Roman domination functions before we get into the details of fractional version of Roman domination. Minimality of domination

More information

Economics of Networks Social Learning

Economics of Networks Social Learning Economics of Networks Social Learning Evan Sadler Massachusetts Institute of Technology Evan Sadler Social Learning 1/38 Agenda Recap of rational herding Observational learning in a network DeGroot learning

More information

them, and call the remaining sites empty. Then update this conguration in discrete

them, and call the remaining sites empty. Then update this conguration in discrete Bootstrap Percolation in a Polluted Environment Janko Gravner, Elaine McDonald 2 Revised version, October 996. To appear in Journal of Statistical Physics. Make a low density p of sites on the lattice

More information

Acta Universitatis Carolinae. Mathematica et Physica

Acta Universitatis Carolinae. Mathematica et Physica Acta Universitatis Carolinae. Mathematica et Physica František Žák Representation form of de Finetti theorem and application to convexity Acta Universitatis Carolinae. Mathematica et Physica, Vol. 52 (2011),

More information

Finite Metric Spaces & Their Embeddings: Introduction and Basic Tools

Finite Metric Spaces & Their Embeddings: Introduction and Basic Tools Finite Metric Spaces & Their Embeddings: Introduction and Basic Tools Manor Mendel, CMI, Caltech 1 Finite Metric Spaces Definition of (semi) metric. (M, ρ): M a (finite) set of points. ρ a distance function

More information

The parabolic Anderson model on Z d with time-dependent potential: Frank s works

The parabolic Anderson model on Z d with time-dependent potential: Frank s works Weierstrass Institute for Applied Analysis and Stochastics The parabolic Anderson model on Z d with time-dependent potential: Frank s works Based on Frank s works 2006 2016 jointly with Dirk Erhard (Warwick),

More information

Stable Poisson Graphs in One Dimension

Stable Poisson Graphs in One Dimension Stable Poisson Graphs in One Dimension Maria Deijfen Alexander E. Holroyd Yuval Peres April 2011 Abstract Let each point of a homogeneous Poisson process on R independently be equipped with a random number

More information

A large deviation principle for a RWRC in a box

A large deviation principle for a RWRC in a box A large deviation principle for a RWRC in a box 7th Cornell Probability Summer School Michele Salvi TU Berlin July 12, 2011 Michele Salvi (TU Berlin) An LDP for a RWRC in a nite box July 12, 2011 1 / 15

More information

ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES

ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XL 2002 ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES by Joanna Jaroszewska Abstract. We study the asymptotic behaviour

More information

Neighbourhoods of Randomness and Independence

Neighbourhoods of Randomness and Independence Neighbourhoods of Randomness and Independence C.T.J. Dodson School of Mathematics, Manchester University Augment information geometric measures in spaces of distributions, via explicit geometric representations

More information

Geometric Inference for Probability distributions

Geometric Inference for Probability distributions Geometric Inference for Probability distributions F. Chazal 1 D. Cohen-Steiner 2 Q. Mérigot 2 1 Geometrica, INRIA Saclay, 2 Geometrica, INRIA Sophia-Antipolis 2009 July 8 F. Chazal, D. Cohen-Steiner, Q.

More information

Necessary and sufficient conditions for strong R-positivity

Necessary and sufficient conditions for strong R-positivity Necessary and sufficient conditions for strong R-positivity Wednesday, November 29th, 2017 The Perron-Frobenius theorem Let A = (A(x, y)) x,y S be a nonnegative matrix indexed by a countable set S. We

More information

ABSTRACT CONDITIONAL EXPECTATION IN L 2

ABSTRACT CONDITIONAL EXPECTATION IN L 2 ABSTRACT CONDITIONAL EXPECTATION IN L 2 Abstract. We prove that conditional expecations exist in the L 2 case. The L 2 treatment also gives us a geometric interpretation for conditional expectation. 1.

More information

Visibility estimates in Euclidean and hyperbolic germ-grain models and line tessellations

Visibility estimates in Euclidean and hyperbolic germ-grain models and line tessellations Visibility estimates in Euclidean and hyperbolic germ-grain models and line tessellations Pierre Calka Lille, Stochastic Geometry Workshop, 30 March 2011 Outline Visibility in the vacancy of the Boolean

More information

Probability Models of Information Exchange on Networks Lecture 6

Probability Models of Information Exchange on Networks Lecture 6 Probability Models of Information Exchange on Networks Lecture 6 UC Berkeley Many Other Models There are many models of information exchange on networks. Q: Which model to chose? My answer good features

More information

Coarse Geometry. Phanuel Mariano. Fall S.i.g.m.a. Seminar. Why Coarse Geometry? Coarse Invariants A Coarse Equivalence to R 1

Coarse Geometry. Phanuel Mariano. Fall S.i.g.m.a. Seminar. Why Coarse Geometry? Coarse Invariants A Coarse Equivalence to R 1 Coarse Geometry 1 1 University of Connecticut Fall 2014 - S.i.g.m.a. Seminar Outline 1 Motivation 2 3 The partition space P ([a, b]). Preliminaries Main Result 4 Outline Basic Problem 1 Motivation 2 3

More information

Some percolation processes with infinite range dependencies

Some percolation processes with infinite range dependencies Some percolation processes with infinite range dependencies Marcelo Hilário UFMG (Belo Horizonte) and Unige (Genève) partialy joint with H. Duminil-Copin (Genève), G. Kozma (Tel-Aviv), V. Sidoravicius

More information

Weak convergence. Amsterdam, 13 November Leiden University. Limit theorems. Shota Gugushvili. Generalities. Criteria

Weak convergence. Amsterdam, 13 November Leiden University. Limit theorems. Shota Gugushvili. Generalities. Criteria Weak Leiden University Amsterdam, 13 November 2013 Outline 1 2 3 4 5 6 7 Definition Definition Let µ, µ 1, µ 2,... be probability measures on (R, B). It is said that µ n converges weakly to µ, and we then

More information

Almost Sure Convergence of a Sequence of Random Variables

Almost Sure Convergence of a Sequence of Random Variables Almost Sure Convergence of a Sequence of Random Variables (...for people who haven t had measure theory.) 1 Preliminaries 1.1 The Measure of a Set (Informal) Consider the set A IR 2 as depicted below.

More information

FUNCTIONAL ANALYSIS LECTURE NOTES: WEAK AND WEAK* CONVERGENCE

FUNCTIONAL ANALYSIS LECTURE NOTES: WEAK AND WEAK* CONVERGENCE FUNCTIONAL ANALYSIS LECTURE NOTES: WEAK AND WEAK* CONVERGENCE CHRISTOPHER HEIL 1. Weak and Weak* Convergence of Vectors Definition 1.1. Let X be a normed linear space, and let x n, x X. a. We say that

More information

arxiv: v1 [math.pr] 11 Dec 2017

arxiv: v1 [math.pr] 11 Dec 2017 Local limits of spatial Gibbs random graphs Eric Ossami Endo Department of Applied Mathematics eric@ime.usp.br Institute of Mathematics and Statistics - IME USP - University of São Paulo Johann Bernoulli

More information

On the errors introduced by the naive Bayes independence assumption

On the errors introduced by the naive Bayes independence assumption On the errors introduced by the naive Bayes independence assumption Author Matthijs de Wachter 3671100 Utrecht University Master Thesis Artificial Intelligence Supervisor Dr. Silja Renooij Department of

More information

Notes on Iterated Expectations Stephen Morris February 2002

Notes on Iterated Expectations Stephen Morris February 2002 Notes on Iterated Expectations Stephen Morris February 2002 1. Introduction Consider the following sequence of numbers. Individual 1's expectation of random variable X; individual 2's expectation of individual

More information