中文
相关论文

相关论文: A New Construction of Forests with Low Visibility

200 篇论文

An $r$-augmented tree is a rooted tree plus $r$ edges added from each leaf to ancestors. For $d,g,r\in\mathbb{N}$, we construct a bipartite $r$-augmented complete $d$-ary tree having girth at least $g$. The height of such trees must grow…

组合数学 · 数学 2015-05-01 Noga Alon , Alexandr Kostochka , Benjamin Reiniger , Douglas B. West , Xuding Zhu

The dynamics of a rain forest is extremely complex involving births, deaths and growth of trees with complex interactions between trees, animals, climate, and environment. We consider the patterns of recruits (new trees) and dead trees…

统计方法学 · 统计学 2024-09-19 Abdollah Jalilian , Francisco Cuevas-Pacheco , Ganggang Xu , Rasmus Waagepetersen

Consider the $d$ dimensional lattice $\mathbb{Z}^d$ where each vertex is open or closed with probability $p$ or $1-p$ respectively. An open vertex $\mathbb{u} := (\mathbb{u}(1), \mathbb{u}(2),...,\mathbb{u}(d))$ is connected by an edge to…

概率论 · 数学 2015-02-27 Rahul Roy , Kumarjit Saha , Anish Sarkar

We study systems of particles on a line which have a maximum, are locally finite and evolve with independent increments. ``Quasi-stationary states'' are defined as probability measures, on the \sigma-algebra generated by the gap variables,…

概率论 · 数学 2007-05-23 Anastasia Ruzmaikina , Michael Aizenman

For $\varepsilon\in(0,1/2)$ and a natural number $d\ge 2$, let $N$ be a natural number with \[ N \,\ge\, 2^9\,\log_2(d)\, \left(\frac{\log_2(1/\varepsilon)}{\varepsilon}\right)^2. \] We prove that there is a set of $N$ points in the unit…

经典分析与常微分方程 · 数学 2019-08-15 Mario Ullrich , Jan Vybíral

Set prediction is about learning to predict a collection of unordered variables with unknown interrelations. Training such models with set losses imposes the structure of a metric space over sets. We focus on stochastic and underdefined…

机器学习 · 计算机科学 2021-02-23 David W. Zhang , Gertjan J. Burghouts , Cees G. M. Snoek

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

Using the Newman and Penrose spin coefficient (NP) formalism, we examine the full Bianchi identities of general relativity in the context of gravitational lensing, where the matter and space-time curvature are projected into a lens plane…

广义相对论与量子宇宙学 · 物理学 2008-11-26 Thomas P. Kling , Bryan Campbell

Motivated by the universal obstruction to the deformation quantization of Poisson structures in infinite dimensions we introduce the notion of quantizable odd Lie bialgebra. The main result of the paper is a construction of a highly…

量子代数 · 数学 2016-08-24 Anton Khoroshkin , Sergei Merkulov , Thomas Willwacher

A basic question about the directed landscape is how much of it can be reconstructed simply by knowing the shapes of its geodesics. We prove that the directed landscape can be reconstructed from the shapes of its semi-infinite geodesics. In…

概率论 · 数学 2025-08-05 Mustazee Rahman , Balint Virag

We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…

概率论 · 数学 2016-12-19 Nicolas Curien , Bénédicte Haas

We propose methods for density estimation and data synthesis using a novel form of unsupervised random forests. Inspired by generative adversarial networks, we implement a recursive procedure in which trees gradually learn structural…

机器学习 · 统计学 2023-03-14 David S. Watson , Kristin Blesch , Jan Kapar , Marvin N. Wright

Let X(t) be a Gaussian random field R d $\rightarrow$ R. Using the notion of (d -- 1)-integral geometric measures, we establish a relation between (a) the volume of the level set (b) the number of crossings of the restriction of the random…

We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…

概率论 · 数学 2018-06-20 Olivier Hénard , Pascal Maillard

We call $i$ a fixed point of a given sequence if the value of that sequence at the $i$-th position coincides with $i$. Here, we enumerate fixed points in the class of restricted growth sequences. The counting process is conducted by…

组合数学 · 数学 2021-06-25 Toufik Mansour , Reza Rastegar

When light from a distant source object, like a galaxy or a supernova, travels towards us, it is deflected by massive objects that lie on its path. When the mass density of the deflecting object exceeds a certain threshold, multiple, highly…

宇宙学与河外天体物理 · 物理学 2019-09-06 Jenny Wagner

Let $M$ be a smooth closed orientable manifold and $\mathcal{P}(M)$ the space of Poisson structures on $M$. We construct a Poisson bracket on $\mathcal{P}(M)$ depending on a choice of volume form. The Hamiltonian flow of the bracket acts on…

微分几何 · 数学 2023-04-27 Thomas Machon

Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…

组合数学 · 数学 2025-05-16 Jay Lilian Kneip

We construct a natural discrete random field on $\mathbb{Z}^{d}$, $d\geq 5$ that converges weakly to the bi-Laplacian Gaussian field in the scaling limit. The construction is based on assigning i.i.d. Bernoulli random variables on each…

概率论 · 数学 2013-12-03 Xin Sun , Wei Wu

In this article we investigate the Uniform Spanning Forest ($\mathsf{USF}$) in the nearest-neighbour integer lattice $\mathbf{Z}^{d+1} = \mathbf{Z}\times \mathbf{Z}^d$ with an assignment of conductances that makes the underlying (Network)…

概率论 · 数学 2020-09-03 Guillermo Martinez Dibene
‹ 上一页 1 8 9 10 下一页 ›