Asymptotics and Extremal Properties of the Edge-Triangle Exponential Random Graph Model

Size: px
Start display at page:

Download "Asymptotics and Extremal Properties of the Edge-Triangle Exponential Random Graph Model"

Transcription

1 Asymptotics and Extremal Properties of the Edge-Triangle Exponential Random Graph Model Alessandro Rinaldo Carnegie Mellon University joint work with Mei Yin, Sukhada Fadnavis, Stephen E. Fienberg and Yi Zhou May 20, 2014 Alegbraic Statistics 2014 Illinois Institute of Technology A. Rinaldo Asymptotics and Extremal Properties of the ET Model 1/36

2 Outline Exponential random graphs models (ERGMs) for network data. Degeneracy and Geometry of Discrete exponential families. Asymptotic Geometry of the Edge-Triangle Model. Asymptotic Extremal Properties of the Edge Triangle Model. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 2/36

3 Outline Exponential random graphs models (ERGMs) for network data. Degeneracy and Geometry of Discrete exponential families. Asymptotic Geometry of the Edge-Triangle Model. Asymptotic Extremal Properties of the Edge Triangle Model. Asymptotic quantization of exponential random graphs (2103) Yin, M., Rinaldo, A. and Fadnavis, S. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 2/36

4 Statistical Network (Random Graph) Analysis Let G n be the set of simple graphs on n nodes. Thus, G n = 2 (n 2). A. Rinaldo Asymptotics and Extremal Properties of the ET Model 3/36

5 Statistical Network (Random Graph) Analysis Let G n be the set of simple graphs on n nodes. Thus, G n = 2 (n 2). The nodes represent the units of some (sub)population of interest. The edges of any x G n encode a set of static relationships among population units. Source: Chung and Lu (2006), Complex Graphs and Networks. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 3/36

6 Statistical Network (Random Graph) Analysis Let G n be the set of simple graphs on n nodes. Thus, G n = 2 (n 2). The nodes represent the units of some (sub)population of interest. The edges of any x G n encode a set of static relationships among population units. Source: Chung and Lu (2006), Complex Graphs and Networks. Statistical Network Analysis Construct interpretable and realistic statistical models for G n by modeling the random occurrence of edges. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 3/36

7 Exponential Random Graph Models (ERGMs) Exponential random graph models arise by specifying a set of informative network statistics on G n x t(g n) = (t 1 (G n),..., t d (G n)) R d, such that the probability of observing G n is a function of t(g n) only. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 4/36

8 Exponential Random Graph Models (ERGMs) Exponential random graph models arise by specifying a set of informative network statistics on G n x t(g n) = (t 1 (G n),..., t d (G n)) R d, such that the probability of observing G n is a function of t(g n) only. Examples: the number of edges E(G n) (Erdös-Renyi model); number of triangles T (G n); the number of k-stars; the degree sequence (the β-model) or degree distribution. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 4/36

9 Exponential Random Graph Models (ERGMs) Exponential random graph models arise by specifying a set of informative network statistics on G n x t(g n) = (t 1 (G n),..., t d (G n)) R d, such that the probability of observing G n is a function of t(g n) only. Examples: the number of edges E(G n) (Erdös-Renyi model); number of triangles T (G n); the number of k-stars; the degree sequence (the β-model) or degree distribution....or any combinations of statistics. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 4/36

10 This talk: the Edge-Triangle (ET) Model ET Model: the network statistics are t(g n) = (E(G n), T (G n)) N 2. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 5/36

11 This talk: the Edge-Triangle (ET) Model ET Model: the network statistics are t(g n) = (E(G n), T (G n)) N 2. Example: n = 9. On G 9, there are 2 36 distinct graphs but only 444 distinct network statistics Number of triangles Number of edges A. Rinaldo Asymptotics and Extremal Properties of the ET Model 5/36

12 Exponential Random Graph Models (ERGMs) Exponential family representation Given the choice t of network statistics, construct the exponential family of probability distributions {Q θ, θ Θ} on G n such that, for a given parameter θ Θ, the probability of observing x is Q θ (G n) = exp { θ, t(g n) ψ(θ)}, A. Rinaldo Asymptotics and Extremal Properties of the ET Model 6/36

13 Exponential Random Graph Models (ERGMs) Exponential family representation Given the choice t of network statistics, construct the exponential family of probability distributions {Q θ, θ Θ} on G n such that, for a given parameter θ Θ, the probability of observing x is where ψ(θ) = log Q θ (G n) = exp { θ, t(g n) ψ(θ)}, ( x Gn e θ,t(gn) ) the log-partition function - a (often intractable) normalizing term; Θ = {θ R d : e ψ(θ) < } = R d is the natural parameter space. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 6/36

14 Exponential Random Graph Models (ERGMs) Exponential family representation Given the choice t of network statistics, construct the exponential family of probability distributions {Q θ, θ Θ} on G n such that, for a given parameter θ Θ, the probability of observing x is where ψ(θ) = log Q θ (G n) = exp { θ, t(g n) ψ(θ)}, ( x Gn e θ,t(gn) ) the log-partition function - a (often intractable) normalizing term; Θ = {θ R d : e ψ(θ) < } = R d is the natural parameter space. Two observations: It may be invariant with respect to relabeling of the vertices. Redundancy: if t(g n) = t(g n), then Q θ (G n) = Q θ (G n), for all θ. For the ET example, the median number of graphs corresponding to a network statistic is 2, 741, 130! A. Rinaldo Asymptotics and Extremal Properties of the ET Model 6/36

15 Sufficiency Principle Let T n = {t : t = t(g n), G n G n} R d and ν(t) = {G n G n : t(g n) = t}. Consider instead the family of probability distributions {P θ, θ Θ} on T n such that, for a given parameter θ Θ, the probability of observing t is with the same Θ and ψ(θ). P θ (t) = exp { θ, t ψ(θ)} ν(t), A. Rinaldo Asymptotics and Extremal Properties of the ET Model 7/36

16 Sufficiency Principle Number of edges Let T n = {t : t = t(g n), G n G n} R d and ν(t) = {G n G n : t(g n) = t}. Consider instead the family of probability distributions {P θ, θ Θ} on T n such that, for a given parameter θ Θ, the probability of observing t is with the same Θ and ψ(θ). P θ (t) = exp { θ, t ψ(θ)} ν(t), In the ET example, instead of G 9 we can work with T n = Number of triangles A. Rinaldo Asymptotics and Extremal Properties of the ET Model 7/36

17 Statistical Inference Given one observation x G n, i.e. given t = t(g n), estimate θ (usually with the MLE); assess whether the ERG model fits the data. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 8/36

18 Statistical Inference Given one observation x G n, i.e. given t = t(g n), estimate θ (usually with the MLE); assess whether the ERG model fits the data. In the ET model, we want to learn 2 parameters: the edge and triangle parameters. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 8/36

19 ERGMs are Bad!...I mean Hard! Despite being discrete exponential families, many ERGMs are troublesome and behave extremely badly". A. Rinaldo Asymptotics and Extremal Properties of the ET Model 9/36

20 ERGMs are Bad!...I mean Hard! Despite being discrete exponential families, many ERGMs are troublesome and behave extremely badly". ERGMs and most network models are highly non-standard models for which traditional parametric statistics does not apply. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 9/36

21 ERGMs are Bad!...I mean Hard! Despite being discrete exponential families, many ERGMs are troublesome and behave extremely badly". ERGMs and most network models are highly non-standard models for which traditional parametric statistics does not apply. The asymptotic (large n) properties of most ERGMs remain unknown. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 9/36

22 ERGMs are Bad!...I mean Hard! Despite being discrete exponential families, many ERGMs are troublesome and behave extremely badly". ERGMs and most network models are highly non-standard models for which traditional parametric statistics does not apply. The asymptotic (large n) properties of most ERGMs remain unknown. This talk will focus on extremal asymptotics of the ET model. See Chatterjee and Diaconis (2013) for many other asymptotic results. One route to the extremal asymptotics of the ET goes through degeneracy. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 9/36

