Exponential extinction time of the contact process on finite graphs
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Background. Isolated lung perfusion (ILP) with free and a novel liposomal-encapsulated doxorubicin (Liporubicin, CT Sciences SA, Lausanne, Switzerland) was compared with respect to drug uptake and distribution in rat lungs bearing a sarcomatous tumor. ...
Steinhaus graphs on n vertices are certain simple graphs in bijective correspondence with binary {0,1}-sequences of length n-1. A conjecture of Dymacek in 1979 states that the only nontrivial regular Steinhaus graphs are those corresponding to the periodic ...
We calculate learning rates when agents are informed through public and private observation of other agents' actions. We characterize the evolution of the distribution of posterior beliefs. If the private learning channel is present, convergence of the dis ...
We analyze the class of networks characterized by modular structure where a sequence of l Erdos-Renyi random networks of size N >> 1 with random average degrees is joined by links whose structure must remain immaterial. We find that traceroutes spanning th ...
We address the problem of recognizing the visual focus of attention (VFOA) of meeting participants from their head pose and contextual cues. The main contribution of the paper is the use of a head pose posterior distribution as a representation of the head ...
The graph coloring problem is one of the most famous problems in graph theory and has a large range of applications. It consists in coloring the vertices of an undirected graph with a given number of colors such that two adjacent vertices get different col ...
We present experimental results on the velocity statistics of a granular fluid with an effective stochastic thermostat, in a quasi-two-dimensional configuration. We find the base state, as measured by the single particle velocity distribution P(c) in the c ...
The distribution and morphology of CH particles in various cementitious systems was investigated to determine which parameters influence their nucleation and growth. Morphological image analysis of SEM-BSE images of polished cross-sections was used to meas ...
We address the problem of recognizing the visual focus of attention (VFOA) of meeting participants from their head pose and contextual cues. The main contribution of the paper is the use of a head pose posterior distribution as a representation of the head ...
We analyze the distribution of the distances between tributaries of a given size (or of sizes larger than a given area) draining along either an open boundary or the mainstream of a river network. By proposing a description of the distance separating presc ...
