BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for 
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20230111T153000
DTEND;TZID=UTC:20230111T163000
DTSTAMP:20260615T181317
CREATED:20230106T111103Z
LAST-MODIFIED:20230106T113715Z
UID:7016-1673451000-1673454600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Pawel Pralat\, Metropolitan University of Toronto
DESCRIPTION:An Unsupervised Framework for Comparing Graph Embeddings\nThe goal of many machine learning applications is to make predictions or discover new patterns using graph-structured data as feature information. In order to extract useful structural information from graphs\, one might want to try to embed it in a geometric space by assigning coordinates to each node such that nearby nodes are more likely to share an edge than those far from each other. There are many embedding algorithms (based on techniques from linear algebra\, random walks\, or deep learning) and the list constantly grows. As a result\, selecting the best embedding is a challenging task and very often requires domain experts. Our general framework assigns the divergence score to each embedding which\, in an unsupervised learning fashion\, distinguishes good from bad embeddings. In order to benchmark embeddings\, we generalize the Chung-Lu random graph model to incorporate geometry.\n\n\nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/82306017918?pwd=Q0hKTElTMzQxaythWmE3SnhtbGZDUT09\n\nMeeting ID: 823 0601 7918\nPasscode: 045489
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-pawel-pralat-metropolitan-university-of-toronto/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20230118T153000
DTEND;TZID=UTC:20230118T163000
DTSTAMP:20260615T181317
CREATED:20230113T131357Z
LAST-MODIFIED:20230113T131357Z
UID:7049-1674055800-1674059400@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Jane (Pu) Gao\, University of Waterloo
DESCRIPTION:Conditions for perfect matchings in random sparse bipartite graphs \nGiven a uniformly random sparse matrix A\, with specified number of nonzero entries in columns and rows\, we determine when A has full row rank over a finite field. As a corollary\, by considering A as the adjacency matrix of a bipartite graph\, our result determines the conditions for the existence of a perfect matching in various models of random sparse bipartite graphs. We will explore some useful insight from statistical physics that guides our probabilistic combinatorial proof. This is joint work with Coja-Oghlan\, Hahn-Klimroth\, Lee\, Mueller and Rolvien. \n  \nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/82306017918?pwd=Q0hKTElTMzQxaythWmE3SnhtbGZDUT09\n\nMeeting ID: 823 0601 7918\nPasscode: 045489
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-jane-pu-gao-university-of-waterloo/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
END:VCALENDAR