23 Degeneracy in ERG Models See Rinaldo, Fienberg and Zhou (2009) What is degeneracy? Quoting from Handcock (2003): A random graph model is near degenerate if the model places almost all its probability mass on a small number of graph configurations [...] e.g. empty graph, full graph, an individual graph, no 2-stars"; a degenerrate model is not able to represent a range of realistic [networks]" since only a small range of graphs [is] covered as the parameters vary"; the MLE does not exist and/or MCMCMLE fails to converge; the observed network t is very unlikely under the distribution specified by the MLE; the model misbehaves... A. Rinaldo Asymptotics and Extremal Properties of the ET Model 10/36

24 Degeneracy in the ET Model: Entropy Plots We capture overall degenerate behavior using Shannon s entropy function θ ( ) Pθ (t) P θ (t) log 2, θ Θ. ν(t) t T n Rationale: degeneracy occurs when the probability mass is spread over a small number of network statistics, so degenerate distributions will tend to correspond to values of θ for which the entropy function is small. Entropy plot: for each point θ R 2 in the natural parameter space, plot the entropy of the corresponding probability distribution. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 11/36

25 Degeneracy in the ET Model: Entropy Plots A. Rinaldo Asymptotics and Extremal Properties of the ET Model 11/36

26 Degeneracy in the ET Model: Entropy Plots A. Rinaldo Asymptotics and Extremal Properties of the ET Model 11/36

27 Basics of Discrete Exponential Families Number of edges See Barndorff-Nielsen (1974) and Brown (1986) Let T be a random vector taking values in a finite set T n, for example Number of triangles The distribution of T belongs to the exponential family E = {P θ, θ Θ}, with P θ (t) = exp { θ, t ψ(θ)} ν(t), θ Θ = R d. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 12/36

28 Basics of Discrete Exponential Families Number of edges See Barndorff-Nielsen (1974) and Brown (1986) Let T be a random vector taking values in a finite set T n, for example Number of triangles The distribution of T belongs to the exponential family E = {P θ, θ Θ}, with P θ (t) = exp { θ, t ψ(θ)} ν(t), θ Θ = R d. The set P n = convhull(t n) is called the convex support. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 12/36

29 Basics of Discrete Exponential Families Choose File no file selected Number of edges See Barndorff-Nielsen (1974) and Brown (1986) Let T be a random vector taking values in a finite set T n, for example The distribution of T belongs to the exponential family E = {P θ, θ Θ}, with P θ (t) = exp { θ, t ψ(θ)} ν(t), θ Θ = R d. Number of triangles The set P n = convhull(t n) is called the convex support. It is a polytope. JavaView v Loading int(p n) = {E In the display, θ [T ], θ Θ} is precisely the set of all possible expected values use the right mouse to get help or to open the control panel. of T : mean value space. Type or browse a file from your local disk and press <upload>: upload Currently, the file formats described in data formats are supported which include JavaView's JVX, BYU, Sun's OBJ, Mathematica graphics MGS, Maple graphics MPL, STL, WRL, DXF (some formats are partially supported only). You may also upload gzip- or zip-compressed files which must have an extension like.jvx.gz or.mpl.zip. Your uploaded file will remain on the server for at most 3 hours! int(p n) and Applications: Θ are homeomorphic: we can represent the exponential family Apply any of the algorithms implemented in JavaView to your own models. using int(p n) instead of Θ: mean value parametrization. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 12/36

30 Convex support for the ET example. 90 Convex support Number of triangles Number of edges A. Rinaldo Asymptotics and Extremal Properties of the ET Model 13/36

31 One-to-one correspondence between Θ and int(p n). 2 Natural parameters space 90 Mean values space Number of triangles Number of edges A. Rinaldo Asymptotics and Extremal Properties of the ET Model 13/36

32 Extended Exponential Families: Geometric Construction For every face F of P n, construct the exponential family of distributions E F for the points in F with convex support F. Note that E F depends on dim(f ) < d parameters only. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 14/36

33 Extended Exponential Families: Geometric Construction For every face F of P n, construct the exponential family of distributions E F for the points in F with convex support F. Note that E F depends on dim(f ) < d parameters only. The extended exponential family is E = E {E F : F is a face of P n} A. Rinaldo Asymptotics and Extremal Properties of the ET Model 14/36

34 Extended Exponential Families: Geometric Construction For every face F of P n, construct the exponential family of distributions E F for the points in F with convex support F. Note that E F depends on dim(f ) < d parameters only. The extended exponential family is E = E {E F : F is a face of P n} Extended Exponential Family The extended exponential family is the closure of the original family. Geometrically, this corresponds to taking the closure of the mean value space, i.e. including the boundary of P n. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 14/36

35 Back to Degeneracy A. Rinaldo Asymptotics and Extremal Properties of the ET Model 15/36

36 Back to Degeneracy A. Rinaldo Asymptotics and Extremal Properties of the ET Model 15/36

37 Extended Exponential Families: Dual Geometric Construction Let P be a full-dimensional polytope in R d. The normal cone to a face F is the polyhedral cone { } N F = c R k : F {x P : c, x = max c, y, } y P consisting of all the linear functionals on P that are maximal over F. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 16/36

38 Extended Exponential Families: Dual Geometric Construction Let P be a full-dimensional polytope in R d. The normal cone to a face F is the polyhedral cone { } N F = c R k : F {x P : c, x = max c, y, } y P consisting of all the linear functionals on P that are maximal over F. The set of cones is called the normal fan of P. N (P) = {N F, F is a face of P} A. Rinaldo Asymptotics and Extremal Properties of the ET Model 16/36

39 Extended Exponential Families: Dual Geometric Construction Let P be a full-dimensional polytope in R d. The normal cone to a face F is the polyhedral cone { } N F = c R k : F {x P : c, x = max c, y, } y P consisting of all the linear functionals on P that are maximal over F. The set of cones is called the normal fan of P. N (P) = {N F, F is a face of P} Key properties: The (relative interiors of the) cones in N (P) partition R d. dim(n F ) = d dim(f ). A. Rinaldo Asymptotics and Extremal Properties of the ET Model 16/36

40 The Normal Fan for the ET Model 1 Normal Fan Number of triangles Number of edges A. Rinaldo Asymptotics and Extremal Properties of the ET Model 17/36

41 The Normal Fan for the ET Model 1 Normal Fan Number of triangles Number of edges A. Rinaldo Asymptotics and Extremal Properties of the ET Model 17/36

42 The Normal Fan for the ET Model 1 Normal Fan Number of triangles Number of edges A. Rinaldo Asymptotics and Extremal Properties of the ET Model 17/36

43 The Normal Fan for the ET Model 1 Normal Fan Number of triangles Number of edges A. Rinaldo Asymptotics and Extremal Properties of the ET Model 17/36

44 Degeneracy Explained (...Graphically) Entropy plots of the natural space and mean value spaces. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 18/36

45 Degeneracy Explained (...Graphically) Entropy plots of the natural space space with superimposed the normal fan and of the mean value space. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 18/36

46 Main Result (Colloquial Form) Pick any θ Θ, any face F of P n and any direction o 0 in the interior of the normal cone N F. For a sequence of positive numbers r i, form the sequence θ i = θ + r i o in Θ. Let µ i = E θi [T ] be the mean value parameter corresponding to θ i ; then, the sequence {µ i } is contained in the interior of P n. Then, lim i µ i is a point in the interior of F, which depends only on θ and d. Conversely, any point on the boundary of the convex support can be obtained in this way. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 19/36

