09:00-09:45 | Welcome coffee |
09:45-10:35 | Tomasz Luczak (Adam Mickiewicz University, Poznań, Poland) “Ramsey numbers and random graphs”
Abstract: We write G–> (H_1, H_2,…, H_k) if any colouring of the edges of a graph G with k colors results in a monochromatic copy of a graph H_i for some i=1,2,…,k. In Ramsey Theory we want to find the smallest graph G with this property for a given k-tuple (H_1,H_2, …, H_k), where the size of G is measured by the number of its vertices or/and edges. In the talk we demonstrate how tools used in random graph theory, such as Sparse Regularity Lemma and Sandwich Theorem, can be applied to estimate Ramsey numbers for cycles and paths. |
10:35-11:00 | Coffee break |
11:00-11:50 | Jacques Verstraete (University of California, San Diego) “Small maximal independent sets in hypergraphs”
Abstract: Let $\mathcal{S} = \{S_1,S_2,\dots,S_n\}$ be a family of finite sets. A maximal independent set in $\mathcal{S}$ is a set $X \subseteq \bigcup_{i = 1}^n S_i$ such that for all $i = 1,2,\dots,n$, $S_i \not \subseteq X$. We consider a random process for producing a maximal independent set in a family $\mathcal{S}$ of sets based on restrictions on the intersections between the sets in the family. In particular, the following theorem is a corollary: There exists a constant $c > 0$ such that in any projective plane of order $q$, there exists a set $X$ of at most $c\sqrt{q}\log q$ points such that every line contains at most two of the points, but the addition of any point to $X$ gives a line containing two elements of $X$ plus the additional point. In the language of finite geometry, this is to say that every projective plane of order $q$ contains a {\em maximal arc} of size of order at most $c\sqrt{q}\log q$.
|
12:00-14:30 | Lunch break |
14:30-15:20 | David Jekel (University of Copenhagen) “Optimizers for the Sherrington-Kirkpartrick model via potential Hessian ascent and free probability”.
Abstract: Using tools from free probability, we describe an algorithm for finding the ground state energy in the Sherrington-Kirkpatrick model. The SK model is an instance of a spin glass, where we consider a graph $(V,E)$ and (random) interaction weights for each pair of adjacent vertices, and study the possible configurations assigning $\pm 1$ to each vertex. In the SK model, $G$ is a complete graph and the interactions are independent Gaussian, so the Hamiltonian is $H(\sigma) = \langle \sigma, A \sigma \rangle$, where $A$ is an $n \times n$ GOE (Gaussian orthogonal ensemble) random matrix and $\sigma \in \{-1,1\}^n$ is the spin configuration. Thus, finding the ground state energy means maximizing $\langle \sigma, A \sigma \rangle$ over $\{-1,1\}^n$. We want to find near-maximizers algorithmically in polynomial time in $n$ even though the size of the system is exponential in $n$. We follow a similar approach to that which Subag used on the sphere; we extend the objective function $\langle \sigma, A \sigma \rangle$ to the convex hull $[-1,1]$ while adding a certain potential $\sum_j \Lambda(\sigma_j)$ on the interior. Here $\Lambda$ is a function obtained from the Parisi formula that describes the large-$n$ behavior of the maximum. The new objective function will have a path of near-maximizers from the origin to the somewhere near the corners of the cube. We follow such an approximate path by a sequence of iterations which move in a random direction in the bottom part of the spectrum of the Hessian of the objective. We are able to control the diagonal of the approximate spectral projection using a certain conditional expectation formula in free probability together with asymptotic expansions and concentration of measure. Controlling the diagonal in turn allows us to show convergence of the empirical distribution of our vectors toward the Auffinger-Chen SDE and hence show near-optimality. |
15:30-16:00 | Coffee break |
16:00-16:50 | Luciano Pietronero (Enrico Fermi Research Center, Rome, Italy and Institute for Complex Systems, CNR, Rome, Italy) “Economic Fitness and Complexity and AI for the Economic Analysis”.
Abstract: Economic Fitness and Complexity (EFC) is the recent economic discipline and methodology we have developed in the past ten years. EFC makes use and develops the modern techniques of data analysis to build economic models based on a scientific methodology inspired by the science of Complex Systems with special attention to quantitative tests to provide a sound scientific framework. It consists of a data based and bottom up approach that considers specific and concrete problems without economic ideologies and it acquires information from the previous growth data of all countries with methods of Complex Networks, Algorithms and Machine Learning. Its main characteristics are the scientific rigor, the precision in the analysis and in the forecasting, transparency and adaptability. According to Bloomberg Views: “New research has demonstrated that the “fitness” technique systematically outperforms standard methods, despite requiring much less data”. Recently we have developed these methodologies to study also the impact of AI on the Job Market. Introducing the concept of Job Fitness, on average we observe an inverse proportionality between Job Fitness and AI impact. However, there are also important outliers which require additional considerations. Stimulated by these observations we have developed a radically different and more scientific approach to estimate these effects. This has led us to reconsider the standard information for the impact of AI on the skills. The common wisdom is based on subjective experts opinion while we have now introduced a new approach based on real Start Up investment, which is more objective and scientific and it leads to important differencies. In general, up to now we have considered mostly the analysis of countries. The present challenge is to extend these methodology also for firms. This requires new data and new concepts. |
17:00-17:30 | Concluding remarks/future plans |
The 2023 edition will be held in Sorbonne Abu Dhabi on December 8. The program is as follows:
09:00-09:45 | Welcome coffee |
09:45-10:35 | Patrick Oliveira Santos (Université Gustave Eiffel) “Universality of Wigner’s semicircular law”
Abstract: Let W be a symmetric matrix with i.i.d centered entries with unit variance. The celebrated Wigner’s theorem states that the empirical law of eigenvalues of W, properly normalized, converges weakly to the semicircular law. In this talk, we explore the universality and stability of Wigner’s semicircular law under sparsification and variance profiles. In other words, we consider a random matrix X= Σ∘W, where Σ is a deterministic matrix and ∘ is the Hadamard product. Among several results, we prove necessary and sufficient conditions for the universality of the semicircular law and the existence of outliers in the spectral distribution. This is a joint work with Dylan Altschuler, Konstantin Tikhomirov, and Pierre Youssef. |
10:35-11:00 | Coffee break |
11:00-11:50 | Federico Camia (NYUAD) “Towards a logarithmic conformal field theory of percolation”
Abstract: Conformal field theory (CFT) provides a very powerful framework to study the large-scale properties of models of statistical mechanics at their critical point.
The prototypical example of this is the continuum (scaling) limit of the two-dimensional critical Ising model. The case of critical percolation is more difficult, partly because its continuum limit is believed to be described by a relatively unusual type of CFT, called a logarithmic CFT. In this talk, I will first briefly explain the statements above. I will then present some recent results and work in progress that are part of a program aimed at fitting percolation within the logarithmic CFT framework. |
12:00-14:30 | Lunch break |
14:30-15:20 | Mohamed Seddik (Technology Innovation Institute) “Unlocking Generative Models: Insights from Random Matrix Theory”.
Abstract: In this talk, we will delve into the asymptotic study of simple linear generative models when both the sample size and data dimension grow to infinity. In this high-dimensional regime, random matrix theory (RMT) appears to be a natural tool to assess the model’s performance by examining its asymptotic learned conditional probabilities, its associated fluctuations, and the model’s generalization error. This analytical approach not only enhances our comprehension of generative language models but might also offer novel insights into their refinement through the lens of high-dimensional statistics and RMT. |
15:30-16:00 | Coffee break |
16:00-16:50 | Pierre Youssef (NYUAD) “Regularized functional inequalities, discrete curvature and applications to Markov chains’’.
Abstract: Functional inequalities in discrete settings play a key role in establishing concentration inequalities as well as capturing mixing properties of the underlying dynamics. We investigate the hierarchy of some standard functional inequalities, namely log-Sobolev inequality (LSI), modified log-Sobolev inequality (MLSI), and Poincaré inequality (PI). Using a regularization trick, we provide sharp general comparisons between those inequalities. We present several applications of this, implementing general comparison procedures for Markov chains as well as answering several open problems regarding mixing times. We also investigate connections to discrete curvature and discrete transport inequalities. This is based on joint works with Justin Salez and Konstantin Tikhomirov. |
17:00-17:30 | Concluding remarks/future plans |
The 2022 edition was held in Sorbonne Abu Dhabi on December 7. The program was as follows:
13:30-14:30 | Lunch gathering |
14:30-15:30 | Laurent Ménard, Université Paris Nanterre, France. “Spin clusters in random triangulations coupled with Ising mode”. Video. |
15:30-16:00 | Coffee break |
16:00-16:00 | Kalle Kytölä, Aalto University, Finland. “Boundary correlations in planar LERW and UST.” Video. |
17:00-17:30 | Coffee break |
17:30-18:30 | Cécile Durot, Université Paris Nanterre, France. “Unlinked monotone regression”. Video. |
19:00-21:00 | Dinner |