Displaying similar documents to “Random directed trees and forest -- drainage networks with dependence.”

Maximal buttonings of trees

Ian Short (2014)

Discussiones Mathematicae Graph Theory

Similarity:

A buttoning of a tree that has vertices v1, v2, . . . , vn is a closed walk that starts at v1 and travels along the shortest path in the tree to v2, and then along the shortest path to v3, and so forth, finishing with the shortest path from vn to v1. Inspired by a problem about buttoning a shirt inefficiently, we determine the maximum length of buttonings of trees

Numerical simulation of a point-source initiated flame ball with heat losses

Jacques Audounet, Jean-Michel Roquejoffre, Hélène Rouzaud (2002)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

This article is devoted to the numerical study of a flame ball model, derived by Joulin, which obeys to a singular integro-differential equation. The numerical scheme that we analyze here, is based upon a one step method, and we are interested in its long-time behaviour. We recover the same dynamics as in the continuous case: quenching, or stabilization of the flame, depending on heat losses, and an energy input parameter.