中文
相关论文

相关论文: A graph-theoretic remark on Stieltjes moment seque…

200 篇论文

A temporal graph is a graph for which the edge set can change from one time step to the next. This paper considers undirected temporal graphs defined over L time steps and connected at each time step. We study the Shortest Temporal…

最优化与控制 · 数学 2025-04-10 Stefan Balev , Éric Sanlaville , Antoine Toullalan

We consider the multiple Dirichlet series associated to the $k$th moment of real Dirichlet $L$-functions, and prove that it has a meromorphic continuation to a specific region in $\mathbb{C}^{k+1}$, which is conditional under the…

数论 · 数学 2024-03-22 Martin Čech

We consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using…

组合数学 · 数学 2010-12-17 Thomas Feierl

We study a Markov chain on $\mathbb{R}_+ \times S$, where $\mathbb{R}_+$ is the non-negative real numbers and $S$ is a finite set, in which when the $\mathbb{R}_+$-coordinate is large, the $S$-coordinate of the process is approximately…

概率论 · 数学 2017-04-14 Chak Hei Lo , Andrew R. Wade

Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…

组合数学 · 数学 2022-06-14 Stefan Steinerberger , Rekha R. Thomas

Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a linear-time algorithm to find one in any graph that is not an interval graph. Tucker characterized the minimal…

离散数学 · 计算机科学 2014-01-03 Nathan Lindzey , Ross M. McConnell

We establish sharp bounds for the second moment of symmetric-square $L$-functions attached to Hecke Maass cusp forms $u_j$ with spectral parameter $t_j$, where the second moment is a sum over $t_j$ in a short interval. At the central point…

数论 · 数学 2023-06-22 Rizwanur Khan , Matthew P. Young

We study the Steiner Tree problem on unit disk graphs. Given a $n$ vertex unit disk graph $G$, a subset $R\subseteq V(G)$ of $t$ vertices and a positive integer $k$, the objective is to decide if there exists a tree $T$ in $G$ that spans…

计算几何 · 计算机科学 2020-04-21 Sujoy Bhore , Paz Carmi , Sudeshna Kolay , Meirav Zehavi

We prove that every recurrent graph $G$ quasi-isometric to $\mathbb{R}$ admits an essentially unique Lipschitz harmonic function $h$. If $G$ is vertex-transitive, then the action of $Aut(G)$ preserves $\partial h$ up to a sign, a fact that…

组合数学 · 数学 2023-04-27 Agelos Georgakopoulos , Alex Wendland

We define numbers of the type Oj(N) and Ej(N) and the corresponding integer sequences. We prove that these integer sequences, e.g., SO(N) and SE(N) correspond to the number of odd and even walks in complete graphs. We then prove that there…

组合数学 · 数学 2013-02-06 Ernesto Estrada , José A. de la Peña

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

Consider an arbitrary transient random walk on $\Z^d$ with $d\in\N$. Pick $\alpha\in[0,\infty)$ and let $L_n(\alpha)$ be the spatial sum of the $\alpha$-th power of the $n$-step local times of the walk. Hence, $L_n(0)$ is the range,…

概率论 · 数学 2008-05-07 Mathias Becker , Wolfgang Konig

For an integer \( k \geq 2 \), the sequence of \( k \)-generalized Lucas numbers is defined by the recurrence relation \( L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} \) for all \( n \geq 2 \), with initial conditions \( L_0^{(k)} = 2…

The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…

综合数学 · 数学 2025-02-14 J. Stöckl

We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…

量子物理 · 物理学 2009-07-15 Edgar Feldman , Mark Hillery

Given integers $n,k,\ell$ such that $0<k<n, \; 1<\ell$ and an integer vector $x = (x_1,\ldots,x_n)$; denote by $m = m(x)$ the number of entries of $x$ that are multiple of $\ell$. Choose $n-k$ entries of $x$ as follows: if $n-k \leq m(x)$,…

组合数学 · 数学 2023-12-15 Vladimir Gurvich , Mariya Naumova

Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ having increments $(1,0)$, $(-1,1)$, $(0,-1)$ with jump probabilities $\lambda(M_k)$, $\mu_1(M_k)$, and $\mu_2(M_k)$ where $M$ is an irreducible aperiodic finite state Markov…

概率论 · 数学 2019-09-17 Fatma Başoğlu Kabran , Ali Devin Sezer

We study the asymptotic of the spectral distribution for large empirical covariance matrices composed of independent Multifractal Random Walk processes. The asymptotic is taken as the observation lag shrinks to 0. In this setting, we show…

概率论 · 数学 2012-06-26 Romain Allez , Rémi Rhodes , Vincent Vargas

We consider the Stieltjes moment problem for the Berg-Urbanik semigroups which form a class of multiplicative convolution semigroups on $\mathbb{R}_+$ that is in bijection with the set of Bernstein functions. Berg and Dur\'an proved that…

概率论 · 数学 2022-05-24 Pierre Patie , Aditya Vaidyanathan

Let $(\xi_1, \eta_1)$, $(\xi_2, \eta_2),\ldots$ be independent identically distributed $\mathbb{N}^2$-valued random vectors with arbitrarily dependent components. The sequence $(\Theta_k)_{k\in\mathbb{N}}$ defined by…