47 Main Result (Colloquial Form) Pick any θ Θ, any face F of P n and any direction o 0 in the interior of the normal cone N F. For a sequence of positive numbers r i, form the sequence θ i = θ + r i o in Θ. Let µ i = E θi [T ] be the mean value parameter corresponding to θ i ; then, the sequence {µ i } is contained in the interior of P n. Then, lim i µ i is a point in the interior of F, which depends only on θ and d. Conversely, any point on the boundary of the convex support can be obtained in this way. Normal Fan and Extended Exponential Families The normal fan realizes geometrically the closure of the family inside the natural parameter space. See Rinaldo, Fienberg and Zhou (2009) and Geyer (2009) A. Rinaldo Asymptotics and Extremal Properties of the ET Model 19/36

48 Now let n... A. Rinaldo Asymptotics and Extremal Properties of the ET Model 20/36

49 Now let n... n = 5 A. Rinaldo Asymptotics and Extremal Properties of the ET Model 20/36

50 Now let n... n = 6 A. Rinaldo Asymptotics and Extremal Properties of the ET Model 20/36

51 Now let n... n = 7 A. Rinaldo Asymptotics and Extremal Properties of the ET Model 20/36

52 Now let n... n = 9 A. Rinaldo Asymptotics and Extremal Properties of the ET Model 20/36

53 Now let n... We are interested in the following: What happens when θ = (θ 1, θ 2 ) diverges to infinity along fixed directions and n? It is a form of asymptotic closure of the family. Interpretation is: how does the model behave when both θ and n are large? We will require the use of fairly recent results on the theory of graph limits (though see Häggström and Jonasson, 1999). A. Rinaldo Asymptotics and Extremal Properties of the ET Model 20/36

54 Now let n... We are interested in the following: What happens when θ = (θ 1, θ 2 ) diverges to infinity along fixed directions and n? This would correspond to taking the asymptotic closure of the ET model. Interpretation: how does the model behave when both θ and n are large? We will require the use of fairly recent results on the theory of graph limits (though see Häggström and Jonasson, 1999). A. Rinaldo Asymptotics and Extremal Properties of the ET Model 20/36

55 Rescaling First! For G n G n and a graph H with V (H) n vertices, the density homomorphism of H in G n is t(h, G n) = In particular, t(k 2, G n) = 2E(Gn) n 2 hom(h, Gn) n V (H). and t(k 3, G n) = 6T (Gn) n 3. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 21/36

56 Rescaling First! For G n G n and a graph H with V (H) n vertices, the density homomorphism of H in G n is t(h, G n) = In particular, t(k 2, G n) = 2E(Gn) n 2 hom(h, Gn) n V (H). and t(k 3, G n) = 6T (Gn) n 3. Rescaling of the ET model To avoid trivialities, rescale the ET model so that { } Q θ (G n) = exp n 2 ( θ, t(g n) ψ n(θ)), G n G n where θ = (θ 1, θ 2 ) R 2 and t(g n) = (t(k 2, G n), t(k 3, G n)) R 2. This rescaling ensures that the sufficient statistics are of the same order n 2. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 21/36

57 Rescaling First! For G n G n and a graph H with V (H) n vertices, the density homomorphism of H in G n is t(h, G n) = In particular, t(k 2, G n) = 2E(Gn) n 2 hom(h, Gn) n V (H). and t(k 3, G n) = 6T (Gn) n 3. Rescaling of the ET model Let T n = {t(g n), G n G n} [0, 1] 2 and let E n = {P n,θ, θ R 2 } be the exponential family for t(g n): { } P θ (t) = exp n 2 ( θ, t ψ n(θ)) ν n(t), t T n. Also let P n = convhull(t n) [0, 1] 2. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 21/36

58 Turán Graphs Turán graphs are fundamental in extremal graph theory and also in describing the asymptotic closure of the ET model. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 22/36

59 Turán Graphs Turán graphs are fundamental in extremal graph theory and also in describing the asymptotic closure of the ET model. Let T (n, r) be a Turán graph on n nodes and r classes, r = 1, 2,..., n (complete r-partite graph with partition sets differing in size by at most 1). For k = 0, 1,..., n 1, set v k,n = t(t (n, k + 1)) = [ t(k2, T (n, k + 1)) t(k 3, T (n, k + 1)) ] [0, 1] 2. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 22/36

60 Turán Graphs Turán graphs are fundamental in extremal graph theory and also in describing the asymptotic closure of the ET model. Let T (n, r) be a Turán graph on n nodes and r classes, r = 1, 2,..., n (complete r-partite graph with partition sets differing in size by at most 1). For k = 0, 1,..., n 1, set v k,n = t(t (n, k + 1)) = [ t(k2, T (n, k + 1)) t(k 3, T (n, k + 1)) ] [0, 1] 2. Vertices of P n are Turán Graphs (Bollobás, 1976) The vertices of P n are the points {v k,n, k = 0, 1,..., n/2 1} and v n 1,n. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 22/36

61 Limiting Geometry of the ET Model For the asymptotics of the ET model we need the sets (well studied in extremal graph theory) T = cl ({t(g n), G n G n, n = 1, 2,...}) and P = convhull(t ). A. Rinaldo Asymptotics and Extremal Properties of the ET Model 23/36

62 Limiting Geometry of the ET Model For the asymptotics of the ET model we need the sets (well studied in extremal graph theory) T = cl ({t(g n), G n G n, n = 1, 2,...}) and P = convhull(t ). The set T (Razborov, 2008) T is the closed subset of [0, 1] 2 with upper boundary curve y = x 3/2 and lower boundary given by y = 0 for 0 x 1/2 and y ( (k 1) k 2 ) ( k(k x(k + 1)) k + ) 2 k(k x(k + 1)) k 2 (k + 1) 2 for (k 1)/k x k/(k + 1), k = 2, 3,.... A. Rinaldo Asymptotics and Extremal Properties of the ET Model 23/36

63 Limiting Geometry of the ET Model A. Rinaldo Asymptotics and Extremal Properties of the ET Model 23/36

64 More on T Infinite homomorphism densities of Turán graphs: For k = 0, 1,..., let ( ) k lim v k(k 1) k,n = v k :=, R 2. n k + 1 (k + 1) 2 A. Rinaldo Asymptotics and Extremal Properties of the ET Model 24/36

65 More on T Infinite homomorphism densities of Turán graphs: For k = 0, 1,..., let ( ) k lim v k(k 1) k,n = v k :=, R 2. n k + 1 (k + 1) 2 Think of lower boundary of T as a series of scallops" (strictly concave segments) between the v k s. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 24/36

66 More on T Infinite homomorphism densities of Turán graphs: For k = 0, 1,..., let ( ) k lim v k(k 1) k,n = v k :=, R 2. n k + 1 (k + 1) 2 Think of lower boundary of T as a series of scallops" (strictly concave segments) between the v k s. triangle density edge density A. Rinaldo Asymptotics and Extremal Properties of the ET Model 24/36

67 More on T A. Rinaldo Asymptotics and Extremal Properties of the ET Model 24/36

68 The set P The set P = convhull(t ) P = lim n P n, with P n P for all n. The extreme points of P are {v k, k = 0, 1,...} and lim k v k = (1, 1). If n is a multiple of (k + 1)(k + 2), then v k,n = v k and v k+1,n = v k+1. For all such n, the line segment connecting v k and v k+1 intersects P only in v k and v k+1. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 25/36

69 The set P The set P = convhull(t ) P = lim n P n, with P n P for all n. The extreme points of P are {v k, k = 0, 1,...} and lim k v k = (1, 1). If n is a multiple of (k + 1)(k + 2), then v k,n = v k and v k+1,n = v k+1. For all such n, the line segment connecting v k and v k+1 intersects P only in v k and v k+1. Engström and Norén (2011) show a similar result using isomorphism densities, in which case P = np n. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 25/36

70 The set P triangle density edge density A. Rinaldo Asymptotics and Extremal Properties of the ET Model 25/36

71 The set P triangle density edge density A. Rinaldo Asymptotics and Extremal Properties of the ET Model 25/36

72 The Normal Fan to P Let L k the line segment joining v k and v k1 and set L 1 the segment joining v 0 = (0, 0) and (1, 1) = lim k v k. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 26/36

