Results 31 to 40 of about 820 (100)
Asymptotic laws for compositions derived from transformed subordinators [PDF]
, 2006 A random composition of $n$ appears when the points of a random closed set $\widetilde{\mathcal{R}}\subset[0,1]$ are used to separate into blocks $n$ points sampled from the uniform distribution. We study the number of parts $K_n$ of this composition and
Gnedin, Alexander +2 more
core +2 more sources
Trimmed trees and embedded particle systems
, 2004 In a supercritical branching particle system, the trimmed tree consists of those particles which have descendants at all times. We develop this concept in the superprocess setting. For a class of continuous superprocesses with Feller underlying motion on
Fleischmann, Klaus, Swart, Jan M.
core +2 more sources
پژوهشهای ریاضی, 2020 Introduction Tries (from retrieval) are one of the most practical data structures with a tree construction in computer science. Tries store string data in leaves of tree.
Mehri Javanian
doaj
Testing for a General Class of Functional Inequalities [PDF]
, 2013 In this paper, we propose a general method for testing inequality restrictions on nonparametric functions. Our framework includes many nonparametric testing problems in a unified framework, with a number of possible applications in auction models, game ...
Lee, Sokbae +2 more
core +4 more sources
The oscillatory distribution of distances in random tries
, 2005 We investigate \Delta_n, the distance between randomly selected pairs of nodes among n keys in a random trie, which is a kind of digital tree.
Christophi, Costas A., Mahmoud, Hosam M.
core +2 more sources
Cover and hitting times of hyperbolic random graphs
Random Structures &Algorithms, Volume 65, Issue 4, Page 915-978, December 2024.Abstract We study random walks on the giant component of Hyperbolic Random Graphs (HRGs), in the regime when the degree distribution obeys a power law with exponent in the range (2,3)$$ \left(2,3\right) $$. In particular, we first focus on the expected time for a random walk to hit a given vertex or visit, that is, cover, all vertices.
Marcos Kiwi +2 more
wiley +1 more source
Noncolliding system of continuous-time random walks [PDF]
, 2014 The continuous-time random walk is defined as a Poissonization of discrete-time random walk. We study the noncolliding system of continuous-time simple and symmetric random walks on ${\mathbb{Z}}$.
Esaki, Syota
core +1 more source
Local limits in p$p$‐adic random matrix theory
Proceedings of the London Mathematical Society, Volume 129, Issue 3, September 2024.Abstract We study the distribution of singular numbers of products of certain classes of p$p$‐adic random matrices, as both the matrix size and number of products go to ∞$\infty$ simultaneously. In this limit, we prove convergence of the local statistics to a new random point configuration on Z$\mathbb {Z}$, defined explicitly in terms of certain ...
Roger Van Peski
wiley +1 more source
Studying the properties of galaxy cluster morphology estimators
, 2012 X-ray observations of galaxy clusters reveal a large range of morphologies with various degrees of disturbance, showing that the assumptions of hydrostatic equilibrium and spherical shape which are used to determine the cluster mass from X-ray data are ...
Ameglio, S. +3 more
core +1 more source
Asymptotic expansions relating to the distribution of the length of longest increasing subsequences
Forum of Mathematics, SigmaWe study the distribution of the length of longest increasing subsequences in random permutations of n integers as n grows large and establish an asymptotic expansion in powers of $n^{-1/3}$ .
Folkmar Bornemann
doaj +1 more source