BEGIN:VCALENDAR
PRODID:-//PSU Mathematics Department//Seminar iCalendar Generator//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Applied Algebra and Network Theory Seminar
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150114T153000
DTEND;TZID=America/New_York:20150114T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25813
SUMMARY:Applied Algebra and Network Theory Seminar - Abstract Structures in
the Design and Analysis of Quantum Algorithms
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: Abs
tract Structures in the Design and Analysis of Quantum Algorithms\nSpeaker
: William Zeng\, Oxford University\nAbstract: Despite almost two decades o
f research\, there is still a need to find new and useful quantum algorith
ms. This is of interest in cases where the usefulness ranges from ``able
to generate experimental evidence against the extended Church-Turing thesi
s" to ``commercially viable". Better languages\, frameworks\, and techniqu
es for analyzing the structure of quantum algorithms will aid in these att
empts. One such programme\, initiated by Abramsky\, Coecke\, et. al\, abs
tracts the setting of quantum information away from Hilbert spaces and lin
ear maps into abstract process theories: dagger symmetric monoidal categor
ies.\n\nThis talk will have three goals:\n[0] Introduce how this abstract
semantics applies to quantum computation\n[1] Show how this abstract setti
ng has been used to design and analyze quantum algorithms in the tradition
al setting of finite Hilbert spaces and linear maps\n[2] Describe some cur
rent work that uses this framework to construct a model of quantum algorit
hms in the category of relations.\n\nSee: W. J. Zeng. Models of quantum al
gorithms in sets and relations: (in preparation)\, W. J. Zeng & Jamie Vica
ry. Abstract structure of unitary oracles for quantum algorithms: arxiv.or
g/abs/1406.1278\, Jamie Vicary. The Topology of of Quantum Algorithms: arx
iv.org/abs/1209.3917
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150121T153000
DTEND;TZID=America/New_York:20150121T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25814
SUMMARY:Applied Algebra and Network Theory Seminar - (Cancelled due to weat
her )Tensor networks\, model reduction\, and error modeling
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: (Ca
ncelled due to weather )Tensor networks\, model reduction\, and error mode
ling\nSpeaker: Jacob Biamonte\, ISI Foundation
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150128T153000
DTEND;TZID=America/New_York:20150128T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25815
SUMMARY:Applied Algebra and Network Theory Seminar - TBA
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: TBA
\nAbstract Link: http://
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150204T153000
DTEND;TZID=America/New_York:20150204T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25816
SUMMARY:Applied Algebra and Network Theory Seminar - No Seminar (See Math B
io and Neuroscience talks)
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: No
Seminar (See Math Bio and Neuroscience talks)\nAbstract: See \nhttp://www.
math.psu.edu/calendars/meeting.php?id=24693\nand \nhttp://www.huck.psu.edu
/content/events/2015-02-04-210000eva-pastalkovabe-announced
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150211T153000
DTEND;TZID=America/New_York:20150211T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25817
SUMMARY:Applied Algebra and Network Theory Seminar - CANCELLED - TO BE RESC
HEDULED: Matrix Completion for the Independence Model
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: CAN
CELLED - TO BE RESCHEDULED: Matrix Completion for the Independence Model\n
Speaker: Zvi Rosen\, University of California\, Berkeley\nAbstract: Suppos
e you are given some entries of a matrix of probabilities for a pair of di
screte random variables. When is it possible that these entries come from
the independence model? In other words\, when can we complete a partial ma
trix to a rank-1 nonnegative matrix whose entries add up to one? We will a
pproach this problem using combinatorics and algebraic geometry. This talk
is based on joint work with Kaie Kubjas (Aalto).
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150218T153000
DTEND;TZID=America/New_York:20150218T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25818
SUMMARY:Applied Algebra and Network Theory Seminar - On Tuesday at 1pm in 1
06 (Laubenbacher)
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: On
Tuesday at 1pm in 106 (Laubenbacher)\nAbstract: Please see Reinhard Lauben
bacher's talk at\nhttps://www.math.psu.edu/calendars/meeting.php?id=24696
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150225T153000
DTEND;TZID=America/New_York:20150225T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25819
SUMMARY:Applied Algebra and Network Theory Seminar - TBA
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: TBA
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150304T153000
DTEND;TZID=America/New_York:20150304T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25820
SUMMARY:Applied Algebra and Network Theory Seminar - (RESCHEDULED due to un
iversity closure) Introduction to Reaction Network Theory
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: (RE
SCHEDULED due to university closure) Introduction to Reaction Network Theo
ry\nSpeaker: Jacob Biamonte\, ISI Foundation\nAbstract: There is a widely
used and successful theory of “chemical reaction networks”\, which pro
vides a framework describing any system governed by mass action kinetics.
Computer science and population biology use the same ideas under a differ
ent name: “stochastic Petri nets”. But if we look at these theories fr
om the perspective of quantum theory\, they turn out to involve creation a
nd annihilation operators\, coherent states and other well-known ideas—y
et in a context where probabilities replace amplitudes. We have recently b
een working to explain this connection as part of a detailed analogy betwe
en quantum mechanics and stochastic mechanics. Our general idea is about m
erging concepts from quantum physics and reaction network theory to provid
e a bidirectional bridge of relevant analysis tools to address networks in
both disciplines. http://arxiv.org/abs/1209.3632
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150311T153000
DTEND;TZID=America/New_York:20150311T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25821
SUMMARY:Applied Algebra and Network Theory Seminar - Spring Break - No Semi
nar
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: Spr
ing Break - No Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150318T153000
DTEND;TZID=America/New_York:20150318T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25822
SUMMARY:Applied Algebra and Network Theory Seminar - Operadic modularity in
networks
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: Ope
radic modularity in networks\nSpeaker: David Spivak\, MIT\nAbstract: An op
erad is a category-theoretic structure that encodes many-input\, one-outpu
t mappings. In this talk\, we will discuss how operads and their algebras
can serve as a framework for thinking about modular systems of all kinds\,
including various kinds of networks. In this setup\, an operad O lays out
an abstract language of architecture---rules for how interfaces can be ar
ranged to form "higher level" interfaces---and an O-algebra expresses an i
nterpretation of this abstract language. I will also discuss some new conn
ections between operad algebras and various flavors of monoidal categories
.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150325T153000
DTEND;TZID=America/New_York:20150325T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25823
SUMMARY:Applied Algebra and Network Theory Seminar - Mesoscale topological
statistics of force chain networks
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: Mes
oscale topological statistics of force chain networks\nSpeaker: Chad Giust
i\, University of Pennsylvania\nAbstract: Densely packed granular media ex
hibit a rich internal network of interactions characterized by so-called "
force chains" consisting of particles which exert above-average forces on
one another. The structure of these chains plays a substantial role in the
response of the media to perturbation\, but the mechanisms by which this
happens are not well understood. A vital first step toward prediction and
design of material packings is the development of techniques for measuring
physically salient properties of force chains. Here\, we describe work in
progress on a data-driven approach to the problem which combines communit
y-detection techniques for extracting force chains with topological statis
tics of the resulting structures to provide a mesoscale description of the
force chain network.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150401T153000
DTEND;TZID=America/New_York:20150401T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25824
SUMMARY:Applied Algebra and Network Theory Seminar - A Reformulation of the
CSSR Algorithm and Application to Optimal Deception Strategy
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: A R
eformulation of the CSSR Algorithm and Application to Optimal Deception St
rategy\nSpeaker: Elisabeth Paulson\, Penn State\nAbstract: In this talk we
explore a reformulation of the Casual State Splitting and Reconstruction
(CSSR) algorithm and an application to optimal strategies for deception in
two-player games. The CSSR algorithm is used to infer probabilistic finit
e-state machines from an input stream of data. We formulate an integer pro
gramming version of the CSSR algorithm which always results in minimal pro
babilistic finite-state machine. This reformulation is shown to be NP-hard
by comparing it to the minimal clique covering problem in graph theory. W
e then apply this algorithm to optimal deception strategies in repeated tw
o-player games. We find that this deception can be modeled by combining bo
th linear optimization with a genetic algorithm. We present numerical exam
ples of optimal deception as well as some theoretical results.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150408T153000
DTEND;TZID=America/New_York:20150408T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25825
SUMMARY:Applied Algebra and Network Theory Seminar - Matrix Completion for
the Independence Model
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: Mat
rix Completion for the Independence Model\nSpeaker: Zvi Rosen\, University
of California\, Berkeley\nAbstract: Suppose you are given some entries of
a matrix of probabilities for a pair of discrete random variables. When i
s it possible that these entries come from the independence model? In othe
r words\, when can we complete a partial matrix to a rank-1 nonnegative ma
trix whose entries add up to one? We will approach this problem using comb
inatorics and algebraic geometry. This talk is based on joint work with Ka
ie Kubjas (Aalto).
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150415T153000
DTEND;TZID=America/New_York:20150415T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25826
SUMMARY:Applied Algebra and Network Theory Seminar - Representation theory
and its application to quantum control
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: Rep
resentation theory and its application to quantum control\nSpeaker: Zoltan
Zimboras\, University College London\nAbstract: In this talk we present o
ur new representation theoretic results\nand show how these can be used in
quantum control theory.\n\nWe first study how tensor products of represen
tations decompose\nwhen restricted from a compact Lie algebra to one of it
s subalgebras.\nIn particular\, the focus will be on tensor squares which
are tensor\nproducts of a representation with itself. We show in a classif
ication-free\nmanner that the sum of multiplicities and the sum of squares
of\nmultiplicities in the corresponding decomposition of a tensor\nsquare
into irreducible representations has to strictly grow when\nrestricted fr
om a compact semisimple Lie algebra to a proper subalgebra.\nThe sum of sq
uares of multiplicities is equal to the dimension of\nthe commutant of all
complex matrices commuting with\nthe tensor square representation. Hence
\, our results offer a test\nif a subalgebra of a compact semisimple Lie a
lgebra is a proper one\nwhich uses only linear-algebra computations on set
s of generators\nwithout calculating the relevant Lie closures.\n\nIn the
second part of the talk\, we show how the previous test can be\nnaturally
applied in the field of controlled quantum systems.\nWe provide complete s
ymmetry criteria deciding whether some effective\ntarget interaction(s) ca
n be simulated by a set of given interactions.\nSeveral physical examples
are illustrated\, including entanglement invariants\,\nthe relation to uni
tary gate membership problems as well as the\ncentral spin model.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150422T153000
DTEND;TZID=America/New_York:20150422T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25827
SUMMARY:Applied Algebra and Network Theory Seminar - Causal Theories: A Cat
egorical Approach to Bayesian Networks
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: Cau
sal Theories: A Categorical Approach to Bayesian Networks\nSpeaker: Brenda
n Fong\, Oxford University\nAbstract: In this talk I will present a formal
graphical framework for causal reasoning\, based on a categorical interpr
etation of Bayesian networks. An instance of this framework\, termed a cau
sal theory\, is a symmetric monoidal category\, with the objects represent
ing variables and morphisms ways of deducing information about one variabl
e from another. A major advantage of reasoning with these structures is th
at the resulting graphical representations of morphisms match well with in
tuitions for flows of information between these variables. We will ground
the discussion in an application to Simpson's paradox.
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20150429T153000
DTEND;TZID=America/New_York:20150429T173000
LOCATION:MB315
URL:http://www.math.psu.edu/seminars/meeting.php?id=25828
SUMMARY:Applied Algebra and Network Theory Seminar - The shape space define
d by the Gromov-Wasserstein distance \\\\ NOTE: joint w/ Geometry Working
seminar in MB 114
DESCRIPTION:Seminar: Applied Algebra and Network Theory Seminar\nTitle: The
shape space defined by the Gromov-Wasserstein distance \\\\ NOTE: joint w
/ Geometry Working seminar in MB 114\nSpeaker: Facundo Memoli\, Ohio State
\, Mathematics and Computer Science\nAbstract: In a number of applications
\, datasets or shapes can be modeled as metric (measure) spaces. This repr
esentation permits carrying out the comparison of shapes\, for example\, i
n a manner that is somewhat insensitive to deformations. This is often des
ired in applications. A first idea is to try to apply the Gromov-Hausdorff
distance\, which in the case of finite spaces leads to combinatorial prob
lems. A natural idea is to try to relax the definition in order to obtain
something more continuous which is amenable to 'continuous' methods like g
radient descent that can locally improve a given solution (correspondence)
. Direct modifications yield definitions that lose the nice theoretical fr
amework surrounding the Gromov-Hausdorff distance. All this suggests consi
dering instead metric measure spaces as the model for datasets. The Gromov
-Wasserstein distance -- a 'continuous' avariant of the Gromov-Hausdorff d
istance based on ideas from mass transport -- provides an intrinsic metric
on the collection of all mm-spaces. I will review its construction\, main
properties\, lower bounds\, and computation.
END:VEVENT
END:VCALENDAR