中文
相关论文

相关论文: Potential Theory and the Boundary of Combinatorial…

200 篇论文

We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…

组合数学 · 数学 2022-01-11 Stefan Steinerberger

This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform…

组合数学 · 数学 2017-05-30 Matthew Yancey

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

组合数学 · 数学 2021-02-05 Jan Kurkofka , Ruben Melcher , Max Pitz

Let $\Omega\subset\mathbb{R}^\nu$, $\nu\ge 2$, be a $C^{1,1}$ domain whose boundary $\partial\Omega$ is either compact or behaves suitably at infinity. For $p\in(1,\infty)$ and $\alpha>0$, define \[…

谱理论 · 数学 2017-04-27 Hynek Kovarik , Konstantin Pankrashkin

We consider a transitive action of a finitely generated group $G$ and the Schreier graph $\Gamma$ defined by this action for some fixed generating set. For a probability measure $\mu$ on $G$ with a finite first moment we show that if the…

群论 · 数学 2021-05-18 Bogdan Stankov

Let $\mu$ be a probability measure on $\text{Out}(F_N)$ with finite first logarithmic moment with respect to the word metric, finite entropy, and whose support generates a nonelementary subgroup of $\text{Out}(F_N)$. We show that almost…

群论 · 数学 2016-02-10 Camille Horbez

Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…

概率论 · 数学 2019-07-29 Tom Hutchcroft

We study the boundary value problems for harmonic functions on open connected subsets of post-critically finite (p.c.f.) self-similar sets, on which the Laplacian is defined through a strongly recurrent self-similar local regular Dirichlet…

泛函分析 · 数学 2024-09-04 Qingsong Gu , Hua Qiu

Using a capacity approach, and the theory of measure's perturbation of Dirichlet forms, we give the probabilistic representation of the General Robin boundary value problems on an arbitrary domain $\Omega$, involving smooth measures, which…

概率论 · 数学 2013-03-26 Khalid Akhlil

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

概率论 · 数学 2019-03-05 Thomas Sauerwald , Luca Zanetti

Let G be a countable group which acts by isometries on a separable, but not necessarily proper, Gromov hyperbolic space X. We say the action of G is weakly hyperbolic if G contains two independent hyperbolic isometries. We show that a…

几何拓扑 · 数学 2015-01-05 Joseph Maher , Giulio Tiozzo

Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…

信息论 · 计算机科学 2023-08-08 Shahar Stein Ioushua , Ofer Shayevitz

We consider a closed region $R$ of 3d quantum space modeled by $SU(2)$ spin-networks. Using the concentration of measure phenomenon we prove that, whenever the ratio between the boundary $\partial R$ and the bulk edges of the graph…

广义相对论与量子宇宙学 · 物理学 2017-12-13 Fabio Anzà , Goffredo Chirco

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

概率论 · 数学 2018-07-19 Roberto I. Oliveira , Yuval Peres

An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up…

统计理论 · 数学 2018-08-20 Anna Ben-Hamou , Roberto I. Oliveira , Yuval Peres

A temporal graph $G$ is a sequence $(G_t)_{t \in I}$ of graphs on the same vertex set of size $n$. The \emph{temporal exploration problem} asks for the length of the shortest sequence of vertices that starts at a given vertex, visits every…

数据结构与算法 · 计算机科学 2025-12-01 Paul Bastide , Carla Groenland , Lukas Michel , Clément Rambaud

In a proximity region graph ${\cal G}$ in $\mathbb{R}^d$, two distinct points $x,y$ of a point process $\mu$ are connected when the 'forbidden region' $S(x,y)$ these points determine has empty intersection with $\mu$. The Gabriel graph,…

概率论 · 数学 2019-09-25 Larry Goldstein , Tobias Johnson , Raphaël Lachièze-Rey

For a bounded simply connected domain $\Omega\subset\mathbb{R}^2$, any point $z\in\Omega$ and any $0<\alpha<1$, we give a lower bound for the $\alpha$-dimensional Hausdorff content of the set of points in the boundary of $\Omega$ which can…

经典分析与常微分方程 · 数学 2018-03-23 Pekka Koskela , Debanjan Nandi , Artur Nicolau

It is known that for $\Omega \subset \mathbb{R}^{2}$ an unbounded convex domain and $H>0$, there exists a graph $G\subset \mathbb{R}^{3}$ of constant mean curvature $H$ over $\Omega $ with $\partial G=$ $\partial \Omega $ if and only if…

微分几何 · 数学 2020-01-24 Ari J. Aiolfi , Patrícia Klaser

We give a notion of boundary pair $(\mathcal{B}_-,\mathcal{B}_+)$ for measured groupoids which generalizes the one introduced by Bader and Furman \cite{BF14} for locally compact groups. In the case of a semidirect groupoid…

动力系统 · 数学 2026-03-04 Filippo Sarti , Alessio Savini
‹ 上一页 1 2 3 10 下一页 ›