Related papers: Extended Void Merging Tree Algorithm for Self-Simi…
We study a generalized geometric Brownian motion framework that incorporates both entries of new units and exit mechanisms for the current population, extending earlier stochastic resetting models where these rates are treated as identical.…
The newly developed "void expansion method" allows for an efficient generation of porous packings of spherical particles over a wide range of volume fractions using the discrete element method. Particles are randomly placed under addition…
The conceptual landscape of convection has two simple gateways: optimal function and random form. Optimal convection adjusts toward a univariate ideal called neutrality. Convection form involves elements (parcels, bubbles, drafts) whose…
We introduce the Pitman Yor Diffusion Tree (PYDT) for hierarchical clustering, a generalization of the Dirichlet Diffusion Tree (Neal, 2001) which removes the restriction to binary branching structure. The generative process is described…
Self-burrowing robots navigating through granular media benefit from airflow-assisted burrowing, which reduces penetration resistance. However, the mechanisms underlying airflow-granular interactions remain poorly understood. To address…
Neural Networks and Decision Trees: two popular techniques for supervised learning that are seemingly disconnected in their formulation and optimization method, have recently been combined in a single construct. The connection pivots on…
Microstructural evolution in structural materials is known to occur in response to mechanical loading and can often accommodate substantial plastic deformation through the coupled motion of grain boundaries (GBs). This can produce desirable…
We introduce a continuous-time random walk model on an infinite multilayer structure inspired by transportation networks. Each layer is a copy of $\mathbb{R}^d$, indexed by a non-negative integer. A walker moves within a layer by means of…
Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…
Circular Dyson Brownian motion describes the Brownian dynamics of particles on a circle (periodic boundary conditions), interacting through a logarithmic, long-range two-body potential. Within the log-gas picture of random matrix theory, it…
Deep model fusion/merging is an emerging technique that merges the parameters or predictions of multiple deep learning models into a single one. It combines the abilities of different models to make up for the biases and errors of a single…
Merger trees follow the growth and merger of dark-matter haloes over cosmic history. As well as giving important insights into the growth of cosmic structure in their own right, they provide an essential backbone to semi-analytic models of…
The experiments conducted by various scientific groups indicate that, in dense two-dimensional systems of elongated particles subjected to vibration, the pattern formation is possible. Computer simulations have evidenced that the random…
We describe a simple efficient algorithm that allows one to construct Monte-Carlo realizations of merger histories of dark matter halos. The algorithm is motivated by the excursion set model (Bond et al. 1991) for the conditional and…
We investigate a randomly evolving process of subgraphs in an underlying host graph using the spectral theory of semigroups related to the Tsetlin library and hyperplane arrangements. Starting with some initial subgraph, at each iteration,…
A continuum theory based on thermodynamics has been developed for modeling diffusional creep of polycrystalline solids. It consists of a coupled problem of vacancy diffusion and mechanics where the vacancy generation/absorption at grain…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
Random walks and diffusions in symmetric random environment are known to exhibit metastable behavior: they tend to stay for long times in wells of the environment. For the case that the environment is a one-dimensional two-sided standard…
As research into community finding in social networks progresses, there is a need for algorithms capable of detecting overlapping community structure. Many algorithms have been proposed in recent years that are capable of assigning each…
We investigate hide-and-seek games on complex networks using a random walk framework. Specifically, we investigate the efficiency of various degree-biased random walk search strategies to locate items that are randomly hidden on a subset of…