Related papers: Extended Void Merging Tree Algorithm for Self-Simi…
Model merging aims to combine multiple task-specific expert models into a single model without joint retraining, offering a practical alternative to multi-task learning when data access or computational budget is limited. Existing methods,…
Evolving trees arise in many real-life scenarios from computer file systems and dynamic call graphs, to fake news propagation and disease spread. Most layout algorithms for static trees do not work well in an evolving setting (e.g., they…
Natural evolution gives the impression of leading to an open-ended process of increasing diversity and complexity. If our goal is to produce such open-endedness artificially, this suggests an approach driven by evolutionary metaphor. On the…
This paper presents a novel formula for the transition density of the Brownian motion on a sphere of any dimension and discusses an algorithm for the simulation of the increments of the spherical Brownian motion based on this formula. The…
It is shown in this work how the Wang-Landau algorithm can be parallelized through the concept of the micromagnetic ensemble, when the Hamiltonian contains both spin interaction and the external field terms, and thus energy-magnetization…
There is a close connection between intersections of Brownian motion paths and percolation on trees. Recently, ideas from probability on trees were an important component of the multifractal analysis of Brownian occupation measure, in joint…
We consider a ranking and selection (R&S) problem with the goal to select a system with the largest or smallest expected performance measure among a number of simulated systems with a pre-specified probability of correct selection. Fully…
The time process of transport on randomly evolving trees is investigated. By introducing the notions of living and dead nodes a model of random tree evolution is constructed which describes the spreading in time of objects corresponding to…
Billera-Holmes-Vogtmann (BHV) tree space is a geodesic metric space of edge-weighted phylogenetic trees with a fixed leaf set. Constructing parametric distributions on this space is challenging due to its non-Euclidean geometry and the…
We present a comprehensive computational study of the collective behavior emerging from the competition between self-propulsion, excluded volume interactions and velocity-alignment in a two-dimensionnal model of active particles. We…
In this paper, we explore the reduction of functionality in a complex system as a consequence of cumulative random damage and imperfect reparation, a phenomenon modeled as a dynamical process on networks. We analyze the global…
We detail the application of bounding volume hierarchies to accelerate second-virial evaluations for arbitrary complex particles interacting through hard and soft finite-range potentials. This procedure, based on the construction of…
Patches of vegetation consist of dense clusters of shrubs, grass, or trees, often found to be circular characteristic size, defined by the properties of the vegetation and terrain. Therefore, vegetation patches can be interpreted as…
We introduce an intuitive model that describes both the emergence of community structure and the evolution of the internal structure of communities in growing social networks. The model comprises two complementary mechanisms: One mechanism…
Consider $n+m$ nonintersecting Brownian bridges, with $n$ of them leaving from 0 at time $t=-1$ and returning to 0 at time $t=1$, while the $m$ remaining ones (wanderers) go from $m$ points $a_i$ to $m$ points $b_i$. First, we keep $m$…
We obtain the Brownian net of Sun and Swart (2008) as the scaling limit of the paths traced out by a system of continuous (one-dimensional) space and time branching and coalescing random walks. This demonstrates a certain universality of…
The symmetric exclusion process and the voter model are two interacting particle systems for which a dual finite particle system allows one to characterize its invariant measures. Adding spontaneous births and deaths to the two processes…
Many simulated complex systems that support persistent self-organizing patterns, i.e. gliders, have a 'state-plus-update' paradigm. This approach can be found in computational models of physics, continuous and neural cellular automata,…
Real networks often grow through the sequential addition of new nodes that connect to older ones in the graph. However, many real systems evolve through the branching of fundamental units, whether those be scientific fields, countries, or…
Mechanistic models can provide an intuitive and interpretable explanation of network growth by specifying a set of generative rules. These rules can be defined by domain knowledge about real-world mechanisms governing network growth or may…