Related papers: A model for random braiding in graph configuration…

We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…

We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to the local time of a standard Brownian excursion. Furthermore…

We investigate a discrete model consisting of self-propelled particles that obey simple interaction rules. We show that this model can self-organize and exhibit coherent localized solutions in one- and in two-dimensions.In one-dimension,…

It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…

Node betweenness has been studied recently by a number of authors, but until now less attention has been paid to edge betweenness. In this paper, we present an exact analytic study of edge betweenness in evolving scale-free and…

The goal of these lectures is to review some mathematical aspects of random tree models used in evolutionary biology to model gene trees or species trees. We start with stochastic models of tree shapes (finite trees without edge lengths),…

Bounded infinite graphs are defined on the basis of natural physical requirements. When specialized to trees this definition leads to a natural conjecture that the average connectivity dimension of bounded trees cannot exceed two. We verify…

We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…

We show uniqueness of the spine of a Fleming-Viot particle system under minimal assumptions on the driving process. If the driving process is a continuous time Markov process on a finite space, we show that asymptotically, when the number…

The richness of the mean-field solution of simple glasses leaves many of its features challenging to interpret. A minimal model that illuminates glass physics the same way the random energy model clarifies spin glass behavior would…

We study an equilibrium statistical mechanical model of tree graphs which are made up of a linear subgraph (the spine) to which leaves are attached. We prove that the model has two phases, a generic phase where the spine becomes infinitely…

We consider the model of branching Brownian motion with a single catalytic point at the origin and binary branching. We establish some fine results for the asymptotic behaviour of the numbers of particles travelling at different speeds and…

This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a…

A random flight on a plane with non-isotropic displacements at the moments of direction changes is considered. In the case of exponentially distributed flight lengths a Gaussian limit theorem is proved for the position of a particle in the…

We present exact results for the critical behavior of the RFIM on complete graphs and trees, both at equilibrium and away from equilibrium, i.e., models for hysteresis and Barkhausen noise. We show that for stretched exponential and power…

In this paper, we study exponential random graph models subject to certain constraints. We obtain some general results about the asymptotic structure of the model. We show that there exists non-trivial regions in the phase plane where the…

We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…

We derive the asymptotic winding law of a Brownian particle in the plane subjected to a tangential drift due to a point vortex. For winding around a point, the normalized winding angle converges to an inverse Gamma distribution. For winding…

Using the ordered analogue of Farley-Sabalka's discrete gradient field on the configuration space of a graph, we unravel a levelwise behavior of the generators of the pure braid group on a tree. This allows us to generalize Farber's…

In this paper we show that all infinite trees which have bounded coordination and whose surface is negligible with respect to the volume in the limit of large distances (so that they can be embedded in a finite-dimensional euclidean space)…