中文
相关论文

相关论文: Absence of backward infinite paths for first-passa…

200 篇论文

We show that nontrivial bi-infinite polymer Gibbs measures do not exist in typical environments in the inverse-gamma (or log-gamma) directed polymer model on the planar square lattice. The precise technical result is that, except for…

概率论 · 数学 2020-11-12 Ofer Busani , Timo Seppäläinen

We study the algorithmic complexity of partitioning the vertex set of a given (di)graph into a small number of paths. The Path Partition problem (PP) has been studied extensively, as it includes Hamiltonian Path as a special case. The…

数据结构与算法 · 计算机科学 2024-12-24 Henning Fernau , Florent Foucaud , Kevin Mann , Utkarsh Padariya , Rajath Rao K. N

The geometric approach to optimal transport and information theory has triggered the interpretation of probability densities as an infinite-dimensional Riemannian manifold. The most studied Riemannian structures are Otto's metric, yielding…

偏微分方程分析 · 数学 2018-07-20 Martin Bauer , Sarang Joshi , Klas Modin

In this article, we study the geodesic problem in a generalized metric space, in which the distance function satisfies a relaxed triangle inequality $d(x,y)\leq \sigma (d(x,z)+d(z,y))$ for some constant $\sigma \geq 1$, rather than the…

度量几何 · 数学 2009-05-27 Qinglan Xia

We give examples of rank one compact surfaces on which there exist recurrent geodesics that cannot be shadowed by periodic geodesics. We build rank one compact surfaces such that ergodic measures on the unit tangent bundle of the surface…

动力系统 · 数学 2010-05-02 Yves Coudene , Barbara Schapira

Geodesic problems involve computing trajectories between prescribed initial and final states to minimize a user-defined measure of distance, cost, or energy. They arise throughout physics and engineering -- for instance, in determining…

机器学习 · 计算机科学 2025-11-06 Conor Rowan

We review the nearly complete classification project for finite distance-transitive graphs and compile a list of all known graphs. Interestingly, we find that those graphs with diameter larger than 4, apart from a small finite number of…

组合数学 · 数学 2026-04-13 Pei Ce Hua

For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…

组合数学 · 数学 2010-01-26 Thomas Zaslavsky

Let $A$ be a subset of positive relative upper density of $\PP^d$, the $d$-tuples of primes. We prove that $A$ contains an affine copy of any finite set $F\subs\Z^d$, which provides a natural multi-dimensional extension of the theorem of…

数论 · 数学 2023-09-12 Brian Cook , Ákos Magyar , Tatchai Titichetrakun

We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…

组合数学 · 数学 2025-11-17 Sahar Diskin , Michael Krivelevich

In random geometry, a recurring theme is that any two geodesics emanating from a typical point part ways at a strictly positive distance from the above point, and we call such points as $1$-stars. However, the measure zero set of atypical…

概率论 · 数学 2024-04-03 Manan Bhatia

In this paper we study half-geodesics, those closed geodesics that minimize on any subinterval of length $l(\gamma)/2$. For each nonnegative integer $n$, we construct Riemannian manifolds diffeomorphic to $S^2$ admitting exactly $n$…

微分几何 · 数学 2015-12-14 Ian Adelstein

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

概率论 · 数学 2007-05-23 Noga Alon , Itai Benjamini , Alan Stacey

We investigate the moderate and large deviations in first-passage percolation (FPP) with bounded weights on $\mathbb{Z}^d$ for $d \geq 2$. Write $T(\mathbf{x}, \mathbf{y})$ for the first-passage time and denote by $\mu(\mathbf{u})$ the time…

概率论 · 数学 2025-12-04 Wai-Kit Lam , Shuta Nakajima

We consider geodesic nets (critical points of a length functional on the space of embedded graphs) on doubled polygons (topological 2-spheres endowed with a flat metric away from finitely many cone singularities). We use the theorem of…

微分几何 · 数学 2025-04-30 Ian Adelstein , Elijah Fromm , Rajiv Nelakanti , Faren Roth , Supriya Weiss

The Directed Landscape, a random directed metric on the plane (where the first and the second coordinates are termed spatial and temporal respectively), was constructed in the breakthrough work of Dauvergne, Ortmann, and Vir\'ag, and has…

概率论 · 数学 2022-06-16 Shirshendu Ganguly , Lingfu Zhang

We consider the problem of finding, for two pairs $(s_1,t_1)$ and $(s_2,t_2)$ of vertices in an undirected graphs, an $(s_1,t_1)$-path $P_1$ and an $(s_2,t_2)$-path $P_2$ such that $P_1$ and $P_2$ share no edges and the length of each $P_i$…

数据结构与算法 · 计算机科学 2015-09-21 Leizhen Cai , Junjie Ye

Study of the KPZ universality class has seen the emergence of universal objects over the past decade which arise as the scaling limit of the member models. One such object is the directed landscape, and it is known that exactly solvable…

概率论 · 数学 2025-11-03 Pranay Agarwal

This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…

K理论与同调 · 数学 2014-04-28 Rufus Willett

We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward $p$-stars. Our models are close cousins of exponential random graph models (ERGMs), in which edges and certain other subgraph…

概率论 · 数学 2015-08-24 David Aristoff , Lingjiong Zhu
‹ 上一页 1 8 9 10 下一页 ›