Concept

Processus de branchement

Publications associées (13)

Wind, Hail, and Climate Extremes: Modelling and Attribution Studies for Environmental Data

This thesis presents work at the junction of statistics and climate science. We first provide methodology for use by climate scientists when performing fast event attribution using extreme value theory, and then describe two interdisciplinary projects in c ...

EPFL2023

Intrinsic area near the origin for self-similar growth-fragmentations and related random surfaces

We study the behaviour of a natural measure defined on the leaves of the genealogical tree of some branching processes, namely self-similar growth-fragmentation processes. Each particle, or cell, is attributed a positive mass that evolves in continuous tim ...

2022

Critical values in an anisotropic percolation on $\mathbb{Z}^2$

Hao Xue

In this thesis, we consider an anisotropic finite-range bond percolation model on

\mathbb{Z}^2

. On each horizontal layer

\{(x,i):x\in\mathbb{Z}\}

for

i\in\mathbb{Z}

, we have edges

\langle(x,i),(y,i)\rangle

for

1\leq|x-y|\leq N

with $N\in\mathbb{N ...

EPFL2021

Exceptional graphs for the random walk

Juhan Aru

If W is the simple random walk on the square lattice Z(2), then W induces a random walk W-G on any spanning subgraph G subset of Z(2) of the lattice as follows: viewing W as a uniformly random infinite word on the alphabet {x, -x, y, -y}, the walk W-G star ...

INST MATHEMATICAL STATISTICS2020

Critical scaling for an anisotropic percolation system on Z(2)

Thomas Mountford, Hao Xue

In this article, we consider an anisotropic finite-range bond percolation model on Z(2). On each horizontal layer {(x, i): x is an element of Z} we have edges for 1

UNIV WASHINGTON, DEPT MATHEMATICS2020

Lyapunov Exponents for Branching Processes in a Random Environment: The Effect of Information

Sophie Myriam Hautphenne

We consider multitype branching processes evolving in a Markovian random environment. To determine whether or not the branching process becomes extinct almost surely is akin to computing the maximal Lyapunov exponent of a sequence of random matrices, which ...

Springer Verlag2016

Amplitude And Phase Variation Of Point Processes

Victor Panaretos, Yoav Zemel

We develop a canonical framework for the study of the problem of registration of multiple point processes subjected to warping, known as the problem of separation of amplitude and phase variation. The amplitude variation of a real random function {Y(x) : x ...

Institute of Mathematical Statistics2016

Exponential extinction time of the contact process on finite graphs

Thomas Mountford, Daniel Rodrigues Valesin, Jean-Christophe Mourrat

We study the extinction time tau of the contact process started with full occupancy on finite trees of bounded degree. We show that, if the infection rate is larger than the critical rate for the contact process on Z, then, uniformly over all trees of degr ...

Elsevier Science Bv2016

Approximate solution of the probability density function of bedload transport rate over multiple time scales.

Christophe Ancey, Joris Heyman, François Mettra, Hongbo Ma

Bedload transport rate in mountain rivers is highly fluctuating and has strong stochastic behavior even under steady flow conditions. Its stochastic description thus offers deeper insights into its dynamics than the deterministic one. As a random quantity, ...

2013

DNA delivery with hyperbranched polylysine: A comparative study with linear and dendritic polylysine

Harm-Anton Klok, Florian Maria Wurm, David Hacker, Lucia Baldi Unser, Yashas Rajendra, Zuzana Kadlecova

PEI and polylysine are among the most investigated synthetic polymeric carriers for DNA delivery. Apart from their practical use, these 2 classes of polymers are also of interest from a fundamental point of view as they both can be prepared in different ar ...

Elsevier2013

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.

Connectez-vous pour utiliser Chat avec Graph Search