Related papers: Leap generators for composition schemes

Inspired by [4] we present a new algorithm for uniformly random generation of ordered trees in which all occuring outdegrees can be specified by a given sequence of numbers. The method can be used for random generation of binary or n-ary…

A new class of random composition structures (the ordered analog of Kingman's partition structures) is defined by a regenerative description of component sizes. Each regenerative composition structure is represented by a process of random…

A branching process in random environment $(Z_n, n \in \N)$ is a generalization of Galton Watson processes where at each generation the reproduction law is picked randomly. In this paper we give several results which belong to the class of…

We propose a supersymmetric composite model with three generations in which supersymmetry and electroweak symmetry are broken dynamically, and masses of quarks and leptons are generated without introducing any mass scales by hand. All the…

In the work asymptotic analysis of the problem of large deviations for random evolutions with independent increments in the circuit of L\'{e}vy approximation is carried out. Large deviations for random evolutions in the circuit of Levy…

For a topological dynamical system $(X, T)$ we define a uniform generator as a finite measurable partition such that the symmetric cylinder sets in the generated process shrink in diameter uniformly to zero. The problem of existence and…

We introduce a novel framework to approximate the aggregate frequency dynamics of coherent generators. By leveraging recent results on dynamics concentration of tightly connected networks, and frequency weighted balanced truncation, a…

Random sampling is a technique for signal acquisition which is gaining popularity in practical signal processing systems. Nowadays, event-driven analog-to-digital converters make random sampling feasible in practical applications. A process…

This paper presents a new class of probability distributions generated from the gamma distribution. For the new class proposed, we present several statistical properties, such as the risk function, the density expansions, Moment-generating…

Metastable behavior in dynamical systems may be a significant challenge for a simulation based analysis. In recent years, transfer operator based approaches to problems exhibiting metastability have matured. In order to make these…

Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any…

This paper explores the problem of generative modeling, aiming to simulate diverse examples from an unknown distribution based on observed examples. While recent studies have focused on quantifying the statistical precision of popular…

In quasi-Monte Carlo methods, generating high-dimensional low discrepancy sequences by generator matrices is a popular and efficient approach. Historically, constructing or finding such generator matrices has been a hard problem. In…

We show how to generate random derangements efficiently by two different techniques: random restricted transpositions and sequential importance sampling. The algorithm employing restricted transpositions can also be used to generate random…

We consider a nonlinear random walk which, in each time step, is free to choose its own transition probability within a neighborhood (w.r.t. Wasserstein distance) of the transition probability of a fixed L\'evy process. In analogy to the…

We provide an explicit algorithm for sampling a uniform simple connected random graph with a given degree sequence. By products of this central result include: (i) continuum scaling limits of uniform simple connected graphs with given…

Continuous-time branching processes (CTBPs) are powerful tools in random graph theory, but are not appropriate to describe real-world networks, since they produce trees rather than (multi)graphs. In this paper we analyze collapsed branching…

This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…

We compute exactly the full distribution of the number $m$ of local minima in a one-dimensional landscape generated by a random walk or a L\'evy flight. We consider two different ensembles of landscapes, one with a fixed number of steps $N$…

Generative models show great promise for the inverse design of molecules and inorganic crystals, but remain largely ineffective within more complex structures such as amorphous materials. Here, we present a diffusion model that reliably…