<?xml version="1.0" encoding="UTF-8" ?>
	<rss version="2.0">
		<channel><title>RIT on Analysis of Complex Networks</title><link>http://www-math.umd.edu/research/seminars.html</link><description></description><item>
	<title>Organizational meeting</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Fri, 09 Sep 2016 14:00:00 EDT</pubDate>
	<description><![CDATA[When: Fri, September 9, 2016 - 2:00pm<br />Where: Kirwan Hall 1311<br />Speaker: Maria Cameron and Kasso Okoudjou (UMCP) - http://www.math.umd.edu/~mariakc/rit-analysis-of-complex.html<br />
<br />]]></description>
</item>

<item>
	<title>Modeling Aggregation Processes of Interacting Particles by means of Stochastic Networks</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Fri, 23 Sep 2016 14:00:00 EDT</pubDate>
	<description><![CDATA[When: Fri, September 23, 2016 - 2:00pm<br />Where: Kirwan Hall 1311<br />Speaker: Maria Cameron (UMCP, Math) - http://www.math.umd.edu/~mariakc/<br />
Abstract: I will discuss the construction and analysis of continuous-time discrete-space Markov chains (stochastic networks) modeling the aggregation of interacting particles into clusters.<br />
I will consider two types of particle interaction: via the Lennard-Jones potential which is an adequate model for cooled rare gas atoms, and via a short-range or sticky potential which is an adequate model for micron size styrofoam balls immersed in the water. I will provide physical motivations for considering these problems, explain difficulties arising in the building of the networks, and outline challenges in their analysis and perspectives.<br />]]></description>
</item>

<item>
	<title>Mutation analysis of a budding yeast regulatory network</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Fri, 07 Oct 2016 14:00:00 EDT</pubDate>
	<description><![CDATA[When: Fri, October 7, 2016 - 2:00pm<br />Where: Kirwan Hall 1311<br />Speaker: Maria Cameron (UMCP Math) - http://www.math.umd.edu/~mariakc/rit-analysis-of-complex.html<br />
Abstract: It will be an introductory talk explaining what are regulatory networks and why they are appealing modeling tools. I will discuss the modeling of a budding yeast cell cycle by means of a regulatory network. The dynamics of the resulting network is consistent with the cell cycle. Then I will establish which edges in the regulatory network are redundant and which are essential by removing one edge in a time and checking whether the resulting network still follows the cell cycle.<br />
<br />]]></description>
</item>

<item>
	<title>Diffusion Wavelets</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Fri, 11 Nov 2016 14:00:00 EST</pubDate>
	<description><![CDATA[When: Fri, November 11, 2016 - 2:00pm<br />Where: Kirwan Hall 1311<br />Speaker: Kasso Okoudjou (UMCP,  Mathematics) - https://www.math.umd.edu/~okoudjou/<br />
<br />]]></description>
</item>

<item>
	<title>Graph Sparsification</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Fri, 18 Nov 2016 14:00:00 EST</pubDate>
	<description><![CDATA[When: Fri, November 18, 2016 - 2:00pm<br />Where: Kirwan Hall 1311<br />Speaker: Kasso Okoudjou (UMCP, Mathematics) - https://www.math.umd.edu/~okoudjou/<br />
<br />]]></description>
</item>

<item>
	<title> Hyperbolicity and Congestion</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Fri, 02 Dec 2016 14:00:00 EST</pubDate>
	<description><![CDATA[When: Fri, December 2, 2016 - 2:00pm<br />Where: Kirwan Hall 1311<br />Speaker: Matt Yancey () - <br />
Abstract: Based on recent results characterizing the curvature of several real-world networks, there have been recent attempts at determining what, if anything, the curvature implies.  In this talk, the version of curvature that we will investigate is Gromov&#039;s relaxation of Buneman&#039;s 4-point condition to define when a group is hyperbolic.  The proposed consequence of hyperbolicity we investigate is congestion: that there exists a node $u$ and fixed $\epsilon &gt; 0$ such that for randomly uniformly selected endpoints $v,w$, the geodesic from $v$ to $w$ contains $u$ has probability at least $\epsilon$.<br />
<br />
There exist trivial/degenerate examples of non-congested hyperbolic networks.  We will present a series of results demonstrating that hyperbolicity combined with other natural conditions imply congestion.<br />
<br />]]></description>
</item>

<item>
	<title>Graph Sparsification </title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Fri, 09 Dec 2016 13:00:00 EST</pubDate>
	<description><![CDATA[When: Fri, December 9, 2016 - 1:00pm<br />Where: Kirwan Hall 1311<br />Speaker: Kasso Okoudjou (UMCP Math) - https://www.math.umd.edu/~kasso<br />
<br />]]></description>
</item>


	</channel>
</rss>