<node id="250021">
  <nid>250021</nid>
  <type>event</type>
  <uid>
    <user id="27263"><![CDATA[27263]]></user>
  </uid>
  <created>1383213872</created>
  <changed>1475892330</changed>
  <title><![CDATA[ARC Colloquium: Francois Baccelli, The University of Texas at Austin]]></title>
  <body><![CDATA[<p><strong>Title:</strong> Geometric Routing in Stochastic Networks, Point-Shift and Palm Probabilities of a Point Process</p><p><strong>Abstract: </strong>Consider a point process in the Euclidean space and a rule defining the edges that exist between its points. This defines a random graph on the point process. A routing algorithm constructs, for all pairs of points, a route between these points, namely a path of this graph connecting them, when possible. Such an algorithm can be global, like in shortest path routing, or local, like in geographic or geometric routing.</p><p>This talk will discuss properties of routes which are locally defined on a stationary point process, using the notion of point-shift.</p><p>&nbsp;A point-shift maps, in a translation invariant way, each point of a stationary point process Z to some point of Z. The existence of stationary regimes of a routing algorithm is then equivalent to that of probability measures, defined on the space of counting measures with an atom at the origin, which are left invariant by the point-shift f describing the local algorithm. The point-shift probabilities of Z are defined from the action of the semigroup of point-shift translations on the space of Palm probabilities, and more precisely from the compactification of the orbits of this semigroup action. If the point-shift probability is uniquely defined, and if f is continuous with respect to the vague topology, then the point-shift probability of Z provides a solution to the stationary regime question.</p><p>&nbsp;Point-shift probabilities are shown to be a strict generalization of Palm probabilities: when the considered point-shift f is bijective, the point-shift-probability of Z boils down to the Palm probability of Z. When it is not bijective, there exist cases where the point-shift-probability of Z is the law of Z under the Palm probability of some stationary thinning Y of Z. But there also exist cases where the point-shift-probability of Z is singular w.r.t. the Palm probability of Z and where, in addition, it cannot be the law of Z under the Palm probability of any stationary point process Y jointly stationary with Z. The talk will give a criterion for the existence of point-shift probabilities of a stationary point process and will discuss uniqueness. The results will be illustrated through several examples.</p><p>Joint work with Mir-Omid Haji-Mirsadeghi, Sharif University, Department of Mathematics.</p>]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2013-11-08T15:00:00-05:00]]></value>
      <value2><![CDATA[2013-11-08T15:00:00-05:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[<p><a href="mailto:ndongi@cc.gatech.edu">ndongi@cc.gatech.edu</a></p><p>&nbsp;</p>]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>70263</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[ARC]]></item>
      </og_groups_both>
  <field_categories>
      </field_categories>
  <field_keywords>
      </field_keywords>
  <userdata><![CDATA[]]></userdata>
</node>
