<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//EN" "http://www.w3.org/2002/04/xhtml-math-svg/xhtml-math-svg.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
  <head>
    <meta http-equiv="Content-Type" content="application/xhtml+xml; charset=utf-8"/>
    <title>Project-Team:DYOGENE</title>
    <link rel="stylesheet" href="../static/css/raweb.css" type="text/css"/>
    <meta name="description" content="New Results - Information Theory: Boolean model in the Shannon Regime"/>
    <meta name="dc.title" content="New Results - Information Theory: Boolean model in the Shannon Regime"/>
    <meta name="dc.subject" content=""/>
    <meta name="dc.publisher" content="INRIA"/>
    <meta name="dc.date" content="(SCHEME=ISO8601) 2015-01"/>
    <meta name="dc.type" content="Report"/>
    <meta name="dc.language" content="(SCHEME=ISO639-1) en"/>
    <meta name="projet" content="DYOGENE"/>
    <!-- Piwik -->
    <script type="text/javascript" src="/rapportsactivite/piwik.js"></script>
    <noscript><p><img src="//piwik.inria.fr/piwik.php?idsite=49" style="border:0;" alt="" /></p></noscript>
    <!-- End Piwik Code -->
  </head>
  <body>
    <div class="tdmdiv">
      <div class="logo">
        <a href="http://www.inria.fr">
          <img style="align:bottom; border:none" src="../static/img/icons/logo_INRIA-coul.jpg" alt="Inria"/>
        </a>
      </div>
      <div class="TdmEntry">
        <div class="tdmentete">
          <a href="uid0.html">Project-Team Dyogene</a>
        </div>
        <span>
          <a href="uid1.html">Members</a>
        </span>
      </div>
      <div class="TdmEntry">
        <a href="./uid3.html">Overall Objectives</a>
      </div>
      <div class="TdmEntry">Research Program<ul><li><a href="uid5.html&#10;&#9;&#9;  ">Network Calculus</a></li><li><a href="uid6.html&#10;&#9;&#9;  ">Perfect Simulation</a></li><li><a href="uid8.html&#10;&#9;&#9;  ">Stochastic Geometry</a></li><li><a href="uid9.html&#10;&#9;&#9;  ">Information Theory</a></li><li><a href="uid10.html&#10;&#9;&#9;  ">The Cavity Method for Network Algorithms</a></li><li><a href="uid11.html&#10;&#9;&#9;  ">Statistical Learning</a></li></ul></div>
      <div class="TdmEntry">Application Domains<ul><li><a href="uid13.html&#10;&#9;&#9;  ">Wireless Networks</a></li><li><a href="uid14.html&#10;&#9;&#9;  ">Embedded Networks</a></li><li><a href="uid15.html&#10;&#9;&#9;  ">Distributed Content Delivery Networks</a></li><li><a href="uid16.html&#10;&#9;&#9;  ">Probabilistic Algorithms for Renewable Integration in Smart grid</a></li><li><a href="uid18.html&#10;&#9;&#9;  ">Algorithms for finding communities</a></li></ul></div>
      <div class="TdmEntry">
        <a href="./uid20.html">Highlights of the Year</a>
      </div>
      <div class="TdmEntry">New Software and Platforms<ul><li><a href="uid23.html&#10;&#9;&#9;  ">CloNES</a></li></ul></div>
      <div class="TdmEntry">New Results<ul><li><a href="uid28.html&#10;&#9;&#9;  ">Evaluation and optimization of the quality of service perceived by mobile users for new services in cellular networks</a></li><li><a href="uid29.html&#10;&#9;&#9;  ">Interference and SINR coverage in spatial non-slotted Aloha networks</a></li><li><a href="uid30.html&#10;&#9;&#9;  ">Random linear multihop relaying in a general field of interferers using spatial Aloha</a></li><li><a href="uid31.html&#10;&#9;&#9;  ">Studying the SINR process of the typical user in Poisson networks by using its factorial moment measures</a></li><li><a href="uid32.html&#10;&#9;&#9;  ">Performance laws of large heterogeneous cellular networks</a></li><li><a href="uid33.html&#10;&#9;&#9;  ">Wireless networks appear Poissonian due to strong shadowing</a></li><li><a href="uid34.html&#10;&#9;&#9;  ">What frequency bandwidth to run cellular network in a given country? - a downlink dimensioning problem</a></li><li><a href="uid35.html&#10;&#9;&#9;  ">Optimal Geographic Caching In Cellular Networks</a></li><li><a href="uid36.html&#10;&#9;&#9;  ">Spatial distribution of the SINR in Poisson cellular networks with sector antennas</a></li><li><a href="uid37.html&#10;&#9;&#9;  ">Theoretical expression of link performance in OFDM cellular networks with MIMO compared to simulation and measurements</a></li><li class="tdmActPage"><a href="uid38.html&#10;&#9;&#9;  ">Information Theory: Boolean model in the Shannon Regime</a></li><li><a href="uid39.html&#10;&#9;&#9;  ">Stochastic Geometry: Wireless Modeling</a></li><li><a href="uid40.html&#10;&#9;&#9;  ">Information Theory: SIMO</a></li><li><a href="uid41.html&#10;&#9;&#9;  ">Theory of point processes</a></li><li><a href="uid44.html&#10;&#9;&#9;  ">Cross-Technology Interference Mitigation in Body Area Networks: An Optimization Approach</a></li><li><a href="uid45.html&#10;&#9;&#9;  ">Body-to-Body Area Networks</a></li><li><a href="uid46.html&#10;&#9;&#9;  ">Exact Worst-Case Delay in FIFO-Multiplexing Feed-Forward Networks</a></li><li><a href="uid47.html&#10;&#9;&#9;  ">Fast symbolic computation of the worst-case delay in tandem networks and applications</a></li><li><a href="uid48.html&#10;&#9;&#9;  ">Ancillary Service to the Grid Using Intelligent Deferrable Loads</a></li><li><a href="uid49.html&#10;&#9;&#9;  ">Spectral Decomposition of Demand-Side Flexibility for Reliable Ancillary Services in a Smart Grid</a></li><li><a href="uid50.html&#10;&#9;&#9;  ">State Estimation for the Individual and the Population in Mean Field Control with Application to Demand Dispatch</a></li><li><a href="uid51.html&#10;&#9;&#9;  ">Perfect sampling of Jackson queueing networks</a></li><li><a href="uid52.html&#10;&#9;&#9;  ">Speeding up Glauber Dynamics for Random Generation of Independent Sets </a></li><li><a href="uid53.html&#10;&#9;&#9;  ">Approximate optimality with bounded regret in dynamic matching models </a></li><li><a href="uid54.html&#10;&#9;&#9;  ">Perfect sampling for multiclass closed queueing networks</a></li><li><a href="uid55.html&#10;&#9;&#9;  ">Fast and Memory Optimal Low-Rank Matrix Approximation</a></li><li><a href="uid56.html&#10;&#9;&#9;  ">Combinatorial Bandits Revisited</a></li><li><a href="uid57.html&#10;&#9;&#9;  ">Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs</a></li><li><a href="uid58.html&#10;&#9;&#9;  ">Designing Adaptive Replication Schemes in Distributed Content Delivery Networks</a></li><li><a href="uid59.html&#10;&#9;&#9;  ">Spectral Detection in the Censored Block Model</a></li><li><a href="uid60.html&#10;&#9;&#9;  ">A spectral method for community detection in moderately-sparse degree-corrected stochastic block models</a></li><li><a href="uid61.html&#10;&#9;&#9;  ">An Impossibility Result for Reconstruction in a Degree-Corrected Planted-Partition Model</a></li><li><a href="uid62.html&#10;&#9;&#9;  ">Universality in polytope phase transitions and message passing algorithms</a></li><li><a href="uid63.html&#10;&#9;&#9;  ">Contagions in Random Networks with Overlapping Communities</a></li><li><a href="uid64.html&#10;&#9;&#9;  ">The Diameter of Weighted Random Graphs.</a></li></ul></div>
      <div class="TdmEntry">Bilateral Contracts and Grants with Industry<ul><li><a href="uid66.html&#10;&#9;&#9;  ">CRE with Orange</a></li><li><a href="uid67.html&#10;&#9;&#9;  ">MSR-Inria Joint Lab</a></li></ul></div>
      <div class="TdmEntry">Partnerships and Cooperations<ul><li><a href="uid71.html&#10;&#9;&#9;  ">National Initiatives</a></li><li><a href="uid78.html&#10;&#9;&#9;  ">International Initiatives</a></li><li><a href="uid87.html&#10;&#9;&#9;  ">International Research Visitors</a></li></ul></div>
      <div class="TdmEntry">Dissemination<ul><li><a href="uid99.html&#10;&#9;&#9;  ">Promoting Scientific Activities</a></li><li><a href="uid119.html&#10;&#9;&#9;  ">Teaching - Supervision - Juries</a></li></ul></div>
      <div class="TdmEntry">
        <div>Bibliography</div>
      </div>
      <div class="TdmEntry">
        <ul>
          <li>
            <a id="tdmbibentyear" href="bibliography.html">Publications of the year</a>
          </li>
          <li>
            <a id="tdmbibentfoot" href="bibliography.html#References">References in notes</a>
          </li>
        </ul>
      </div>
    </div>
    <div id="main">
      <div class="mainentete">
        <div id="head_agauche">
          <small><a href="http://www.inria.fr">
	    
	    Inria
	  </a> | <a href="../index.html">
	    
	    Raweb 
	    2015</a> | <a href="http://www.inria.fr/en/teams/dyogene">Presentation of the Project-Team DYOGENE</a> | <a href="http://www.di.ens.fr/dyogene/">DYOGENE Web Site
	  </a></small>
        </div>
        <div id="head_adroite">
          <table class="qrcode">
            <tr>
              <td>
                <a href="dyogene.xml">
                  <img style="align:bottom; border:none" alt="XML" src="../static/img/icons/xml_motif.png"/>
                </a>
              </td>
              <td>
                <a href="dyogene.pdf">
                  <img style="align:bottom; border:none" alt="PDF" src="IMG/qrcode-dyogene-pdf.png"/>
                </a>
              </td>
              <td>
                <a href="../dyogene/dyogene.epub">
                  <img style="align:bottom; border:none" alt="e-pub" src="IMG/qrcode-dyogene-epub.png"/>
                </a>
              </td>
            </tr>
            <tr>
              <td/>
              <td>PDF
