Related papers: Scaling properties of a random Yule tree embedded …
We investigate the evolution of infinite strings as a part of a complete cosmic string network in flat space. We perform a simulation of the network which uses functional forms for the string position and thus is exact to the limits of…
To each sequence $(a_n)$ of positive real numbers we associate a growing sequence $(T_n)$ of continuous trees built recursively by gluing at step $n$ a segment of length $a_n$ on a uniform point of the pre-existing tree, starting from a…
Yule's 1925 paper introducing the branching model that bears his name was a landmark contribution to the biodiversity sciences. In his paper, Yule developed stochastic models to explain the observed distribution of species across genera and…
We consider a uniform spanning tree in a $\delta$-square grid approximation of a planar domain $\Omega$. For given integer $n\ge 2$, we condition the tree on the following $n$-arm event: we pick $n$ branches, emanating from $n$ points…
Language models famously improve under a smooth scaling law, but some specific capabilities exhibit sudden breakthroughs in performance. Advocates of "emergence" view these capabilities as unlocked at a specific scale, but others attribute…
We study a model of a population with individuals sampled from different species. The Yule-$\Lambda$ nested coalescent describes the genealogy of the sample when each species merges with another randomly chosen species with a constant rate…
A set of general allometric scaling laws is derived for different systems represented by tree networks. The formulation postulates self-similar networks with an arbitrary number of branches developed in each generation, and with an…
Scale transformations have played an extremely successful role in studies of cosmological large-scale structure by relating the non-linear spectrum of cosmological density fluctuations to the linear primordial power at longer wavelengths.…
An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the tree is extended by either a single edge with probability $p$…
We find that a wide class of developing and decaying networks has scaling properties similar to those that were recently observed by Barab\'{a}si and Albert in the particular case of growing networks. The networks considered here evolve…
We introduce a simple geometric model which describes the kinetics of fragmentation of d-dimensional objects. In one dimension our model coincides with the random scission model and show a simple scaling behavior in the long-time limit. For…
Graph tries are a new and interesting data structure proposed by Jacquet in 2014. They generalize the classical trie data structure which has found many applications in computer science and is one of the most popular data structure on…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
Latent tree models are graphical models defined on trees, in which only a subset of variables is observed. They were first discussed by Judea Pearl as tree-decomposable distributions to generalise star-decomposable distributions such as the…
We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…
This Master's thesis examines the properties of large degree vertices in random recursive directed acyclic graphs (RRDAGs), a generalization of the well-studied random recursive tree (RRT) model. Using a novel adaptation of Kingman's…
We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree…
We consider the task of learning Ising models when the signs of different random variables are flipped independently with possibly unequal, unknown probabilities. In this paper, we focus on the problem of robust estimation of…
The Random Projection Tree structures proposed in [Freund-Dasgupta STOC08] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of data. We prove new results for both the RPTreeMax…
Universal scaling of distances between vertices of Erdos-Renyi random graphs, scale-free Barabasi-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks are observed. A…