Holme and Newman (2006) Evolving voter model. Extreme Cases. Community sizes N =3200, M =6400, γ =10. Our model: continuous time. Finite size scaling
|
|
- Nathaniel Newton
- 5 years ago
- Views:
Transcription
1 Evolving voter model Rick Durrett 1, James Gleeson 5, Alun Lloyd 4, Peter Mucha 3, Bill Shi 3, David Sivakoff 1, Josh Socolar 2,andChris Varghese 2 1. Duke Math, 2. Duke Physics, 3. UNC Math, 4. NC State Math, 5. MACSI, U of Limerick, Ireland A result of the SAMSI program on complex networks PNAS 19 (212) Holme and Newman (26) TheybeginwithanetworkofN nodes and M edges, where each node x has an opinion ξ(x) fromasetofg possible opinions and the number of people per opinion γ N = N/G stays bounded as N gets large. On each step a vertex x is picked at random. If its degree d(x) =, nothing happens. If d(x) >, (i) with probability an edge attached to vertex x is selected and the other end of that edge is moved to a vertex chosen at random from those with opinion ξ(x). (ii) otherwise (i.e., with probability 1 ) a random neighbor y of x is selected and the opinion of x is set to ξ(y). Eventually there are no edges that connect different opinions and the system freezes at time τ N. Durrett (Duke) MBI 4/2/212 1/34 Durrett (Duke) MBI 4/2/212 2/34 Extreme Cases Community sizes N =32, M =64, γ =1. When =1only rewiring steps occur, so once all of the M edges have been touched the graph has been disconnected into G components, each of which is small. By results for the coupon collector s problem, τ N M log M updates. When φ =this is a voter model on a static graph. Ifweusean Erdös-Renyi random graph in which each vertex has average degree λ>1 then there is a giant component with a positive fraction of the vertices and a large number of small components with size O(log N). The giant component will reach consensus after τ N = O(N 2 ) updates, so the end result is one opinion with a large number of followers while all of the other populations are small. Durrett (Duke) MBI 4/2/212 3/34 Durrett (Duke) MBI 4/2/212 4/34 Finite size scaling Our model: continuous time Events happen on each oriented edge (x, y) at times of a rate one Poisson process. (Isothermal voter model.) N 2 updates time N. If the voters at the two ends of the edge agree then we do nothing. If they disagree, then with probability 1 the voter at x adopts the opinion of the voter at y. With probability, x breaks its connection to y and makes a new connection to a voter chosen at random: (i) from all of the vertices in the graph rewire to random, (ii) from those that share its opinion rewire to same. Opinions {, 1}. Initial state product measure with density u. Durrett (Duke) MBI 4/2/212 5/34 Durrett (Duke) MBI 4/2/212 6/34
2 Rewire to random with u =1/2 Rewire to random: A universal curve? Number in minority Fraction in minority state initial fraction =.5 initial fraction =.1 initial fraction =.25 initial fraction = Figure: Erdos-Renyi, λ =4,N = 1, Figure: Critical value c (u) depends on u, butwhen< c (u) minority fraction agrees with curve for u =1/2. Durrett (Duke) MBI 4/2/212 7/34 Durrett (Duke) MBI 4/2/212 8/34 Rewire to same: discontinuous transition The simulation that showed us the answer.5 N=1, p=.4, u=.5, =.3, Rewire to Random initial fraction =.5 initial fraction =.1 initial fraction =.25 initial fraction =.5 minority fraction Fraction in Minority State N actual time Figure: N = 1, λ =4,u =1/2, Initial N 1 = 1. Durrett (Duke) MBI 4/2/212 9/34 Durrett (Duke) MBI 4/2/212 1 / 34 Holley and Liggett (1975) Cox and Greven (199) Consider the voter model on the d-dimensional integer lattice Z d in which each vertex decides to change its opinion at rate 1, and when it does, it adopts the opinion of one of its 2d nearest neighbors chosen at random. In d 2, the system approaches complete consensus. That is if x y then P(ξ t (x) ξ t (y)). In d 3ifwestartfromξ p product measure with density p, i.e., ξp (x) are independent and equal to 1 with probability then ξt p converges in distribution to a limit ν p, which is a stationary distribution for the voter model. The voter model on the torus in d 3attimeNt then it locally looks like ν θ(t) where the density changes according to the Wright-Fisher diffusion: dθ t = β d 2θ t (1 θ t )db t The quantity under the square root is the fraction of discordant edges under ν θ(t). There is a one parameter family of quasi-stationary distributions, and the parameter changes according to a diffusion. quasi-stationary since in the finite voter model all s and all 1 s are absorbing. Durrett (Duke) MBI 4/2/ / 34 Durrett (Duke) MBI 4/2/ / 34
3 N 1 versus N 1, =.5 Graph fission for =.65 Figure: Process comes quickly to the arch then diffuses along it, splitting into two when it reaches the end. Durrett (Duke) MBI 4/2/ / 34 Durrett (Duke) MBI 4/2/ / 34 Finite dim. distr. on a random graph N 1 versus N 1, =.5 A definition from the theory of graph limits of Lovasz et al. N ijk is the number of homomorphisms from the labeled graph i j k a b c into our labeled graph (G,ξ). When i =,j =1,k =everytripleis counted twice but this seems like the natural definition. Durrett (Duke) MBI 4/2/ / 34 Durrett (Duke) MBI 4/2/ / 34 N ijk are polynomials? Evolution Equations Bill Shi s simulations for λ =4, =.5 N 1 = 3.42x x.38 N 11 = 13.53x x x.3 N 1 =13.54x x x 1.77 N 11 = 1.14x x x +.8 N 1 =1.15x x x 1.2 N 11 (x) =N 1 (1 x), N 11 (x) =N 1 (1 x) dn 1 = (2 )N 1 +(1 )[N 1 N 1 + N 11 N 11 ] dt 1 dn 11 =(1 (1 u))n 1 +(1 )[N 11 N 11 ] 2 dt 1 dn =(1 u)n 1 +(1 )[N 1 N 1 ] 2 dt Of course N 11 +2N 1 + N = M, the number of edges. N ijk = d(y)(d(y) 1) y d dt ijk ijk N ijk = 2[N 11 + N 1 + N 1 + N 11 ]+4N 1 M N Durrett (Duke) MBI 4/2/ / 34 Durrett (Duke) MBI 4/2/ / 34
4 One equation short Arches for rewire to random When λ =4, =.5 from equations from simulation N 11 /N 1 (2a 3 +2b 3 ) 2b 3 u u N 1 /N 1 2a 3 +2b 3 u u N 11 /N 1 (2a 3 +2b 3 +1) (2b 3 1)u u N 1 /N 1 (2a 3 +2)+(2b 3 1)u u From (d/dt) ijk N ijk = we get 2λ(1 ) =4a b 3 Equations and simulation agree if 2a 3 =2.73 and 2b 3 = Durrett (Duke) MBI 4/2/ / 34 Durrett (Duke) MBI 4/2/212 2 / 34 Arches for rewire to same Why do the arches behave differently in the two versions of the model? Figure: Note that constant term, explaining discontinuous distribution. Durrett (Duke) MBI 4/2/ / 34 Durrett (Duke) MBI 4/2/ / 34 Extensions Degree distribution Poisson? N = 1 5 =.6 u = γ = We get the same result if we start with a random 4-regular graph OR if we designate un vertices as 1 and (1 u)n as and connect an i node to a j node with probability p ij /N. Inthesecondcasebychoosingthep ij correctly we can achieve any possible value of N 1 /N and N 1 /M where M = λn/2. For these initial conditions we quickly move to the arch of quasistationary distributions. p k simulation Poisson(4) k Durrett (Duke) MBI 4/2/ / 34 Durrett (Duke) MBI 4/2/ / 34
5 Poisson iff fraction of neighbors is constant Fraction of degree k nodes =1 N=1 5, =.6, u=.5, γ =.17, Average over 1 trials q k /p k.14 γ k Durrett (Duke) MBI 4/2/ / 34 Durrett (Duke) MBI 4/2/ / 34 Open Problems Prove quasi-stationary distributions exist when is small. When = we know the quasi-stationary distributions for the voter model, so it is natural to try a perturbation argument. However when we consider (G,ξ)forthevotermodeltheG does not change. Singular perturbation problem. Work with Jonathan Mattingly and David Sivakoff. First step: understand lim which is systemwith =. Answer: rewire, voter model equilibrates, rewire again. Harder second step: There is a unique stationary distribution on the space of graphs with N vertices and M edges. Conjecture. Intherewiretorandommodelif< c (1/2) and v() < u 1/2 then starting from product measure with a density u of 1 s, the evolving voter model converges rapidly to a quasi-stationary distribution ν,u. At time tn the evolving voter model looks locally like ν,θ(t) where the density changes according to a generalized Wright-Fisher diffusion process dθ t = (1 )[c θ t (1 θ t ) b ]db t until θ t reaches v() or 1 v(). Rewire to same is similar but b =. What happens with more than two initial types? Durrett (Duke) MBI 4/2/ / 34 Durrett (Duke) MBI 4/2/ / 34 Arch is c (1 i u2 i )/2 b for same c, b? c and b as a function of β = /(1 ) Generator L = V + βr, Voter, Rewire 5.2 # discordant edges c() y =.51*x /1 b() y =.26*x / Figure: Conjecture. c = a +2bβ, b = bβ Linear in β, not a power series. Durrett (Duke) MBI 4/2/ / 34 Durrett (Duke) MBI 4/2/212 3 / 34
6 Infinitely many phase transitions Higher order statistics Suppose c = a +2bβ, b = bβ, β = 1 If there are k opinions the smallest value of 1 i u2 i is 1 1/k N = c 2 (1 1/k) b This is when β k = a(k 1)/2b. (needs2b and b). a =1.3, b =.25 k =2,β 2 =2.6, 2 = β 2 /(1 + β 2 )=.72 k =3,β 3 =5.2, 3 =.84 k is the critical value for starting with k types. If we start with a large number types then for < 2 we may end up with two or more types at the end, but if 2 << 3 we will always end up with three or more, etc. = y = N 1 /N versus x = N 1 /N.1 y =8.3256x x x y =8.3574x x x y =8.696x x x y =8.9222x x x y =9.9584x x x y = x x x y = x x x ax(1 x) 2 + bx(1 x) =ax 3 (2a + b)x 2 +(a + b)x a = c λ p(x y z) b = c λ p(xz y) c λ = x d x(d x 1)/N, p coalesce probs averaged over triples Durrett (Duke) MBI 4/2/ / 34 Durrett (Duke) MBI 4/2/ / 34 N 1 Coefficients Quadratic: Constant Term Exactly solvable model?.5 data 1 quadratic y =.18*x 2.75*x.51 Graph statistics N 1, N 1, N 1, etc. are polynomials in u and β Unfortunately there does not seem to be a dual for the evolving voter model N 1 N 1 =(1+βu)N 1 Durrett (Duke) MBI 4/2/ / 34 Durrett (Duke) MBI 4/2/ / 34
Latent voter model on random regular graphs
Latent voter model on random regular graphs Shirshendu Chatterjee Cornell University (visiting Duke U.) Work in progress with Rick Durrett April 25, 2011 Outline Definition of voter model and duality with
More informationSpatial Evolutionary Games
Spatial Evolutionary Games Rick Durrett (Duke) ASU 4/10/14 1 / 27 Almost 20 years ago R. Durrett and Simon Levin. The importance of being discrete (and spatial). Theoret. Pop. Biol. 46 (1994), 363-394
More information3. The Voter Model. David Aldous. June 20, 2012
3. The Voter Model David Aldous June 20, 2012 We now move on to the voter model, which (compared to the averaging model) has a more substantial literature in the finite setting, so what s written here
More informationThe Evolving Voter Model on Thick Graphs
The Evolving Voter Model on Thick Graphs Anirban Basak, Rick Durrett, and Yuan Zhang Dept. of Math, Duke U., Durham, NC 27708-0320 June 27, 2016 Abstract In the evolving voter model, when an individual
More informationCoarsening process in the 2d voter model
Alessandro Tartaglia (LPTHE) Coarsening in the 2d voter model May 8, 2015 1 / 34 Coarsening process in the 2d voter model Alessandro Tartaglia LPTHE, Université Pierre et Marie Curie alessandro.tartaglia91@gmail.com
More informationErdős-Renyi random graphs basics
Erdős-Renyi random graphs basics Nathanaël Berestycki U.B.C. - class on percolation We take n vertices and a number p = p(n) with < p < 1. Let G(n, p(n)) be the graph such that there is an edge between
More informationCoupling. 2/3/2010 and 2/5/2010
Coupling 2/3/2010 and 2/5/2010 1 Introduction Consider the move to middle shuffle where a card from the top is placed uniformly at random at a position in the deck. It is easy to see that this Markov Chain
More informationLecture 06 01/31/ Proofs for emergence of giant component
M375T/M396C: Topics in Complex Networks Spring 2013 Lecture 06 01/31/13 Lecturer: Ravi Srinivasan Scribe: Tianran Geng 6.1 Proofs for emergence of giant component We now sketch the main ideas underlying
More informationRandom Networks. Complex Networks CSYS/MATH 303, Spring, Prof. Peter Dodds
Complex Networks CSYS/MATH 303, Spring, 2011 Prof. Peter Dodds Department of Mathematics & Statistics Center for Complex Systems Vermont Advanced Computing Center University of Vermont Licensed under the
More informationGroup Formation: Fragmentation Transitions in Network Coevolution Dynamics
- Mallorca - Spain Workshop on Challenges and Visions in the Social Sciences, ETH August 08 Group Formation: Fragmentation Transitions in Network Coevolution Dynamics MAXI SAN MIGUEL CO-EVOLUTION Dynamics
More informationLatent Voter Model on Locally Tree-Like Random Graphs
Latent Voter Model on Locally Tree-Like Random Graphs Ran Huo and Rick Durrett Dept. of Math, Duke U., P.O. Box 932, Durham, NC 2778-32 March 11, 217 Abstract In the latent voter model, which models the
More informationCoupling AMS Short Course
Coupling AMS Short Course January 2010 Distance If µ and ν are two probability distributions on a set Ω, then the total variation distance between µ and ν is Example. Let Ω = {0, 1}, and set Then d TV
More informationThe Beginning of Graph Theory. Theory and Applications of Complex Networks. Eulerian paths. Graph Theory. Class Three. College of the Atlantic
Theory and Applications of Complex Networs 1 Theory and Applications of Complex Networs 2 Theory and Applications of Complex Networs Class Three The Beginning of Graph Theory Leonhard Euler wonders, can
More informationCHAPTER 3 Further properties of splines and B-splines
CHAPTER 3 Further properties of splines and B-splines In Chapter 2 we established some of the most elementary properties of B-splines. In this chapter our focus is on the question What kind of functions
More informationOberwolfach workshop on Combinatorics and Probability
Apr 2009 Oberwolfach workshop on Combinatorics and Probability 1 Describes a sharp transition in the convergence of finite ergodic Markov chains to stationarity. Steady convergence it takes a while to
More informationThe Dynamics of Consensus and Clash
The Dynamics of Consensus and Clash Annual CNLS Conference 2006 Question: How do generic opinion dynamics models with (quasi)-ferromagnetic interactions evolve? Models: Voter model on heterogeneous graphs
More information7.1 Coupling from the Past
Georgia Tech Fall 2006 Markov Chain Monte Carlo Methods Lecture 7: September 12, 2006 Coupling from the Past Eric Vigoda 7.1 Coupling from the Past 7.1.1 Introduction We saw in the last lecture how Markov
More informationNP-Hardness reductions
NP-Hardness reductions Definition: P is the class of problems that can be solved in polynomial time, that is n c for a constant c Roughly, if a problem is in P then it's easy, and if it's not in P then
More informationSolutions 2016 AB Exam
Solutions 206 AB Exam Texas A&M High School Math Contest October 22, 206. If (x, y) is a point on the circle x 2 + y 2 = and the distance from (x, y) to (0, ) is 6 5, what is the value of y? ANSWER: 7
More informationCollective Phenomena in Complex Social Networks
Collective Phenomena in Complex Social Networks Federico Vazquez, Juan Carlos González-Avella, Víctor M. Eguíluz and Maxi San Miguel. Abstract The problem of social consensus is approached from the perspective
More informationQ520: Answers to the Homework on Hopfield Networks. 1. For each of the following, answer true or false with an explanation:
Q50: Answers to the Homework on Hopfield Networks 1. For each of the following, answer true or false with an explanation: a. Fix a Hopfield net. If o and o are neighboring observation patterns then Φ(
More informationPartial Fractions. Combining fractions over a common denominator is a familiar operation from algebra: 2 x 3 + 3
Partial Fractions Combining fractions over a common denominator is a familiar operation from algebra: x 3 + 3 x + x + 3x 7 () x 3 3x + x 3 From the standpoint of integration, the left side of Equation
More informationRandom Networks. Complex Networks, CSYS/MATH 303, Spring, Prof. Peter Dodds
Complex Networks, CSYS/MATH 303, Spring, 2010 Prof. Peter Dodds Department of Mathematics & Statistics Center for Complex Systems Vermont Advanced Computing Center University of Vermont Licensed under
More informationChapter III. Unconstrained Univariate Optimization
1 Chapter III Unconstrained Univariate Optimization Introduction Interval Elimination Methods Polynomial Approximation Methods Newton s Method Quasi-Newton Methods 1 INTRODUCTION 2 1 Introduction Univariate
More informationSusceptible-Infective-Removed Epidemics and Erdős-Rényi random
Susceptible-Infective-Removed Epidemics and Erdős-Rényi random graphs MSR-Inria Joint Centre October 13, 2015 SIR epidemics: the Reed-Frost model Individuals i [n] when infected, attempt to infect all
More informationAlmost giant clusters for percolation on large trees
for percolation on large trees Institut für Mathematik Universität Zürich Erdős-Rényi random graph model in supercritical regime G n = complete graph with n vertices Bond percolation with parameter p(n)
More informationGraph Detection and Estimation Theory
Introduction Detection Estimation Graph Detection and Estimation Theory (and algorithms, and applications) Patrick J. Wolfe Statistics and Information Sciences Laboratory (SISL) School of Engineering and
More informationUNC Charlotte Super Competition Level 3 Test March 4, 2019 Test with Solutions for Sponsors
. Find the minimum value of the function f (x) x 2 + (A) 6 (B) 3 6 (C) 4 Solution. We have f (x) x 2 + + x 2 + (D) 3 4, which is equivalent to x 0. x 2 + (E) x 2 +, x R. x 2 + 2 (x 2 + ) 2. How many solutions
More informationarxiv: v1 [math.pr] 6 Jan 2016
Stochastic spatial model for the division of labor in social insects arxiv:60.0023v [math.pr] 6 Jan 206. Introduction Alesandro Arcuri and Nicolas Lanchier Abstract Motivated by the study of social insects,
More information1. Which one of the following points is a singular point of. f(x) = (x 1) 2/3? f(x) = 3x 3 4x 2 5x + 6? (C)
Math 1120 Calculus Test 3 November 4, 1 Name In the first 10 problems, each part counts 5 points (total 50 points) and the final three problems count 20 points each Multiple choice section Circle the correct
More informationLesson 7.1 Polynomial Degree and Finite Differences
Lesson 7.1 Polynomial Degree and Finite Differences 1. Identify the degree of each polynomial. a. 3x 4 2x 3 3x 2 x 7 b. x 1 c. 0.2x 1.x 2 3.2x 3 d. 20 16x 2 20x e. x x 2 x 3 x 4 x f. x 2 6x 2x 6 3x 4 8
More informationOpinion Dynamics in Social Networks: A Local Interaction Game with Stubborn Agents
Opinion Dynamics in Social Networks: A Local Interaction Game with Stubborn Agents Javad Ghaderi and R. Srikant Department of ECE and Coordinated Science Lab. arxiv:208.5076v [cs.gt] 24 Aug 202 University
More information3.2 Configuration model
3.2 Configuration model 3.2.1 Definition. Basic properties Assume that the vector d = (d 1,..., d n ) is graphical, i.e., there exits a graph on n vertices such that vertex 1 has degree d 1, vertex 2 has
More information6.207/14.15: Networks Lecture 12: Generalized Random Graphs
6.207/14.15: Networks Lecture 12: Generalized Random Graphs 1 Outline Small-world model Growing random networks Power-law degree distributions: Rich-Get-Richer effects Models: Uniform attachment model
More informationSocial network analysis: social learning
Social network analysis: social learning Donglei Du (ddu@unb.edu) Faculty of Business Administration, University of New Brunswick, NB Canada Fredericton E3B 9Y2 October 20, 2016 Donglei Du (UNB) AlgoTrading
More informationMath 3 Variable Manipulation Part 3 Polynomials A
Math 3 Variable Manipulation Part 3 Polynomials A 1 MATH 1 & 2 REVIEW: VOCABULARY Constant: A term that does not have a variable is called a constant. Example: the number 5 is a constant because it does
More informationChapter 8 ~ Quadratic Functions and Equations In this chapter you will study... You can use these skills...
Chapter 8 ~ Quadratic Functions and Equations In this chapter you will study... identifying and graphing quadratic functions transforming quadratic equations solving quadratic equations using factoring
More informationProbability Models of Information Exchange on Networks Lecture 2. Elchanan Mossel UC Berkeley All rights reserved
Probability Models of Information Exchange on Networks Lecture 2 Elchanan Mossel UC Berkeley All rights reserved Lecture Plan We will see the first simple models of information exchange on networks. Assumptions:
More information5 Quiver Representations
5 Quiver Representations 5. Problems Problem 5.. Field embeddings. Recall that k(y,..., y m ) denotes the field of rational functions of y,..., y m over a field k. Let f : k[x,..., x n ] k(y,..., y m )
More information7.0: Minimax approximations
7.0: Minimax approximations In this section we study the problem min f p = min max f(x) p(x) p A p A x [a,b] where f C[a, b] and A is a linear subspace of C[a, b]. Let p be a trial solution (e.g. a guess)
More informationThe arithmetic geometric mean (Agm)
The arithmetic geometric mean () Pictures by David Lehavi This is part of exercise 5 question 4 in myc> calculus class Fall 200: a = c a n+ =5a n 2 lim n an = a = a an + bn a n+ = 2 b = b b n+ = a nb n
More informationw i w j = w i k w k i 1/(β 1) κ β 1 β 2 n(β 2)/(β 1) wi 2 κ 2 i 2/(β 1) κ 2 β 1 β 3 n(β 3)/(β 1) (2.2.1) (β 2) 2 β 3 n 1/(β 1) = d
38 2.2 Chung-Lu model This model is specified by a collection of weights w =(w 1,...,w n ) that represent the expected degree sequence. The probability of an edge between i to is w i w / k w k. They allow
More informationCh. 7.6 Squares, Squaring & Parabolas
Ch. 7.6 Squares, Squaring & Parabolas Learning Intentions: Learn about the squaring & square root function. Graph parabolas. Compare the squaring function with other functions. Relate the squaring function
More informationEndowed with an Extra Sense : Mathematics and Evolution
Endowed with an Extra Sense : Mathematics and Evolution Todd Parsons Laboratoire de Probabilités et Modèles Aléatoires - Université Pierre et Marie Curie Center for Interdisciplinary Research in Biology
More informationExplosive Percolation in Erdős-Rényi-Like Random Graph Processes
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes Konstantinos Panagiotou a,1 Reto Spöhel a,1,4 Angelika Steger b,2 Henning Thomas b,2,3 a Max Planck Institute for Informatics, 66123 Saarbrücken,
More information= 10 such triples. If it is 5, there is = 1 such triple. Therefore, there are a total of = 46 such triples.
. Two externally tangent unit circles are constructed inside square ABCD, one tangent to AB and AD, the other to BC and CD. Compute the length of AB. Answer: + Solution: Observe that the diagonal of the
More informationAssessment Exemplars: Polynomials, Radical and Rational Functions & Equations
Class: Date: Assessment Exemplars: Polynomials, Radical and Rational Functions & Equations 1 Express the following polynomial function in factored form: P( x) = 10x 3 + x 2 52x + 20 2 SE: Express the following
More informationGet acquainted with the computer program, The Quadratic Transformer. When you're satisfied that you understand how it works, try the tasks below.
Weaving a Parabola Web with the Quadratic Transformer In this activity, you explore how the graph of a quadratic function and its symbolic expression relate to each other. You start with a set of four
More informationMULTIPLYING TRINOMIALS
Name: Date: 1 Math 2 Variable Manipulation Part 4 Polynomials B MULTIPLYING TRINOMIALS Multiplying trinomials is the same process as multiplying binomials except for there are more terms to multiply than
More informationComponent structure of the vacant set induced by a random walk on a random graph. Colin Cooper (KCL) Alan Frieze (CMU)
Component structure of the vacant set induced by a random walk on a random graph Colin Cooper (KCL) Alan Frieze (CMU) Vacant set definition and results Introduction: random walks and cover time G n,p vacant
More informationModule 2: Reflecting on One s Problems
MATH55 Module : Reflecting on One s Problems Main Math concepts: Translations, Reflections, Graphs of Equations, Symmetry Auxiliary ideas: Working with quadratics, Mobius maps, Calculus, Inverses I. Transformations
More informationCHAPTER 2 POLYNOMIALS KEY POINTS
CHAPTER POLYNOMIALS KEY POINTS 1. Polynomials of degrees 1, and 3 are called linear, quadratic and cubic polynomials respectively.. A quadratic polynomial in x with real coefficient is of the form a x
More informationMath 473: Practice Problems for Test 1, Fall 2011, SOLUTIONS
Math 473: Practice Problems for Test 1, Fall 011, SOLUTIONS Show your work: 1. (a) Compute the Taylor polynomials P n (x) for f(x) = sin x and x 0 = 0. Solution: Compute f(x) = sin x, f (x) = cos x, f
More informationThe Smoothed Analysis of Algorithms. Daniel A. Spielman. Program in Applied Mathematics Yale University
The Smoothed Analysis of Algorithms Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale University Outline Why? Definitions (by formula, by picture, by example) Examples: Perceptron
More informationOriented majority-vote model in social dynamics
Author: Facultat de Física, Universitat de Barcelona, Diagonal 645, 08028 Barcelona, Spain. Advisor: M. Ángeles Serrano Mass events ruled by collective behaviour are present in our society every day. Some
More informationMath123 Lecture 1. Dr. Robert C. Busby. Lecturer: Office: Korman 266 Phone :
Lecturer: Math1 Lecture 1 Dr. Robert C. Busby Office: Korman 66 Phone : 15-895-1957 Email: rbusby@mcs.drexel.edu Course Web Site: http://www.mcs.drexel.edu/classes/calculus/math1_spring0/ (Links are case
More informationThe large deviation principle for the Erdős-Rényi random graph
The large deviation principle for the Erdős-Rényi random graph (Courant Institute, NYU) joint work with S. R. S. Varadhan Main objective: how to count graphs with a given property Only consider finite
More informationCSC 5170: Theory of Computational Complexity Lecture 4 The Chinese University of Hong Kong 1 February 2010
CSC 5170: Theory of Computational Complexity Lecture 4 The Chinese University of Hong Kong 1 February 2010 Computational complexity studies the amount of resources necessary to perform given computations.
More informationSince x + we get x² + 2x = 4, or simplifying it, x² = 4. Therefore, x² + = 4 2 = 2. Ans. (C)
SAT II - Math Level 2 Test #01 Solution 1. x + = 2, then x² + = Since x + = 2, by squaring both side of the equation, (A) - (B) 0 (C) 2 (D) 4 (E) -2 we get x² + 2x 1 + 1 = 4, or simplifying it, x² + 2
More informationSymmetric Rendezvous in Graphs: Deterministic Approaches
Symmetric Rendezvous in Graphs: Deterministic Approaches Shantanu Das Technion, Haifa, Israel http://www.bitvalve.org/~sdas/pres/rendezvous_lorentz.pdf Coauthors: Jérémie Chalopin, Adrian Kosowski, Peter
More informationTable of contents. Polynomials Quadratic Functions Polynomials Graphs of Polynomials Polynomial Division Finding Roots of Polynomials
Table of contents Quadratic Functions Graphs of Polynomial Division Finding Roots of Jakayla Robbins & Beth Kelly (UK) Precalculus Notes Fall 2010 1 / 65 Concepts Quadratic Functions The Definition of
More information18.S34 (FALL 2007) PROBLEMS ON ROOTS OF POLYNOMIALS
18.S34 (FALL 2007) PROBLEMS ON ROOTS OF POLYNOMIALS Note. The terms root and zero of a polynomial are synonyms. Those problems which appeared on the Putnam Exam are stated as they appeared verbatim (except
More informationThe diameter of a long-range percolation graph
The diameter of a long-range percolation graph Don Coppersmith David Gamarnik Maxim Sviridenko Abstract We consider the following long-range percolation model: an undirected graph with the node set {0,,...,
More informationECS 289 F / MAE 298, Lecture 15 May 20, Diffusion, Cascades and Influence
ECS 289 F / MAE 298, Lecture 15 May 20, 2014 Diffusion, Cascades and Influence Diffusion and cascades in networks (Nodes in one of two states) Viruses (human and computer) contact processes epidemic thresholds
More informationPropp-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 informationMath Numerical Analysis
Math 541 - Numerical Analysis Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center San Diego State University
More informationAsymptotic Analysis. Slides by Carl Kingsford. Jan. 27, AD Chapter 2
Asymptotic Analysis Slides by Carl Kingsford Jan. 27, 2014 AD Chapter 2 Independent Set Definition (Independent Set). Given a graph G = (V, E) an independent set is a set S V if no two nodes in S are joined
More informationRoot system chip-firing
Root system chip-firing PhD Thesis Defense Sam Hopkins Massachusetts Institute of Technology April 27th, 2018 Includes joint work with Pavel Galashin, Thomas McConville, Alexander Postnikov, and James
More informationAntiferromagnetic Potts models and random colorings
Antiferromagnetic Potts models and random colorings of planar graphs. joint with A.D. Sokal (New York) and R. Kotecký (Prague) October 9, 0 Gibbs measures Let G = (V, E) be a finite graph and let S be
More informationCONNECTING DATA WITH COMPETING OPINION MODELS
CONNECTING DATA WITH COMPETING OPINION MODELS Keith Burghardt with Prof. Michelle Girvan and Prof. Bill Rand Oct. 31, 2014 OUTLINE Introduction and background Motivation and empirical findings Description
More informationThe Minesweeper game: Percolation and Complexity
The Minesweeper game: Percolation and Complexity Elchanan Mossel Hebrew University of Jerusalem and Microsoft Research March 15, 2002 Abstract We study a model motivated by the minesweeper game In this
More informationMath 115 Spring 11 Written Homework 10 Solutions
Math 5 Spring Written Homework 0 Solutions. For following its, state what indeterminate form the its are in and evaluate the its. (a) 3x 4x 4 x x 8 Solution: This is in indeterminate form 0. Algebraically,
More informationA repeated root is a root that occurs more than once in a polynomial function.
Unit 2A, Lesson 3.3 Finding Zeros Synthetic division, along with your knowledge of end behavior and turning points, can be used to identify the x-intercepts of a polynomial function. This information allows
More information11.2 The Quadratic Formula
11.2 The Quadratic Formula Solving Quadratic Equations Using the Quadratic Formula. By solving the general quadratic equation ax 2 + bx + c = 0 using the method of completing the square, one can derive
More informationCSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010
CSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010 So far our notion of realistic computation has been completely deterministic: The Turing Machine
More informationTipping Points of Diehards in Social Consensus on Large Random Networks
Tipping Points of Diehards in Social Consensus on Large Random Networks W. Zhang, C. Lim, B. Szymanski Abstract We introduce the homogeneous pair approximation to the Naming Game (NG) model, establish
More informationChapter 2 notes from powerpoints
Chapter 2 notes from powerpoints Synthetic division and basic definitions Sections 1 and 2 Definition of a Polynomial Function: Let n be a nonnegative integer and let a n, a n-1,, a 2, a 1, a 0 be real
More informationCSCI3390-Second Test with Solutions
CSCI3390-Second Test with Solutions April 26, 2016 Each of the 15 parts of the problems below is worth 10 points, except for the more involved 4(d), which is worth 20. A perfect score is 100: if your score
More informationarxiv: v1 [math.pr] 1 Jan 2013
The role of dispersal in interacting patches subject to an Allee effect arxiv:1301.0125v1 [math.pr] 1 Jan 2013 1. Introduction N. Lanchier Abstract This article is concerned with a stochastic multi-patch
More informationGround states for exponential random graphs
Ground states for exponential random graphs Mei Yin Department of Mathematics, University of Denver March 5, 2018 We propose a perturbative method to estimate the normalization constant in exponential
More informationFirst-Order Ordinary Differntial Equations II: Autonomous Case. David Levermore Department of Mathematics University of Maryland.
First-Order Ordinary Differntial Equations II: Autonomous Case David Levermore Department of Mathematics University of Maryland 25 February 2009 These notes cover some of the material that we covered in
More informationSpreading and Opinion Dynamics in Social Networks
Spreading and Opinion Dynamics in Social Networks Gyorgy Korniss Rensselaer Polytechnic Institute 05/27/2013 1 Simple Models for Epidemiological and Social Contagion Susceptible-Infected-Susceptible (SIS)
More informationSTEP Support Programme. Pure STEP 3 Solutions
STEP Support Programme Pure STEP 3 Solutions S3 Q6 Preparation Completing the square on gives + + y, so the centre is at, and the radius is. First draw a sketch of y 4 3. This has roots at and, and you
More informationSolutions 2017 AB Exam
1. Solve for x : x 2 = 4 x. Solutions 2017 AB Exam Texas A&M High School Math Contest October 21, 2017 ANSWER: x = 3 Solution: x 2 = 4 x x 2 = 16 8x + x 2 x 2 9x + 18 = 0 (x 6)(x 3) = 0 x = 6, 3 but x
More informationPhase Transitions in Networks: Giant Components, Dynamic Networks, Combinatoric Solvability
in Networks: Giant Components, Dynamic Networks, Combinatoric Solvability Department of Physics UC Davis April 27, 2009 Outline Historical Prospective Old School New School Non-Physics 1 Historical Prospective
More informationThe chromatic number of random regular graphs
The chromatic number of random regular graphs Xavier Pérez Giménez Stochastics Numerics Seminar Models of random graphs Erdős & Rényi classic models (G n,p, G n,m ) Fixed degree sequence Regular graphs
More information4: The Pandemic process
4: The Pandemic process David Aldous July 12, 2012 (repeat of previous slide) Background meeting model with rates ν. Model: Pandemic Initially one agent is infected. Whenever an infected agent meets another
More informationAbstract. 2. We construct several transcendental numbers.
Abstract. We prove Liouville s Theorem for the order of approximation by rationals of real algebraic numbers. 2. We construct several transcendental numbers. 3. We define Poissonian Behaviour, and study
More informationNotes on Complexity Theory Last updated: December, Lecture 2
Notes on Complexity Theory Last updated: December, 2011 Jonathan Katz Lecture 2 1 Review The running time of a Turing machine M on input x is the number of steps M takes before it halts. Machine M is said
More informationLecture 7: More Arithmetic and Fun With Primes
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 7: More Arithmetic and Fun With Primes David Mix Barrington and Alexis Maciel July
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More informationb = 2, c = 3, we get x = 0.3 for the positive root. Ans. (D) x 2-2x - 8 < 0, or (x - 4)(x + 2) < 0, Therefore -2 < x < 4 Ans. (C)
SAT II - Math Level 2 Test #02 Solution 1. The positive zero of y = x 2 + 2x is, to the nearest tenth, equal to (A) 0.8 (B) 0.7 + 1.1i (C) 0.7 (D) 0.3 (E) 2.2 ± Using Quadratic formula, x =, with a = 1,
More informationLesson 8 Solving Quadratic Equations
Lesson 8 Solving Quadratic Equations Lesson 8 Solving Quadratic Equations We will continue our work with quadratic equations in this lesson and will learn the classic method to solve them the Quadratic
More informationLesson 11: The Special Role of Zero in Factoring
Lesson 11: The Special Role of Zero in Factoring Student Outcomes Students find solutions to polynomial equations where the polynomial expression is not factored into linear factors. Students construct
More informationAdventures in random graphs: Models, structures and algorithms
BCAM January 2011 1 Adventures in random graphs: Models, structures and algorithms Armand M. Makowski ECE & ISR/HyNet University of Maryland at College Park armand@isr.umd.edu BCAM January 2011 2 LECTURE
More informationThe condensation phase transition in random graph coloring
The condensation phase transition in random graph coloring Victor Bapst Goethe University, Frankfurt Joint work with Amin Coja-Oghlan, Samuel Hetterich, Felicia Rassmann and Dan Vilenchik arxiv:1404.5513
More informationLecture 2: Divide and conquer and Dynamic programming
Chapter 2 Lecture 2: Divide and conquer and Dynamic programming 2.1 Divide and Conquer Idea: - divide the problem into subproblems in linear time - solve subproblems recursively - combine the results in
More informationNP Completeness. CS 374: Algorithms & Models of Computation, Spring Lecture 23. November 19, 2015
CS 374: Algorithms & Models of Computation, Spring 2015 NP Completeness Lecture 23 November 19, 2015 Chandra & Lenny (UIUC) CS374 1 Spring 2015 1 / 37 Part I NP-Completeness Chandra & Lenny (UIUC) CS374
More information1 Primals and Duals: Zero Sum Games
CS 124 Section #11 Zero Sum Games; NP Completeness 4/15/17 1 Primals and Duals: Zero Sum Games We can represent various situations of conflict in life in terms of matrix games. For example, the game shown
More information6.207/14.15: Networks Lecture 3: Erdös-Renyi graphs and Branching processes
6.207/14.15: Networks Lecture 3: Erdös-Renyi graphs and Branching processes Daron Acemoglu and Asu Ozdaglar MIT September 16, 2009 1 Outline Erdös-Renyi random graph model Branching processes Phase transitions
More information