Note on limits of finite graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Note on limits of finite graphs

Published:2007-07 Issue:4 Volume:27 Page:503-507
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Elek Gábor

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/s00493-007-2214-8.pdf

Reference4 articles.

1. D. Aldous and R. Lyons: Processes on Unimodular Random Networks, (manuscript).

2. I. Benjamini and O. Schramm: Recurrence of distributional limits of finite planar graphs, Electron. J. Probab. 6 (2001), no. 23, 13 pp. (electronic).

3. D. Gaboriau: Invariant percolation and Harmonic Dirichlet Functions, Geom. Funct. Anal. 15(5) (2005), 1004–1051.

4. L. Lovász and B. Szegedy: The limits of dense graph sequences, (manuscript), URL: http://research.microsoft.com/users/lovasz/limits.pdf .

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Universal Lossless Compression Method Applicable to Sparse Graphs and Heavy–Tailed Sparse Graphs;IEEE Transactions on Information Theory;2023-02

2. Rooting algebraic vertices of convergent sequences;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023

3. An infinite-dimensional metapopulation SIS model;Journal of Differential Equations;2022-03

4. Invariant Schreier decorations of unimodular random networks;Annales Henri Lebesgue;2021-12-03

5. Flows on measurable spaces;Geometric and Functional Analysis;2021-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP