works on

From the 1 of 668 papers with an AI index.

output
20022026
most citedQuantum ESPRESSO: a modular and open-source software project for quantum simulations of materials

29.3k citations

Showing 2015 · math.PRShow all

6 papers · 2 filters

math.PR2015★ 3 cited

Critical Multi-Type Galton-Watson Trees Conditioned to be Large

Romain Abraham, Jean-François Delmas, Hongsong Guo

Under minimal condition, we prove the local convergence of a critical multi-type Galton-Watson tree conditioned on having a large total progeny by types towards a multi-type Kesten…

math.PR2015

Local limits of galton-watson trees conditioned on the number of protected nodes

Romain Abraham, Aymen Bouaziz, Jean-François Delmas

We consider a marking procedure of the vertices of a tree where each vertex is marked independently from the others with a probability that depends only on its out-degree. We prove…

math.PR2015★ 3 cited

Stochastic particle approximation of the Keller-Segel equation and two-dimensional generalization of Bessel processes

Nicolas Fournier, Benjamin Jourdain

The Keller-Segel partial differential equation is a two-dimensional model for chemotaxis. When the total mass of the initial density is one, it is known to exhibit blow-up in finit…

math.PR2015★ 15 cited

An introduction to Galton-Watson trees and their local limits

Romain Abraham, Jean-François Delmas

The aim of this lecture is to give an overview of old and new resultson Bienaymé-Galton-Watson (BGW) trees. After introducing the framework of discretetrees, we first give alternat…

math.PR2015

Hypocoercivity in metastable settings and kinetic simulated annealing

Pierre Monmarché

Combining classical arguments for the analysis of the simulated annealing algorithm with the more recent hypocoercive method of distorted entropy, we prove the convergence for larg…

math.PR2015★ 4 cited

Central Limit Theorem for Adaptative Multilevel Splitting Estimators in an Idealized Setting

Charles-Edouard Bréhier, Ludovic Goudenège, Loic Tudela

The Adaptive Multilevel Splitting algorithm is a very powerful and versatile iterative method to estimate the probability of rare events, based on an interacting particle systems.…