73 The Normal Fan to P Let L k the line segment joining v k and v k1 and set L 1 the segment joining v 0 = (0, 0) and (1, 1) = lim k v k. The outer normal to L k are ( 1, 1) if k = 1. o k = (0, ( 1) ) if k = 0 1, (k+1)(k+2) if k = 1, 2,... k(3k+5) We call the o k the critical directions of the model. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 26/36

74 The Normal Fan to P Let L k the line segment joining v k and v k1 and set L 1 the segment joining v 0 = (0, 0) and (1, 1) = lim k v k. The outer normal to L k are ( 1, 1) if k = 1. o k = (0, ( 1) ) if k = 0 1, (k+1)(k+2) if k = 1, 2,... k(3k+5) We call the o k the critical directions of the model. Finally, set C k = cone(o k 1, o k ) for k = 0, 1,.... A. Rinaldo Asymptotics and Extremal Properties of the ET Model 26/36

75 The Normal Fan to P A. Rinaldo Asymptotics and Extremal Properties of the ET Model 26/36

76 The Normal Fan to P triangle density edge density A. Rinaldo Asymptotics and Extremal Properties of the ET Model 26/36

77 The Normal Fan to P triangle density edge density A. Rinaldo Asymptotics and Extremal Properties of the ET Model 26/36

78 Asymptotics/Extremal Properties of the ET Model: Generic Directions Recall that P θ,n is the ET probability distribution on T n corresponding to θ R 2. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 27/36

79 Asymptotics/Extremal Properties of the ET Model: Generic Directions Asymptotics along generic directions Pick arbitrary θ, o R 2 with o 0 and o {o K, k = 1, 0,...} and let k be such that o C k. For any 0 < ɛ < 1, there exists an n 0 = n 0 (θ, ɛ, o) > 0 such that the following holds: for every n > n 0, there exists an r 0 = r 0 (θ, ɛ, o, n) > 0 such that for all r > r 0, P θ+ro,n (v k,n ) > 1 ɛ. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 27/36

80 Asymptotics/Extremal Properties of the ET Model: Generic Directions Asymptotics along generic directions Pick arbitrary θ, o R 2 with o 0 and o {o K, k = 1, 0,...} and let k be such that o C k. For any 0 < ɛ < 1, there exists an n 0 = n 0 (θ, ɛ, o) > 0 such that the following holds: for every n > n 0, there exists an r 0 = r 0 (θ, ɛ, o, n) > 0 such that for all r > r 0, P θ+ro,n (v k,n ) > 1 ɛ. Choice of θ does not matter asymptotically. All points in C k yield the same asymptotics! When n is a multiple of (k + 1)(k + 2), this gives convergence in total variation (in n and r, along subsequences) to v k. For other n s, we get weak convergence. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 27/36

81 Asymptotics along Generic Directions: Example Directions that will give convergence to the full graph, empty graph and Turán graph with 2 classes triangle density edge density A. Rinaldo Asymptotics and Extremal Properties of the ET Model 28/36

82 Asymptotics/Extremal Properties of the ET Model: Critical Directions Technical assumption: n multiple of (k + 1)(k + 2). Most likely it can be removed. Pick a o k, k { 1, 0}. Let l k R 2 span the line through the origin parallel to L k (line segment joining v k and v k+1 ) and consider the halfspaces H + k = {x R 2 : x, l k 0} and H k = {x R 2 : x, l k < 0}. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 29/36

83 Asymptotics/Extremal Properties of the ET Model: Critical Directions Asymptotics along critical directions Let θ R 2, k > 1 and 0 < ɛ < 1, arbitrarily small. Then there exists an n 0 = n 0 (θ, ɛ, k) > 0 such that the following holds: for every n > n 0 and a multiple of (k + 1)(k + 2) there exists an r 0 = r 0 (β, ɛ, k, n) > 0 such that for all r > r 0, if θ H + k then P θ+ro k,n(v k+1 ) > 1 ɛ; if θ H k, then P θ+ro k,n(v k ) > 1 ɛ. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 29/36

84 Asymptotics/Extremal Properties of the ET Model: Critical Directions Asymptotics along critical directions Let θ R 2, k > 1 and 0 < ɛ < 1, arbitrarily small. Then there exists an n 0 = n 0 (θ, ɛ, k) > 0 such that the following holds: for every n > n 0 and a multiple of (k + 1)(k + 2) there exists an r 0 = r 0 (β, ɛ, k, n) > 0 such that for all r > r 0, if θ H + k then P θ+ro k,n(v k+1 ) > 1 ɛ; if θ H k, then P θ+ro k,n(v k ) > 1 ɛ. Asymptotics depends on whether θ, l k 0 or not. The model undergoes an asymptotic phase transition as θ traverse the boundary of H + k. This type of discontinuity only occurs when n. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 29/36

85 Asymptotics along Critical Directions. Example: k = triangle density edge density A. Rinaldo Asymptotics and Extremal Properties of the ET Model 30/36

86 The Critical directions o 1 and o 0 The critical directions o 1 and o 0 are different triangle density edge density A. Rinaldo Asymptotics and Extremal Properties of the ET Model 31/36

87 The Critical directions o 1 and o 0 The direction o 1 : For fixed ( n, the outer ) normal to the segment joining v 0,n and v n 1,n is o 1,n := 1,. For n and r large, the probability n n 2 P θ+ron,n, with θ = (θ 1, θ 2 ), assigns almost all of its mass to the empty graph when θ 1 + θ 2 < 0 and to the complete graph when θ 1 + θ 2 > 0, and it is uniform over v 0,n and v n 1,n when θ 1 n(n 1) + θ 2 (n 1)(n 2) = 0. The direction o 0 : For large r and n, P n,θ+ro+0 with θ = (θ 1, θ 2 ), becomes indistinguishable from the exponential family on the number of edges of triangle-free graphs with natural parameter θ 1. More refined result: replace triangle-free graphs" with subgraphs of T (n, 2)." (See Diaconis and Chatterjee, 2013.) A. Rinaldo Asymptotics and Extremal Properties of the ET Model 31/36

88 From Convergence in Total Variation to Convergence in Cut Metric edge density We have shown that, when n is a multiple of (k + 2)(k + 1), P n,θ+ro converges in total variation (weakly for other n s) to point masses on the corner points" and to a distribution on the horizontal segment of the set T = triangle density depending on o and θ, as n, r jointly. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 32/36

89 From Convergence in Total Variation to Convergence in Cut Metric edge density We have shown that, when n is a multiple of (k + 2)(k + 1), P n,θ+ro converges in total variation (weakly for other n s) to point masses on the corner points" and to a distribution on the horizontal segment of the set T = triangle density depending on o and θ, as n, r jointly. Can this be extended to some form of stochastic convergence of the sequence {G n,r } with G n,r P n,θ+ro? A. Rinaldo Asymptotics and Extremal Properties of the ET Model 32/36

90 From Convergence in Total Variation to Convergence in Cut Metric edge density We have shown that, when n is a multiple of (k + 2)(k + 1), P n,θ+ro converges in total variation (weakly for other n s) to point masses on the corner points" and to a distribution on the horizontal segment of the set T = triangle density depending on o and θ, as n, r jointly. Can this be extended to some form of stochastic convergence of the sequence {G n,r } with G n,r P n,θ+ro? Yes, but we need graphons! A. Rinaldo Asymptotics and Extremal Properties of the ET Model 32/36

