The Cosmic Spiderweb: void/wall perpendicularity in (...) - M. Neyrinck - Workshop 1 - CEB T3 2018
Mark Neyrinck (Univ. of the Basque Country, Bilbao) / 20.09.2018 The Cosmic Spiderweb: void/wall perpendicularity in the adhesion model ---------------------------------- Vous pouvez nous rejoindre sur les réseaux sociaux pour suivre nos actualités. Facebook : https://www.facebook.com/I
From playlist 2018 - T3 - Analytics, Inference, and Computation in Cosmology
Elliot Paquette : Anchored expansion in the hyperbolic Poisson Voronoi tessellation
Abstract: We show that random walk on a stationary random graph with positive anchored expansion and exponential volume growth has positive speed. We also show that two families of random triangulations of the hyperbolic plane, the hyperbolic Poisson Voronoi tessellation and the hyperbolic
From playlist Combinatorics
Chris Judge: Translation structures, ideas and connections
CONFERENCE Recorded during the meeting " Structures on Surfaces " the May 05, 2022 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual Mathema
From playlist Dynamical Systems and Ordinary Differential Equations
Tobias Mueller: Percolation on hyperbolic Poisson-Voronoi tessellations
I will discuss percolation on the Voronoi tessellation generated by a homogeneous Poisson point process on the hyperbolic plane. That is, we colour each cell of the hyperbolic Poisson-Voronoi tessellation black with probability p and white with probability 1 − p, independently of the colou
From playlist Workshop: High dimensional spatial random systems
Paul GUNNELLS - Cohomology of arithmetic groups and number theory: geometric, ... 4
In this lecture series, the first part will be dedicated to cohomology of arithmetic groups of lower ranks (e.g., Bianchi groups), their associated geometric models (mainly from hyperbolic geometry) and connexion to number theory. The second part will deal with higher rank groups, mainly
From playlist École d'Été 2022 - Cohomology Geometry and Explicit Number Theory
How far is it from everywhere to somewhere?
Computing the Euclidean Distance Transform on a regular grid. A fundamental operation in image processing, used as part of separating objects, finding best matches, finding sizes of objects, and so on. The algorithm presented here is described in: J. Wang and Ying Tan, Efficient Euclide
From playlist Summer of Math Exposition Youtube Videos
k nearest neighbor (kNN): how it works
[http://bit.ly/k-NN] The k-nearest neighbor (k-NN) algorithm is based on the intuition that similar instances should have similar class labels (in classification) or similar target values (regression). The algorithm is very simple, but is capable of learning highly-complex non-linear decis
From playlist Nearest Neighbour Methods
STPM - The Structure of Materials - Jeremy Mason
STPM - The Structure of Materials Jeremy Mason Institute for Advanced Study September 27, 2010
From playlist Mathematics
Leonie Scheeren - The Voronoi Algorithm for calculating unit groups
Following an algorithm by Coulangeon, Nebe, Braun and Schönnenbeck to compute unit groups of orders in finite simple Q-algebras, we will again talk about the Voronoi algorithm for finding perfect forms. In this case we will work with a generalized version by Opgenorth in the context of dua
From playlist École d'Été 2022 - Cohomology Geometry and Explicit Number Theory
Homological Algebra(Homo Alg) 2 by Graham Ellis
DATE & TIME 05 November 2016 to 14 November 2016 VENUE Ramanujan Lecture Hall, ICTS Bangalore Computational techniques are of great help in dealing with substantial, otherwise intractable examples, possibly leading to further structural insights and the detection of patterns in many abstra
From playlist Group Theory and Computational Methods