中文
相关论文

相关论文: Limit spaces of vertex and edge replacement system…

200 篇论文

We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…

Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…

环与代数 · 数学 2015-11-20 Gabor Elek

We are interested in evolution phenomena on star-like networks composed of several branches which vary considerably in physical properties. The initial boundary value problem for singularly perturbed hyperbolic differential equation on a…

偏微分方程分析 · 数学 2017-04-19 Yuriy Golovaty , Volodymyr Flyud

We prove that the restriction of the vertex-reinforced jump process to a subset of the vertex set is a mixture of vertex-reinforced jump processes. A similar statement holds for the non-linear hyperbolic supersymmetric sigma model. This is…

概率论 · 数学 2024-11-12 Margherita Disertori , Franz Merkl , Silke W. W. Rolles

Hierarchically hyperbolic spaces provide a common framework for studying mapping class groups of finite type surfaces, Teichm\"uller space, right-angled Artin groups, and many other cubical groups. Given such a space $\mathcal X$, we build…

几何拓扑 · 数学 2018-03-16 Matthew G. Durham , Mark F. Hagen , Alessandro Sisto

Many physical systems -- such as optical waveguide lattices and dense neuronal or vascular networks -- can be modeled by metric graphs, where slender "wires" (edges) support wave or diffusion equations subject to Kirchhoff conditions at the…

数学物理 · 物理学 2025-08-26 Sidney Holden , Geoffrey Vasil

For a contractive iterated function system (IFS), it is known that there is a natural hyperbolic graph structure (augmented tree) on the symbolic space of the IFS that reflects the relationship among neighboring cells, and its hyperbolic…

度量几何 · 数学 2020-06-24 Shi-Lei Kong , Ka-Sing Lau , Xiang-Yang Wang

We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…

组合数学 · 数学 2026-03-24 Eitan Levin , Venkat Chandrasekaran

We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…

几何拓扑 · 数学 2015-11-11 Javier Aramayona , Ariadna Fossas , Hugo Parlier

This is an expository article on visual metrics on boundaries of hyperbolic metric spaces. We discuss the construction of visual metrics, quasisymmetries and their invariants, Hausdorff and conformal dimension, and constructions and…

几何拓扑 · 数学 2025-06-13 Emily Stark

$\delta$-hyperbolic graphs, originally conceived by Gromov in 1987, occur often in many network applications; for fixed $\delta$, such graphs are simply called hyperbolic graphs and include non-trivial interesting classes of "non-expander"…

计算复杂性 · 计算机科学 2018-08-20 Bhaskar DasGupta , Marek Karpinski , Nasim Mobasheri , Farzaneh Yahyanejad

We give upper bounds, linear in rank, to the topological dimensions of the Gromov boundaries of the intersection graph, the free factor graph and the cyclic splitting graph of a finitely generated free group.

群论 · 数学 2020-12-09 Mladen Bestvina , Camille Horbez , Richard D. Wade

A vertex in a graph is called central if it minimizes its maximum distance to the other vertices. The radius of a graph $G$ is the largest distance between a central vertex and the other vertices, and it is denoted by $rad(G)$. In the…

数据结构与算法 · 计算机科学 2026-05-05 Guillaume Ducoffe

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

组合数学 · 数学 2021-10-26 Evangelos Bartzos , Ioannis Z. Emiris , Raimundas Vidunas

We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…

组合数学 · 数学 2013-11-13 Svante Janson , Simone Severini

We refine upper bounds on the permanent saturation time of metric graphs using interval exchange transformations (IETs). Earlier results gave bounds under incommensurable edge lengths, we improve and generalize them by using the ergodic and…

动力系统 · 数学 2025-12-17 Egor Ermolaev , Vsevolod Chernyshev , Alexandra Skripchenko

We consider extension variants of the classical graph problems Vertex Cover and Independent Set. Given a graph $G=(V,E)$ and a vertex set $U \subseteq V$, it is asked if there exists a minimal vertex cover (resp.\ maximal independent set)…

计算复杂性 · 计算机科学 2018-10-12 Katrin Casel , Henning Fernau , Mehdi Khosravian Ghadikolaei , Jérôme Monnot , Florian Sikora

Let $G$ be a relatively hyperbolic group that admits a decomposition into a finite graph of relatively hyperbolic groups structure with quasi-isometrically (qi) embedded condition. We prove that the set of conjugates of all the vertex and…

群论 · 数学 2019-12-06 Swathi Krishna

In this paper we define the notion of $(p,\delta)$--Gromov hyperbolic space where we relax Gromov's {\it slimness} condition to allow that not all but a positive fraction of all triangles are $\delta$--slim. Furthermore, we study maximum…

组合数学 · 数学 2013-03-13 Shi Li , Gabriel H Tucci

In this paper we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for the number of edge, respectively of…

概率论 · 数学 2016-06-03 Codina Cotar , Debleena Thacker
‹ 上一页 1 2 3 10 下一页 ›