Hypergraph Bipartite Turan Problems
Explore recent findings on hypergraph bipartite Turan problems, including solutions to challenges posed by prominent researchers in the field.
Toward a Density Corradi-Hajnal Theorem for Degenerate Hypergraphs - ICBS 2024
Explore density Corrádi-Hajnal theorem for degenerate hypergraphs, examining extremal constructions across intervals and characterizing them for graphs and specific nondegenerate hypergraphs.
Random Walk on Dynamical Percolation: Separating Critical and Supercritical Regimes
Explore random walks on dynamical percolation, examining critical and supercritical regimes in infinite regular trees and lattices. Analyze speed bounds and mean squared displacement.
Equiangular Lines and Eigenvalue Multiplicity - ICBS 2024
Explore equiangular lines in high dimensions, solving a longstanding problem using spectral graph theory and discussing future research directions.
Graph Limits and Homomorphism Density Inequalities
Explore graph limits theory, homomorphism density inequalities, and their applications in extremal combinatorics. Gain insights into undecidability and randomness in graph theory.
Properties of the Unit Distance Graph of the Plane
Explore properties of the unit distance graph of the plane, including the Hadwiger-Nelson problem, Erdos' conjecture, and fractional chromatic number.
The Bounded Pathwidth of Control-Flow Graphs
Explore bounded pathwidth in control-flow graphs, its advantages over treewidth, and its applications in static analysis and compiler optimization. Gain insights into more efficient algorithms for program analysis.
Learning on Graphs: From Representation to Minimally Supervised
Explore graph representation learning, from shallow to deep embedding, for heterogeneous data. Discover algorithms for temporal and dynamic graphs, and few-shot learning techniques for minimally supervised scenarios.
HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers
Explore higher-order dynamic graph representation learning with efficient Transformers for improved link prediction in rapidly changing graphs. Learn about HOT model's architecture and performance.
Convex Network Flows - Optimization Framework and Applications
Introducing a general framework for modeling flow problems over hyper graphs, with applications in network optimization, power flow, and wireless networks. Includes fast, parallelizable algorithm implementation in Julia.
Towards Foundation Models for Graphs
Explore cutting-edge research on foundation models for graph data structures, examining their potential applications and implications for AI and machine learning.
Attractor Decompositions in Games and Automata
Explore attractor decompositions in graphs, their role in parity games, and applications to automata theory. Learn about structural complexity measures and strategy analysis.
Global Synchronization: New Theorems and Puzzles in Kuramoto Oscillator Networks
Explore global synchronization in Kuramoto oscillator networks, examining critical connectivity thresholds and unsolved puzzles in network behavior.
Party Hard! The Maths of Connections - 2013
Explore unexpected applications of connection mathematics, from modeling flu epidemics to galaxy formation, through an intriguing party guest problem.
Discrete Random Models - Minicourse 03
Explore discrete random models in this advanced mathematics workshop. Gain insights into probabilistic techniques for analyzing complex network structures and random processes.
Tournaments on Root Systems
Explore tournaments on root systems in discrete probability and statistics. Engage in collaborative research, minicourses, and open problem sessions at IMPA's month-long extended program for mathematicians.
The Number of Random 2-SAT Solutions is Asymptotically Log-Normal
Explore discrete probability and statistics in a month-long program featuring talks, minicourses, and collaborative sessions. Engage with researchers and delve into topics like random 2-SAT solutions.
Random Discrete Models - Course 1
Explore random discrete models in this advanced mathematics lecture. Delve into probability theory and network analysis with expert insights from PUC-Chile researcher Dieter Mitsche.
K-rings of Wonderful Varieties and Matroids
Explore K-rings of wonderful varieties and matroids with Shiyue Li, delving into advanced mathematical concepts and their applications in algebraic geometry.
התפשטות מוצרים חדשניים ברשתות
חקור את התפשטות מוצרים חדשניים ברשתות עם פרופ' גדי פיביך. גלה תובנות על דינמיקת השוק והתנהגות צרכנים בעידן הדיגיטלי.
Iterative Construction of Discrete Laplacians on 2D Square and Hexagonal Lattices
Explore iterative construction of discrete Laplacians on 2D square and hexagonal lattices using BTBB and other sequences. Compare methods and discover the exceptional nature of the BTBB sequence.