Tue, 11 Feb 2025
14:00
C4

Physical Network Constraints Define the Lognormal Architecture of the Brain's Connectome

Daniel Barabasi
(Harvard University )
Abstract

While the brain has long been conceptualized as a network of neurons connected by synapses, attempts to describe the connectome using established models in network science have yielded conflicting outcomes, leaving the architecture of neural networks unresolved. Here, we analyze eight experimentally mapped connectomes, finding that the degree and the strength distribution of the underlying networks cannot be described by random nor scale-free models. Rather, the node degrees and strengths are well approximated by lognormal distributions, whose emergence lacks a mechanistic model in the context of networks. Acknowledging the fact that the brain is a physical network, whose architecture is driven by the spatially extended nature of its neurons, we analytically derive the multiplicative process responsible for the lognormal neuron length distribution, arriving to a series of empirically falsifiable predictions and testable relationships that govern the degree and the strength of individual neurons. The lognormal network characterizing the connectome represents a novel architecture for network science, that bridges critical gaps between neural structure and function, with unique implications for brain dynamics, robustness, and synchronization.

Tue, 18 Feb 2025
14:00
C4

Temporal graph reproduction with RWIG

Piet Van Mieghem
(Delft University of Technology)
Abstract

Our Random Walkers Induced temporal Graphs (RWIG) model generates temporal graph sequences based on M independent, random walkers that traverse an underlying graph as a function of time. Co-location of walkers at a given node and time defines an individual-level contact. RWIG is shown to be a realistic model for temporal human contact graphs.   

A key idea is that a random walk on a Markov graph executes the Markov process. Each of the M walkers traverses the same set of nodes (= states in the Markov graph), but with own transition probabilities (in discrete time) or rates (in continuous time). Hence, the Markov transition probability matrix Pj reflects the policy of motion of walker wj. RWIG is analytically feasible: we derive closed form solutions for the probability distribution of contact graphs.

Usually, human mobility networks are inferred through measurements of timeseries of contacts between individuals. We also discuss this “inverse RWIG problem”, which aims to determine the parameters in RWIG (i.e. the set of probability transfer matrices P1, P2, ..., PM and the initial probability state vectors s1[0], ...,sM[0] of walkers w1,w2, ...,wM in discrete time), given a timeseries of contact graphs.

This talk is based on the article:
Almasan, A.-D., Shvydun, S., Scholtes, I. and P. Van Mieghem, 2025, "Generating Temporal Contact Graphs Using Random Walkers", IEEE Transactions on Network Science and Engineering, to appear.


 

Mon, 10 Mar 2025
16:00
C4

Sums of integers divisible by the sum of their digits

Kate Thomas
(University of Oxford)
Abstract

A base-g Niven number is an integer divisible by the sum of its digits in base-g. We show that any sufficiently large integer can be written as the sum of three base-3 Niven numbers, and comment on the extension to other bases. This is an application of the circle method, which we use to count the number of ways an integer can be written as the sum of three integers with fixed, near-average, digit sum. 

Mon, 24 Feb 2025
16:00
C4

Modularity of certain trianguline Galois representations

James Kiln
(Queen Mary University of London)
Abstract

A generalisation of Wiles’ famous modularity theorem, the Fontaine-Mazur conjecture, predicts that two dimensional representations of the absolute Galois group of the rationals, with a few specific properties, exactly correspond to those representations coming from classical modular forms. Under some mild hypotheses, this is now a theorem of Kisin. In this talk, I will explain how one can p-adically interpolate the objects on both sides of this correspondence to construct an eigensurface and “trianguline” Galois deformation space, as well as outline a new approach to proving a theorem of Emerton, that these spaces are often isomorphic.

Mon, 10 Feb 2025
16:00
C4

A new axiom for $\mathbb{Q}_p^{ab}$ and non-standard methods for perfectoid fields

Leo Gitin
(University of Oxford)
Abstract

The class of henselian valued fields with non-discrete value group is not well-understood. In 2018, Koenigsmann conjectured that a list of seven natural axioms describes a complete axiomatisation of $\mathbb{Q}_p^{ab}$, the maximal extension of the $p$-adic numbers $\mathbb{Q}_p$ with abelian Galois group, which is an example of such a valued field. Informed by the recent work of Jahnke-Kartas on the model theory of perfectoid fields, we formulate an eighth axiom (the discriminant property) that is not a consequence of the other seven. Revisiting work by Koenigsmann (the Galois characterisation of $\mathbb{Q}_p$) and Jahnke-Kartas, we give a uniform treatment of their underlying method. In particular, we highlight how this method yields short, non-standard model-theoretic proofs of known results (e.g. finite extensions of perfectoid fields are perfectoid).

Mon, 27 Jan 2025
16:00
C4

Applied analytic number theory

Cédric Pilatte
(University of Oxford)
Abstract

The security of many widely used communication systems hinges on the presumed difficulty of factoring integers or computing discrete logarithms. However, Shor's celebrated algorithm from 1994 demonstrated that quantum computers can perform these tasks in polynomial time. In 2023, Regev proposed an even faster quantum algorithm for factoring integers. Unfortunately, the correctness of his new method is conditional on an ad hoc number-theoretic conjecture. Using tools from analytic number theory, we establish a result in the direction of Regev's conjecture. This enables us to design a provably correct quantum algorithm for factoring and solving the discrete logarithm problem, whose efficiency is comparable to Regev's approach. In this talk, we will give an accessible account of these developments.

Mon, 02 Dec 2024
13:30
C4

Extended TQFT, gauge theory, and Measurement Based Quantum Computation

Gabriel Wong
Abstract

Measurement-Based Quantum Computation (MBQC) is a model of quantum computation driven by measurements instead of unitary gates.   In 2D it is capable of supporting universal quantum computations.   Interestingly, while all measurements are local, the computational output involves non local observables.   We will use the simpler case of 1D MBQC to illustrate how these features can be captured by ideas from gauge theory and extended TQFT. We will also explain  MBQC from the perspective of the extended Hilbert space construction in gauge theories, in which the entanglement edge modes play the role of the logical qubit.

Mon, 25 Nov 2024
13:30
C4

The Evaporation of Charged Black Holes

Clément Virally
Abstract

Since Hawking first discovered that black holes radiate, the evaporation of black holes has been a subject of great interest. In this talk, based on [2411.03447], we review some recent results about the evaporation of charged (Reissner-Nordström) black holes. We consider in particular the difference between neutral and charged particle emission, and explain how this drives the black hole near extremality, as well as how evaporation is then changed in that limit.

Mon, 11 Nov 2024
13:30
C4

A Celestial Dual for MHV Amplitudes

Walker Melton (Harvard)
Abstract

Celestial holography posits that the 4D S-matrix may be calculated holographically by a 2D conformal field theory. However, bulk translation invariance forces low-point massless celestial amplitudes to be distributional, which is an unusual property for a 2D CFT. In this talk, I show that translation-invariant MHV gluon amplitudes can be extracted from smooth 'leaf' amplitudes, where a bulk interaction vertex is integrated only over a hyperbolic slice of spacetime. After describing gluon leaf amplitudes' soft and collinear limits, I will show that MHV leaf amplitudes can be generated by a simple 2D system of free fermions and the semiclassical limit of Liouville theory, showing that translation-invariant, distributional amplitudes can be obtained from smooth correlation functions. An important step is showing that, in the semiclassical limit of Liouville theory, correlation functions of light operators are given by contact AdS Witten diagrams. This talk is based on a series of papers with Atul Sharma, Andrew Strominger, and Tianli Wang [2312.07820, 2402.04150,2403.18896]. 

Subscribe to C4