91 From Convergence in Total Variation to Convergence in Cut Metric Let W be the pace of measurable and symmetric function from [0, 1] 2 into [0, 1], called graphons. For f W, the interval [0, 1] can be thought as a continuum of vertices, and f (x, y) = f (y, x) is the probability that x and y are connected by an edge. Any finite graph G n has a graphon representation { 1, if ( nx, ny ) is an edge in Gn, f Gn (x, y) = 0, otherwise. The cut distance between graphons f and g is d (f, g) = sup (f (x, y) g(x, y)) dxdy, S,T [0,1] S T Let W arise from W by identifying graphons that are at a cut-distance 0 and related by a measure preserving transformation. The space ( W, d ) is compact. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 33/36

92 From Convergence in Total Variation to Convergence in Cut Metric A sequence {G n} of possibly random graphs converges to the graphon f when lim n d (f Gn, f ) = 0. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 33/36

93 From Convergence in Total Variation to Convergence in Cut Metric Paraphrasing Our Results There exists sequences {n i, r i } i such that the sequence of random graphs {G i } i with G i P ni,θ+r i o satisfies lim i d (f G i, f Kr ) = 0 in probability, where f Tr is the Turán graphon on r classes f Tr (x, y) = { 1 if [xr] [yr], 0 otherwise, (x, y) [0, 1] 2, with r depending on o and possibly θ ([x] denotes the integer part of x). When o = o 0, the limiting graphon is pf T 2 with p (0, 1) depending on θ 1. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 34/36

94 The Variational Analysis Approach Most of our results can also be derived (in a slightly different form) using a powerful analytic method due to Chatterjee and Diaconis (2013). However, it gives less precise results along critical directions. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 35/36

95 The Variational Analysis Approach Most of our results can also be derived (in a slightly different form) using a powerful analytic method due to Chatterjee and Diaconis (2013). However, it gives less precise results along critical directions. Chatterjee and Diaconis (2013) showed that, for fixed, θ = (θ 1, θ 2 ), the limiting behavior of {G n} with G n Q n,θ, is determined by the solution of the variational problem ( ) sup f W θ 1 t(k 2, f ) + θ 2 t(k 3, f ) [0,1] 2 I(f )dxdy where I(u) = 1 u log u + 1 (1 u) log(1 u), and, for any finite graph H 2 2 on k node, t(h, f ) := f (x i, x j )dx 1 x k. [0,1] k {i,j} E(H), A. Rinaldo Asymptotics and Extremal Properties of the ET Model 35/36

96 The Variational Analysis Approach Most of our results can also be derived (in a slightly different form) using a powerful analytic method due to Chatterjee and Diaconis (2013). However, it gives less precise results along critical directions. Chatterjee and Diaconis (2013) showed that, for fixed, θ = (θ 1, θ 2 ), the limiting behavior of {G n} with G n Q n,θ, is determined by the solution of the variational problem ( ) sup f W θ 1 t(k 2, f ) + θ 2 t(k 3, f ) [0,1] 2 I(f )dxdy where I(u) = 1 u log u + 1 (1 u) log(1 u), and, for any finite graph H 2 2 on k node, t(h, f ) := f (x i, x j )dx 1 x k. [0,1] k {i,j} E(H) This result can be applied to the case θ along fixed directions., A. Rinaldo Asymptotics and Extremal Properties of the ET Model 35/36

97 Conclusions We have fully described the asymptotic extremal behavior of the ET model. We made heavy use of recent results on graph limits (see, e.g., the book by Lovász, 2012 for details) and probability (Chatterjee and Diaconis, 2013 and Chatterjee and Varadhan, 2011). Some of our results and technicques are likely to generalize to more complex ERGMs. A. Rinaldo Asymptotics and Extremal Properties of the ET Model 36/36

Ground states for exponential random graphs

Ground 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 information

Phase transitions in the edge-triangle exponential random graph model

Phase transitions in the edge-triangle exponential random graph model Phase transitions in the edge-triangle exponential random graph model Mei Yin Department of Mathematics, Brown University April 28, 2014 Probability space: The set G n of all simple graphs G n on n vertices.

More information

The large deviation principle for the Erdős-Rényi random graph

The 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 information

arxiv: v1 [stat.ml] 30 Dec 2008

arxiv: v1 [stat.ml] 30 Dec 2008 On the Geometry of Discrete Exponential Families with Application to Exponential Random Graph Models arxiv:0901.0026v1 [stat.ml] 30 Dec 2008 Stephen E. Fienberg Department of Statistics, Machine Learning

More information

EMERGENT STRUCTURES IN LARGE NETWORKS

EMERGENT STRUCTURES IN LARGE NETWORKS Applied Probability Trust (29 November 2012) EMERGENT STRUCTURES IN LARGE NETWORKS DAVID ARISTOFF, University of Minnesota CHARLES RADIN, The University of Texas at Austin Abstract We consider a large

More information

arxiv: v2 [math.pr] 4 Jan 2018

arxiv: v2 [math.pr] 4 Jan 2018 Ground states for exponential random graphs Rajinder Mavi 1, a 2, b and Mei Yin 1 Department of Mathematics Michigan State University 619 Red Cedar Road arxiv:1706.09084v2 [math.pr] 4 Jan 2018 C212 Wells

More information

Multipodal Structure and Phase Transitions in Large Constrained Graphs

Multipodal Structure and Phase Transitions in Large Constrained Graphs Multipodal Structure and Phase Transitions in Large Constrained Graphs Richard Kenyon Charles Radin Kui Ren Lorenzo Sadun May 3, 24 Abstract We study the asymptotics of large, simple, labeled graphs constrained

More information

arxiv: v3 [math.pr] 6 Apr 2011

arxiv: v3 [math.pr] 6 Apr 2011 ESTIMATING AND UNDERSTANDING EXPONENTIAL RANDOM GRAPH MODELS SOURAV CHATTERJEE AND PERSI DIACONIS arxiv:1102.2650v3 [math.pr] 6 Apr 2011 Abstract. We introduce a new method for estimating the parameters

More information

Consistency Under Sampling of Exponential Random Graph Models

Consistency Under Sampling of Exponential Random Graph Models Consistency Under Sampling of Exponential Random Graph Models Cosma Shalizi and Alessandro Rinaldo Summary by: Elly Kaizar Remember ERGMs (Exponential Random Graph Models) Exponential family models Sufficient

More information

Introduction to Real Analysis Alternative Chapter 1

Introduction to Real Analysis Alternative Chapter 1 Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces

More information

Graph Limits: Some Open Problems

Graph Limits: Some Open Problems Graph Limits: Some Open Problems 1 Introduction Here are some questions from the open problems session that was held during the AIM Workshop Graph and Hypergraph Limits, Palo Alto, August 15-19, 2011.

More information

ESTIMATING AND UNDERSTANDING EXPONENTIAL RANDOM GRAPH MODELS

ESTIMATING AND UNDERSTANDING EXPONENTIAL RANDOM GRAPH MODELS ESTIMATING AND UNDERSTANDING EXPONENTIAL RANDOM GRAPH MODELS SOURAV CHATTERJEE AND PERSI DIACONIS Abstract. We introduce a new method for estimating the parameters of exponential random graph models. The

More information

Course 212: Academic Year Section 1: Metric Spaces

Course 212: Academic Year Section 1: Metric Spaces Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........

More information

Characterizing extremal limits

Characterizing extremal limits Characterizing extremal limits Oleg Pikhurko University of Warwick ICERM, 11 February 2015 Rademacher Problem g(n, m) := min{#k 3 (G) : v(g) = n, e(g) = m} Mantel 1906, Turán 41: max{m : g(n, m) = 0} =

More information

arxiv: v2 [math.co] 11 Mar 2008

arxiv: v2 [math.co] 11 Mar 2008 Testing properties of graphs and functions arxiv:0803.1248v2 [math.co] 11 Mar 2008 Contents László Lovász Institute of Mathematics, Eötvös Loránd University, Budapest and Balázs Szegedy Department of Mathematics,

More information

Cauchy s Theorem (rigorous) In this lecture, we will study a rigorous proof of Cauchy s Theorem. We start by considering the case of a triangle.

Cauchy s Theorem (rigorous) In this lecture, we will study a rigorous proof of Cauchy s Theorem. We start by considering the case of a triangle. Cauchy s Theorem (rigorous) In this lecture, we will study a rigorous proof of Cauchy s Theorem. We start by considering the case of a triangle. Given a certain complex-valued analytic function f(z), for

More information

Introduction to Empirical Processes and Semiparametric Inference Lecture 13: Entropy Calculations

Introduction to Empirical Processes and Semiparametric Inference Lecture 13: Entropy Calculations Introduction to Empirical Processes and Semiparametric Inference Lecture 13: Entropy Calculations Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and Operations Research

More information

Topological properties

Topological properties CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological

More information

Undecidability of Linear Inequalities Between Graph Homomorphism Densities

Undecidability of Linear Inequalities Between Graph Homomorphism Densities Undecidability of Linear Inequalities Between Graph Homomorphism Densities Hamed Hatami joint work with Sergey Norin School of Computer Science McGill University December 4, 2013 Hamed Hatami (McGill University)

More information

Algorithmic approaches to fitting ERG models

Algorithmic approaches to fitting ERG models Ruth Hummel, Penn State University Mark Handcock, University of Washington David Hunter, Penn State University Research funded by Office of Naval Research Award No. N00014-08-1-1015 MURI meeting, April

More information

Discrete Markov Random Fields the Inference story. Pradeep Ravikumar

Discrete Markov Random Fields the Inference story. Pradeep Ravikumar Discrete Markov Random Fields the Inference story Pradeep Ravikumar Graphical Models, The History How to model stochastic processes of the world? I want to model the world, and I like graphs... 2 Mid to

More information

arxiv: v2 [math.st] 21 Nov 2017

arxiv: v2 [math.st] 21 Nov 2017 arxiv:1701.08420v2 [math.st] 21 Nov 2017 Random Networks, Graphical Models, and Exchangeability Steffen Lauritzen University of Copenhagen Kayvan Sadeghi University of Cambridge November 22, 2017 Abstract

More information

Problem Set 6: Solutions Math 201A: Fall a n x n,

Problem Set 6: Solutions Math 201A: Fall a n x n, Problem Set 6: Solutions Math 201A: Fall 2016 Problem 1. Is (x n ) n=0 a Schauder basis of C([0, 1])? No. If f(x) = a n x n, n=0 where the series converges uniformly on [0, 1], then f has a power series

More information

Graph limits Graph convergence Approximate asymptotic properties of large graphs Extremal combinatorics/computer science : flag algebra method, proper

Graph limits Graph convergence Approximate asymptotic properties of large graphs Extremal combinatorics/computer science : flag algebra method, proper Jacob Cooper Dan Král Taísa Martins University of Warwick Monash University - Discrete Maths Research Group Graph limits Graph convergence Approximate asymptotic properties of large graphs Extremal combinatorics/computer

More information

Problem Set 2: Solutions Math 201A: Fall 2016

Problem Set 2: Solutions Math 201A: Fall 2016 Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that

More information

arxiv: v2 [stat.ot] 10 Nov 2011

arxiv: v2 [stat.ot] 10 Nov 2011 Maximum Likelihood Estimation in Network Models arxiv:1105.6145v2 [stat.ot] 10 Nov 2011 Alessandro Rinaldo Department of Statistics Carnegie Mellon University Pittsburgh, PA, 15213-3890 USA Sonja Petrović

More information

Moment Measures. Bo az Klartag. Tel Aviv University. Talk at the asymptotic geometric analysis seminar. Tel Aviv, May 2013

Moment Measures. Bo az Klartag. Tel Aviv University. Talk at the asymptotic geometric analysis seminar. Tel Aviv, May 2013 Tel Aviv University Talk at the asymptotic geometric analysis seminar Tel Aviv, May 2013 Joint work with Dario Cordero-Erausquin. A bijection We present a correspondence between convex functions and Borel

More information

McGill University Math 354: Honors Analysis 3

McGill University Math 354: Honors Analysis 3 Practice problems McGill University Math 354: Honors Analysis 3 not for credit Problem 1. Determine whether the family of F = {f n } functions f n (x) = x n is uniformly equicontinuous. 1st Solution: The

More information

14 : Theory of Variational Inference: Inner and Outer Approximation

14 : Theory of Variational Inference: Inner and Outer Approximation 10-708: Probabilistic Graphical Models 10-708, Spring 2014 14 : Theory of Variational Inference: Inner and Outer Approximation Lecturer: Eric P. Xing Scribes: Yu-Hsin Kuo, Amos Ng 1 Introduction Last lecture

More information

A Parametric Simplex Algorithm for Linear Vector Optimization Problems

A Parametric Simplex Algorithm for Linear Vector Optimization Problems A Parametric Simplex Algorithm for Linear Vector Optimization Problems Birgit Rudloff Firdevs Ulus Robert Vanderbei July 9, 2015 Abstract In this paper, a parametric simplex algorithm for solving linear

More information

Szemerédi s regularity lemma revisited. Lewis Memorial Lecture March 14, Terence Tao (UCLA)

Szemerédi s regularity lemma revisited. Lewis Memorial Lecture March 14, Terence Tao (UCLA) Szemerédi s regularity lemma revisited Lewis Memorial Lecture March 14, 2008 Terence Tao (UCLA) 1 Finding models of large dense graphs Suppose we are given a large dense graph G = (V, E), where V is a

More information

Quasi-conformal minimal Lagrangian diffeomorphisms of the

Quasi-conformal minimal Lagrangian diffeomorphisms of the Quasi-conformal minimal Lagrangian diffeomorphisms of the hyperbolic plane (joint work with J.M. Schlenker) January 21, 2010 Quasi-symmetric homeomorphism of a circle A homeomorphism φ : S 1 S 1 is quasi-symmetric

More information

Maximum Likelihood Estimation in Loglinear Models

Maximum Likelihood Estimation in Loglinear Models in Loglinear Models Alessandro Rinaldo Carnegie Mellon University joint work with Steve Fienberg April 18, 2012 Workshop on Graphical Models: Mathematics, Statistics and Computer Sciences Fields Institute

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

On the number of cycles in a graph with restricted cycle lengths

On the number of cycles in a graph with restricted cycle lengths On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a

More information

Functional Analysis Exercise Class

Functional Analysis Exercise Class Functional Analysis Exercise Class Week 2 November 6 November Deadline to hand in the homeworks: your exercise class on week 9 November 13 November Exercises (1) Let X be the following space of piecewise

More information

Chapter 4: Asymptotic Properties of the MLE

Chapter 4: Asymptotic Properties of the MLE Chapter 4: Asymptotic Properties of the MLE Daniel O. Scharfstein 09/19/13 1 / 1 Maximum Likelihood Maximum likelihood is the most powerful tool for estimation. In this part of the course, we will consider

More information

Normal Fans of Polyhedral Convex Sets

Normal Fans of Polyhedral Convex Sets Set-Valued Analysis manuscript No. (will be inserted by the editor) Normal Fans of Polyhedral Convex Sets Structures and Connections Shu Lu Stephen M. Robinson Received: date / Accepted: date Dedicated

More information

Lecture 4: Graph Limits and Graphons

Lecture 4: Graph Limits and Graphons Lecture 4: Graph Limits and Graphons 36-781, Fall 2016 3 November 2016 Abstract Contents 1 Reprise: Convergence of Dense Graph Sequences 1 2 Calculating Homomorphism Densities 3 3 Graphons 4 4 The Cut

More information

Statistics 612: L p spaces, metrics on spaces of probabilites, and connections to estimation

Statistics 612: L p spaces, metrics on spaces of probabilites, and connections to estimation Statistics 62: L p spaces, metrics on spaces of probabilites, and connections to estimation Moulinath Banerjee December 6, 2006 L p spaces and Hilbert spaces We first formally define L p spaces. Consider

More information

Submodularity in Machine Learning

Submodularity in Machine Learning Saifuddin Syed MLRG Summer 2016 1 / 39 What are submodular functions Outline 1 What are submodular functions Motivation Submodularity and Concavity Examples 2 Properties of submodular functions Submodularity

More information

A Graphon-based Framework for Modeling Large Networks

A Graphon-based Framework for Modeling Large Networks A Graphon-based Framework for Modeling Large Networks Ran He Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Graduate School of Arts and Sciences COLUMBIA

More information

Probabilistic Graphical Models

Probabilistic Graphical Models Probabilistic Graphical Models Lecture 9: Variational Inference Relaxations Volkan Cevher, Matthias Seeger Ecole Polytechnique Fédérale de Lausanne 24/10/2011 (EPFL) Graphical Models 24/10/2011 1 / 15

More information

A brief introduction to Conditional Random Fields

A brief introduction to Conditional Random Fields A brief introduction to Conditional Random Fields Mark Johnson Macquarie University April, 2005, updated October 2010 1 Talk outline Graphical models Maximum likelihood and maximum conditional likelihood

More information

14 : Theory of Variational Inference: Inner and Outer Approximation

14 : Theory of Variational Inference: Inner and Outer Approximation 10-708: Probabilistic Graphical Models 10-708, Spring 2017 14 : Theory of Variational Inference: Inner and Outer Approximation Lecturer: Eric P. Xing Scribes: Maria Ryskina, Yen-Chia Hsu 1 Introduction

More information

In class midterm Exam - Answer key

In class midterm Exam - Answer key Fall 2013 In class midterm Exam - Answer key ARE211 Problem 1 (20 points). Metrics: Let B be the set of all sequences x = (x 1,x 2,...). Define d(x,y) = sup{ x i y i : i = 1,2,...}. a) Prove that d is

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

Fourth Week: Lectures 10-12

Fourth Week: Lectures 10-12 Fourth Week: Lectures 10-12 Lecture 10 The fact that a power series p of positive radius of convergence defines a function inside its disc of convergence via substitution is something that we cannot ignore

More information

L p Spaces and Convexity

L p Spaces and Convexity L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function

More information

Constrained Optimization and Lagrangian Duality

Constrained Optimization and Lagrangian Duality CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may

More information

Elusive problems in extremal graph theory

Elusive problems in extremal graph theory Elusive problems in extremal graph theory Andrzej Grzesik (Krakow) Dan Král (Warwick) László Miklós Lovász (MIT/Stanford) 2/5/27 Overview of talk uniqueness of extremal configurations motivation and formulation

More information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

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

1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N

1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N Applied Analysis prelim July 15, 216, with solutions Solve 4 of the problems 1-5 and 2 of the problems 6-8. We will only grade the first 4 problems attempted from1-5 and the first 2 attempted from problems

More information

Consistency of the maximum likelihood estimator for general hidden Markov models

Consistency of the maximum likelihood estimator for general hidden Markov models Consistency of the maximum likelihood estimator for general hidden Markov models Jimmy Olsson Centre for Mathematical Sciences Lund University Nordstat 2012 Umeå, Sweden Collaborators Hidden Markov models

More information

A Potpourri of Nonlinear Algebra

A Potpourri of Nonlinear Algebra a a 2 a 3 + c c 2 c 3 =2, a a 3 b 2 + c c 3 d 2 =0, a 2 a 3 b + c 2 c 3 d =0, a 3 b b 2 + c 3 d d 2 = 4, a a 2 b 3 + c c 2 d 3 =0, a b 2 b 3 + c d 2 d 3 = 4, a 2 b b 3 + c 2 d 3 d =4, b b 2 b 3 + d d 2

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

Mean-field dual of cooperative reproduction

Mean-field dual of cooperative reproduction The mean-field dual of systems with cooperative reproduction joint with Tibor Mach (Prague) A. Sturm (Göttingen) Friday, July 6th, 2018 Poisson construction of Markov processes Let (X t ) t 0 be a continuous-time

More information

Generalized Exponential Random Graph Models: Inference for Weighted Graphs

Generalized Exponential Random Graph Models: Inference for Weighted Graphs Generalized Exponential Random Graph Models: Inference for Weighted Graphs James D. Wilson University of North Carolina at Chapel Hill June 18th, 2015 Political Networks, 2015 James D. Wilson GERGMs for

More information

On the Logarithmic Calculus and Sidorenko s Conjecture

On the Logarithmic Calculus and Sidorenko s Conjecture On the Logarithmic Calculus and Sidorenko s Conjecture by Xiang Li A thesis submitted in conformity with the requirements for the degree of Msc. Mathematics Graduate Department of Mathematics University

More information

Hyperbolic metric spaces and their applications to large complex real world networks II

Hyperbolic metric spaces and their applications to large complex real world networks II Hyperbolic metric spaces Hyperbolic metric spaces and their applications to large complex real world networks II Gabriel H. Tucci Bell Laboratories Alcatel-Lucent May 17, 2010 Tucci Hyperbolic metric spaces

More information

Lecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016

Lecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016 Lecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016 1 Entropy Since this course is about entropy maximization,

More information

A LARGE DEVIATION PRINCIPLE FOR THE ERDŐS RÉNYI UNIFORM RANDOM GRAPH

A LARGE DEVIATION PRINCIPLE FOR THE ERDŐS RÉNYI UNIFORM RANDOM GRAPH A LARGE DEVIATION PRINCIPLE FOR THE ERDŐS RÉNYI UNIFORM RANDOM GRAPH AMIR DEMBO AND EYAL LUBETZKY Abstract. Starting with the large deviation principle (ldp) for the Erdős Rényi binomial random graph G(n,

More information

Probabilistic Graphical Models

Probabilistic Graphical Models School of Computer Science Probabilistic Graphical Models Variational Inference IV: Variational Principle II Junming Yin Lecture 17, March 21, 2012 X 1 X 1 X 1 X 1 X 2 X 3 X 2 X 2 X 3 X 3 Reading: X 4

More information

Applications of the Lopsided Lovász Local Lemma Regarding Hypergraphs

Applications of the Lopsided Lovász Local Lemma Regarding Hypergraphs Regarding Hypergraphs Ph.D. Dissertation Defense April 15, 2013 Overview The Local Lemmata 2-Coloring Hypergraphs with the Original Local Lemma Counting Derangements with the Lopsided Local Lemma Lopsided

More information

Computing Maximum Likelihood Estimates in Log-Linear Models

Computing Maximum Likelihood Estimates in Log-Linear Models Computing Maximum Likelihood Estimates in Log-Linear Models Alessandro Rinaldo Department of Statistics Carnegie Mellon University June, 2006 Abstract We develop computational strategies for extended maximum

More information

Steiner s formula and large deviations theory

Steiner s formula and large deviations theory Steiner s formula and large deviations theory Venkat Anantharam EECS Department University of California, Berkeley May 19, 2015 Simons Conference on Networks and Stochastic Geometry Blanton Museum of Art

More information

Metric Spaces Lecture 17

Metric Spaces Lecture 17 Metric Spaces Lecture 17 Homeomorphisms At the end of last lecture an example was given of a bijective continuous function f such that f 1 is not continuous. For another example, consider the sets T =

More information

Some Background Math Notes on Limsups, Sets, and Convexity

Some Background Math Notes on Limsups, Sets, and Convexity EE599 STOCHASTIC NETWORK OPTIMIZATION, MICHAEL J. NEELY, FALL 2008 1 Some Background Math Notes on Limsups, Sets, and Convexity I. LIMITS Let f(t) be a real valued function of time. Suppose f(t) converges

More information

TEICHMÜLLER SPACE MATTHEW WOOLF

TEICHMÜLLER SPACE MATTHEW WOOLF TEICHMÜLLER SPACE MATTHEW WOOLF Abstract. It is a well-known fact that every Riemann surface with negative Euler characteristic admits a hyperbolic metric. But this metric is by no means unique indeed,

More information

The Lopsided Lovász Local Lemma

The Lopsided Lovász Local Lemma Joint work with Linyuan Lu and László Székely Georgia Southern University April 27, 2013 The lopsided Lovász local lemma can establish the existence of objects satisfying several weakly correlated conditions

More information

Parameter estimators of sparse random intersection graphs with thinned communities

Parameter estimators of sparse random intersection graphs with thinned communities Parameter estimators of sparse random intersection graphs with thinned communities Lasse Leskelä Aalto University Johan van Leeuwaarden Eindhoven University of Technology Joona Karjalainen Aalto University

More information

The number of edge colorings with no monochromatic cliques

The number of edge colorings with no monochromatic cliques The number of edge colorings with no monochromatic cliques Noga Alon József Balogh Peter Keevash Benny Sudaov Abstract Let F n, r, ) denote the maximum possible number of distinct edge-colorings of a simple

More information

Combinatorial Optimization

Combinatorial Optimization Combinatorial Optimization Problem set 8: solutions 1. Fix constants a R and b > 1. For n N, let f(n) = n a and g(n) = b n. Prove that f(n) = o ( g(n) ). Solution. First we observe that g(n) 0 for all

More information

Permutations with fixed pattern densities

Permutations with fixed pattern densities arxiv:156.234v2 [math.co] 31 Aug 215 Permutations with fixed pattern densities Richard Kenyon Daniel Král Charles Radin Peter Winkler Abstract We study scaling limits of random permutations ( permutons

More information

Random Geometric Graphs

Random Geometric Graphs Random Geometric Graphs Mathew D. Penrose University of Bath, UK Networks: stochastic models for populations and epidemics ICMS, Edinburgh September 2011 1 MODELS of RANDOM GRAPHS Erdos-Renyi G(n, p):

More information

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )

More information

arxiv: v2 [math.pr] 22 Oct 2018

arxiv: v2 [math.pr] 22 Oct 2018 Breaking of ensemble equivalence for perturbed Erdős-Rényi random graphs arxiv:807.07750v [math.pr] Oct 08 F. den Hollander M. Mandjes A. Roccaverde 3 N.J. Starreveld 4 October 3, 08 Abstract In a previous

More information

Statistical Inference on Large Contingency Tables: Convergence, Testability, Stability. COMPSTAT 2010 Paris, August 23, 2010

Statistical Inference on Large Contingency Tables: Convergence, Testability, Stability. COMPSTAT 2010 Paris, August 23, 2010 Statistical Inference on Large Contingency Tables: Convergence, Testability, Stability Marianna Bolla Institute of Mathematics Budapest University of Technology and Economics marib@math.bme.hu COMPSTAT

More information

Notes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed

Notes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed 18.466 Notes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed 1. MLEs in exponential families Let f(x,θ) for x X and θ Θ be a likelihood function, that is, for present purposes,

More information

Probabilistic Graphical Models. Theory of Variational Inference: Inner and Outer Approximation. Lecture 15, March 4, 2013

Probabilistic Graphical Models. Theory of Variational Inference: Inner and Outer Approximation. Lecture 15, March 4, 2013 School of Computer Science Probabilistic Graphical Models Theory of Variational Inference: Inner and Outer Approximation Junming Yin Lecture 15, March 4, 2013 Reading: W & J Book Chapters 1 Roadmap Two

More information

P-adic Functions - Part 1

P-adic Functions - Part 1 P-adic Functions - Part 1 Nicolae Ciocan 22.11.2011 1 Locally constant functions Motivation: Another big difference between p-adic analysis and real analysis is the existence of nontrivial locally constant

More information

1. Principle of large deviations

1. Principle of large deviations 1. Principle of large deviations This section will provide a short introduction to the Law of large deviations. The basic principle behind this theory centers on the observation that certain functions

More information

Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence

Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence Andrzej Dudek adudek@emory.edu Andrzej Ruciński rucinski@amu.edu.pl June 21, 2008 Joanna Polcyn joaska@amu.edu.pl

More information

A Variational Principle for Permutations

A Variational Principle for Permutations A Variational Principle for Permutations Richard Kenyon Daniel Král Charles Radin Peter Winkler Abstract We define an entropy function for scaling limits of permutations, called permutons, and prove that

More information

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem 56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi

More information

Combinatorial Types of Tropical Eigenvector

Combinatorial Types of Tropical Eigenvector Combinatorial Types of Tropical Eigenvector arxiv:1105.55504 Ngoc Mai Tran Department of Statistics, UC Berkeley Joint work with Bernd Sturmfels 2 / 13 Tropical eigenvalues and eigenvectors Max-plus: (R,,

More information

Entropy, mixing, and independence

Entropy, mixing, and independence Entropy, mixing, and independence David Kerr Texas A&M University Joint work with Hanfeng Li Let (X, µ) be a probability space. Two sets A, B X are independent if µ(a B) = µ(a)µ(b). Suppose that we have

More information

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.

More information

Mathematics 530. Practice Problems. n + 1 }

Mathematics 530. Practice Problems. n + 1 } Department of Mathematical Sciences University of Delaware Prof. T. Angell October 19, 2015 Mathematics 530 Practice Problems 1. Recall that an indifference relation on a partially ordered set is defined

More information

On John type ellipsoids

On John type ellipsoids On John type ellipsoids B. Klartag Tel Aviv University Abstract Given an arbitrary convex symmetric body K R n, we construct a natural and non-trivial continuous map u K which associates ellipsoids to

More information

A NOTE ON THE TURÁN FUNCTION OF EVEN CYCLES

A NOTE ON THE TURÁN FUNCTION OF EVEN CYCLES PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 A NOTE ON THE TURÁN FUNCTION OF EVEN CYCLES OLEG PIKHURKO Abstract. The Turán function ex(n, F

More information

Mathematical Methods for Physics and Engineering

Mathematical Methods for Physics and Engineering Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory

More information

Large deviations for random projections of l p balls

Large deviations for random projections of l p balls 1/32 Large deviations for random projections of l p balls Nina Gantert CRM, september 5, 2016 Goal: Understanding random projections of high-dimensional convex sets. 2/32 2/32 Outline Goal: Understanding

More information

Multipodal Structure and Phase Transitions in Large Constrained Graphs

Multipodal Structure and Phase Transitions in Large Constrained Graphs Multipodal Structure and Phase Transitions in Large Constrained Graphs Richard Kenyon Charles Radin Kui Ren Lorenzo Sadun July 2, 26 Abstract We study the asymptotics of large, simple, labeled graphs constrained

More information

Mid Term-1 : Practice problems

Mid Term-1 : Practice problems Mid Term-1 : Practice problems These problems are meant only to provide practice; they do not necessarily reflect the difficulty level of the problems in the exam. The actual exam problems are likely to

More information

Part III. 10 Topological Space Basics. Topological Spaces

Part III. 10 Topological Space Basics. Topological Spaces Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.

More information

Conditional Marginalization for Exponential Random Graph Models

Conditional Marginalization for Exponential Random Graph Models Conditional Marginalization for Exponential Random Graph Models Tom A.B. Snijders January 21, 2010 To be published, Journal of Mathematical Sociology University of Oxford and University of Groningen; this

More information

Behaviour of Lipschitz functions on negligible sets. Non-differentiability in R. Outline

Behaviour of Lipschitz functions on negligible sets. Non-differentiability in R. Outline Behaviour of Lipschitz functions on negligible sets G. Alberti 1 M. Csörnyei 2 D. Preiss 3 1 Università di Pisa 2 University College London 3 University of Warwick Lars Ahlfors Centennial Celebration Helsinki,

More information

Lecture 6: Gaussian Channels. Copyright G. Caire (Sample Lectures) 157

Lecture 6: Gaussian Channels. Copyright G. Caire (Sample Lectures) 157 Lecture 6: Gaussian Channels Copyright G. Caire (Sample Lectures) 157 Differential entropy (1) Definition 18. The (joint) differential entropy of a continuous random vector X n p X n(x) over R is: Z h(x

More information