BEGIN:VCALENDAR VERSION:2.0 X-WR-CALNAME:EventsCalendar PRODID:-//hacksw/handcal//NONSGML v1.0//EN CALSCALE:GREGORIAN BEGIN:VTIMEZONE TZID:America/New_York LAST-MODIFIED:20240422T053451Z TZURL:https://www.tzurl.org/zoneinfo-outlook/America/New_York X-LIC-LOCATION:America/New_York BEGIN:DAYLIGHT TZNAME:EDT TZOFFSETFROM:-0500 TZOFFSETTO:-0400 DTSTART:19700308T020000 RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU END:DAYLIGHT BEGIN:STANDARD TZNAME:EST TZOFFSETFROM:-0400 TZOFFSETTO:-0500 DTSTART:19701101T020000 RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU END:STANDARD END:VTIMEZONE BEGIN:VEVENT CATEGORIES:Academic Affairs,College of Arts and Sciences,College of Enginee ring,Graduate Studies,Lectures and Seminars,Research DESCRIPTION:Mitochondria of eukaryotic cells contain tubular networks that are critical to a cellā€™s energy production.Ā Mitochondrial tubular netw orks overwhelmingly have nodes of only degree 1 or 3, with degree 3 predom inating (approx.Ā 80%). An abstract mitochondrial graph is a graph with ve rtices of only degree 1 or 3. We describe recent work of Mostov, Lewis and Marshall showing via random graphs that combinatorial constraints alone, without additional biological considerations, predict that mitochondrial n etworks contain a large, connected component. We detail joint work with El isha Rogatch, in progress, on assessing synchronizability of connected abs tract mitochondrial graphs via the ratio R of the maximum eigenvalue of th e unnormalized Laplacian matrix of the graph (diagonal degree matrix ā€“ a djacency matrix) to the smallest non-zero eigenvalue of the Laplacian (Fie dler eigenvalue). We describe statistics of the values for R that indicate as the fraction of degree 1 vertices increases mitochondrial tubular netw orks become increasingly far from synchronizable for purely graph-theoreti c reasons. Reference: Mostov, R., Lewis, G. R., Das, M. & Marshall, W. F. (2026). Combinatorial constraints predict that mitochondrial networks cont ain a large component.Ā bioRxiv, 2026-03.\nEvent page: https://www.umassd. edu/events/cms/joint-data-and-computational-science-seminar-series-graph-t heoretic-properties-of-mitochondrial-tubular-networks.php X-ALT-DESC;FMTTYPE=text/html:

ĢĒŠÄlogoČėæŚ

Mitochondria of eukaryotic cell s contain tubular networks that are critical to a cellā€™s energy producti on.Ā Mitochondrial tubular networks overwhelmingly have nodes of only deg ree 1 or 3\, with degree 3 predominating (approx.Ā 80%). An abstract mitoc hondrial graph is a graph with vertices of only degree 1 or 3. We describe recent work of Mostov\, Lewis and Marshall showing via random graphs that combinatorial constraints alone\, without additional biological considera tions\, predict that mitochondrial networks contain a large\, connected co mponent. We detail joint work with Elisha Rogatch\, in progress\, on asses sing synchronizability of connected abstract mitochondrial graphs via the ratio R of the maximum eigenvalue of the unnormalized Laplacian matrix of the graph (diagonal degree matrix ā€“ adjacency matrix) to the smallest no n-zero eigenvalue of the Laplacian (Fiedler eigenvalue). We describe stati stics of the values for R that indicate as the fraction of degree 1 vertic es increases mitochondrial tubular networks become increasingly far from s ynchronizable for purely graph-theoretic reasons.

Reference: Mosto v\, R.\, Lewis\, G. R.\, Das\, M. & Marshall\, W. F. (2026). Combinatorial constraints predict that mitochondrial networks contain a large component .Ā bioRxiv\, 2026-03.

Event page: https://www.umassd.ed u/events/cms/joint-data-and-computational-science-seminar-series-graph-the oretic-properties-of-mitochondrial-tubular-networks.php

DTSTAMP:20260425T131933 DTSTART;TZID=America/New_York:20260506T133000 DTEND;TZID=America/New_York:20260506T143000 LOCATION:TXT105A SUMMARY;LANGUAGE=en-us:Joint Data and Computational Science Seminar Series: Graph-theoretic properties of mitochondrial tubular networks UID:fd273b88500a4b6cfb9722e2cb78f039@www.umassd.edu END:VEVENT END:VCALENDAR