中文
相关论文

相关论文: A countdown process, with application to the rank …

200 篇论文

Some probabilistic aspects of the number variance statistic are investigated. Infinite systems of independent Brownian motions and symmetric alpha-stable processes are used to construct new examples of processes which exhibit both divergent…

概率论 · 数学 2007-05-23 Ben Hambly , Liza Jones

We consider uniformly random strictly upper-triangular matrices in $\operatorname{Mat}_n(\mathbb{F}_q)$. For such a matrix $A_n$, we show that $n-\operatorname{rank}(A_n) \approx \log_q n$ as $n \to \infty$, and find that the fluctuations…

概率论 · 数学 2026-01-14 Roger Van Peski

We introduce the concept of matrix liberation process, a random matrix counterpart of the liberation process in free probability, and prove a large deviation upper bound for its empirical distribution with several properties on its rate…

概率论 · 数学 2019-05-21 Yoshimichi Ueda

We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…

概率论 · 数学 2023-07-26 Theo van Uem

We consider a random process with discrete time formed by singular values of products of truncations of Haar distributed unitary matrices. We show that this process can be understood as a scaling limit of the Schur process, which gives…

数学物理 · 物理学 2020-07-24 Alexei Borodin , Vadim Gorin , Eugene Strahov

Quantization for probability distributions refers broadly to estimating a given probability measure by a discrete probability measure supported by a finite number of points. We consider general geometric approaches to quantization using…

动力系统 · 数学 2020-02-11 Joseph Rosenblatt , Mrinal Kanti Roychowdhury

We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…

概率论 · 数学 2026-03-10 Partha S. Dey , S. Rasoul Etesami , Aditya S. Gopalan

Randomness is a crucial resource for a broad range of important applications, such as Monte Carlo simulation and computation, generative artificial intelligence and cryptography. But what is randomness? A widely accepted definition has…

量子物理 · 物理学 2024-10-01 Mario Stipčević

Macdonald processes are probability measures on sequences of partitions defined in terms of nonnegative specializations of the Macdonald symmetric functions and two Macdonald parameters q,t in [0,1). We prove several results about these…

概率论 · 数学 2015-03-19 Alexei Borodin , Ivan Corwin

We consider the stochastic ranking process with space-time dependent unbounded jump rates for the particles. We prove that the joint empirical distribution of jump rate and scaled position converges almost surely to a deterministic…

概率论 · 数学 2017-01-02 Tetsuya Hattori

Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…

概率论 · 数学 2013-08-16 Richard Arratia , Simon Tavare

This paper presents a sequential randomized lowrank matrix factorization approach for incrementally predicting values of an unknown function at test points using the Gaussian Processes framework. It is well-known that in the Gaussian…

机器学习 · 计算机科学 2017-11-21 Shaunak D. Bopardikar , George S. Eskander Ekladious

The lattice of the set partitions of $[n]$ ordered by refinement is studied. Given a map $\phi: [n] \rightarrow [n]$, by taking preimages of elements we construct a partition of $[n]$. Suppose $t$ partitions $p_1,p_2,\dots,p_t$ are chosen…

概率论 · 数学 2016-02-04 Dmitry Krachun , Yuri Yakubovich

Adding a column of numbers produces "carries" along the way. We show that random digits produce a pattern of carries with a neat probabilistic description: the carries form a one-dependent determinantal point process. This makes it easy to…

概率论 · 数学 2009-04-24 Alexei Borodin , Persi Diaconis , Jason Fulman

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…

量子物理 · 物理学 2020-12-09 Matheus G. Andrade , Franklin Marquezino , Daniel R. Figueiredo

In Random Forests, proximity distances are a metric representation of data into decision space. By observing how changes in input map to the movement of instances in this space we are able to determine the independent contribution of each…

机器学习 · 统计学 2018-07-18 Leanne S. Whitmore , Anthe George , Corey M. Hudson

Random matrices whose entries come from a stationary Gaussian process are studied. The limiting behavior of the eigenvalues as the size of the matrix goes to infinity is the main subject of interest in this work. It is shown that the…

概率论 · 数学 2016-04-22 Arijit Chakrabarty , Rajat Subhra Hazra , Deepayan Sarkar

We present some correlated fractional counting processes on a finite time interval. This will be done by considering a slight generalization of the processes in Borges et al. (2012). The main case concerns a class of space-time fractional…

概率论 · 数学 2014-11-10 Luisa Beghin , Roberto Garra , Claudio Macci

We consider a certain sequence of random walks. The state space of the n-th random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to…

概率论 · 数学 2010-11-16 Leonid Petrov

We introduce a new random matrix model called distance covariance matrix in this paper, whose normalized trace is equivalent to the distance covariance. We first derive a deterministic limit for the eigenvalue distribution of the distance…

统计理论 · 数学 2021-05-18 Weiming Li , Qinwen Wang , Jianfeng Yao
‹ 上一页 1 2 3 10 下一页 ›