</td>
              <td>e-Pub
</td>
            </tr>
          </table>
        </div>
      </div>
      <!--FIN du corps du module-->
      <br/>
      <div class="bottomNavigation">
        <div class="tail_aucentre">
          <a href="./uid37.html" accesskey="P"><img style="align:bottom; border:none" alt="previous" src="../static/img/icons/previous_motif.jpg"/> Previous | </a>
          <a href="./uid0.html" accesskey="U"><img style="align:bottom; border:none" alt="up" src="../static/img/icons/up_motif.jpg"/>  Home</a>
          <a href="./uid39.html" accesskey="N"> | Next <img style="align:bottom; border:none" alt="next" src="../static/img/icons/next_motif.jpg"/></a>
        </div>
        <br/>
      </div>
      <div id="textepage">
        <!--DEBUT2 du corps du module-->
        <h2>Section: 
      New Results</h2>
        <h3 class="titre3">Information Theory: Boolean model in the Shannon Regime</h3>
        <p>In a paper accepted for publication in the Journal of Applied Probability,
F. Baccelli and V. Anantharam consider
a family of Boolean models, indexed by integers <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>n</mi><mo>≥</mo><mn>1</mn></mrow></math></span>.
The <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>n</mi></math></span>-th model features a Poisson point process in <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mi>ℝ</mi><mi>n</mi></msup></math></span>
of intensity <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mi>e</mi><mrow><mi>n</mi><msub><mi>ρ</mi><mi>n</mi></msub></mrow></msup></math></span>
and balls of independent and identically distributed
radii distributed like <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><msub><mover accent="true"><mi>X</mi><mo>¯</mo></mover><mi>n</mi></msub><msqrt><mi>n</mi></msqrt></mrow></math></span>. Assume that
<span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><msub><mi>ρ</mi><mi>n</mi></msub><mo>→</mo><mi>ρ</mi></mrow></math></span> as <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>n</mi><mo>→</mo><mi>∞</mi></mrow></math></span>, and
that <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mover accent="true"><mi>X</mi><mo>¯</mo></mover><mi>n</mi></msub></math></span> satisfies a large deviations principle.
It is shown that there then exist three deterministic thresholds:
<span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>τ</mi><mi>d</mi></msub></math></span> the degree threshold; <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>τ</mi><mi>p</mi></msub></math></span> the percolation probability threshold;
and <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>τ</mi><mi>v</mi></msub></math></span> the volume fraction threshold, such that
asymptotically as <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>n</mi></math></span> tends to infinity,
we have the following features.
(i) For <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>ρ</mi><mo>&lt;</mo><msub><mi>τ</mi><mi>d</mi></msub></mrow></math></span>, almost every point is isolated, namely its ball
intersects no other ball;
(ii) for <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><msub><mi>τ</mi><mi>d</mi></msub><mo>&lt;</mo><mi>ρ</mi><mo>&lt;</mo><msub><mi>τ</mi><mi>p</mi></msub></mrow></math></span>,
the mean number of balls intersected by a typical ball
converges to infinity and
nevertheless there is no percolation;
(iii) for <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><msub><mi>τ</mi><mi>p</mi></msub><mo>&lt;</mo><mi>ρ</mi><mo>&lt;</mo><msub><mi>τ</mi><mi>v</mi></msub></mrow></math></span>,
the volume fraction is 0 and nevertheless percolation occurs;
(iv) for <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><msub><mi>τ</mi><mi>d</mi></msub><mo>&lt;</mo><mi>ρ</mi><mo>&lt;</mo><msub><mi>τ</mi><mi>v</mi></msub></mrow></math></span>,
the mean number of balls intersected by a typical ball
converges to infinity and
nevertheless the volume fraction is 0;
(v) for <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>ρ</mi><mo>&gt;</mo><msub><mi>τ</mi><mi>v</mi></msub></mrow></math></span>, the whole space covered.
The analysis of this asymptotic regime is motivated
by problems in information theory, but
it could be of independent interest in
stochastic geometry.
The relations between these three thresholds and
the Shannon–Poltyrev threshold are discussed.
</p>
      </div>
      <!--FIN du corps du module-->
      <br/>
      <div class="bottomNavigation">
        <div class="tail_aucentre">
          <a href="./uid37.html" accesskey="P"><img style="align:bottom; border:none" alt="previous" src="../static/img/icons/previous_motif.jpg"/> Previous | </a>
          <a href="./uid0.html" accesskey="U"><img style="align:bottom; border:none" alt="up" src="../static/img/icons/up_motif.jpg"/>  Home</a>
          <a href="./uid39.html" accesskey="N"> | Next <img style="align:bottom; border:none" alt="next" src="../static/img/icons/next_motif.jpg"/></a>
        </div>
        <br/>
      </div>
    </div>
  </body>
</html>
