中文
相关论文

相关论文: The spectral dimension of random trees

200 篇论文

We analyse growing networks ranging from collaboration graphs of scientists to the network of similarities defined among the various transcriptional profiles of living cells. For the explicit demonstration of the scale-free nature and…

统计力学 · 物理学 2009-11-10 I. Farkas , I. Derenyi , H. Jeong , Z. Neda , Z. N. Oltvai , E. Ravasz , A. Schubert , A. -L. Barabasi , T. Vicsek

In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…

组合数学 · 数学 2021-04-23 Jaroslav Nesetril , Patrice Ossona De Mendez

The first main result of this paper is that the law of the (rescaled) two-dimensional uniform spanning tree is tight in a space whose elements are measured, rooted real trees continuously embedded into Euclidean space. Various properties of…

概率论 · 数学 2017-07-04 M. T. Barlow , D. A. Croydon , T. Kumagai

We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to the local time of a standard Brownian excursion. Furthermore…

组合数学 · 数学 2010-03-08 Michael Drmota , Bernhard Gittenberger

The notion of a spectral geometry on a compact metric space X is introduced. This notion serves as a discrete approximation of X motivated by the notion of a spectral triple from non-commutative geometry. A set of axioms charaterising…

算子代数 · 数学 2017-11-01 Sergei Buyalo

We compute a number of distance-dependent universal scaling functions characterizing the distance statistics of large maps of genus one. In particular, we obtain explicitly the probability distribution for the length of the shortest…

数学物理 · 物理学 2010-07-01 E. Guitter

Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…

信息论 · 计算机科学 2023-09-19 Amirmohammad Farzaneh , Mihai-Alin Badiu , Justin P. Coon

We propose a new method of the analytical computation of the spectral dimension which is based on the equivalence of the random walk and the q-state Potts model with non-zero magnetic field in the limit $q\to 0$. Calculating the critical…

高能物理 - 理论 · 物理学 2009-09-10 Igor Goncharenko

We provide a complete description of possible covariance matrices consistent with a Gaussian latent tree model for any tree. We then present techniques for utilising these constraints to assess whether observed data is compatible with that…

统计方法学 · 统计学 2016-04-13 Nathaniel Shiers , Piotr Zwiernik , John A. D. Aston , Jim Q. Smith

Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…

概率论 · 数学 2021-01-29 Noah Forman

We study the spectrum of a random matrix, whose elements depend on the Euclidean distance between points randomly distributed in space. This problem is widely studied in the context of the Instantaneous Normal Modes of fluids and is…

无序系统与神经网络 · 物理学 2009-10-31 M. Mezard , G. Parisi , A. Zee

In this work, we study the color discrepancy of spanning trees in random graphs. We show that for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ with $p$ above the connectivity threshold, the following holds with high probability: in every…

组合数学 · 数学 2025-11-10 Wenchong Chen , Xiao-Chuan Liu , Xu Yang

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

概率论 · 数学 2012-10-24 David Croydon

We consider infinite Galton-Watson trees without leaves together with i.i.d.~random variables called marks on each of their vertices. We define a class of flow rules on marked Galton-Watson trees for which we are able, under some algebraic…

概率论 · 数学 2018-05-07 Pierre Rousselin

The spectral density of random matrices is studied through a quaternionic generalisation of the Green's function, which precisely describes the mean spectral density of a given matrix under a particular type of random perturbation. Exact…

数学物理 · 物理学 2011-04-08 Tim Rogers

This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size $n$, find a probability law on the subsets of any given size $m \leq…

概率论 · 数学 2016-02-01 Luca Avena , Alexandre Gaudillière

Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…

组合数学 · 数学 2015-06-24 Art M. Duval , Caroline J. Klivans , Jeremy L. Martin

The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.

数论 · 数学 2024-01-09 Roberto Conti , Pierluigi Contucci , Vitalii Iudelevich

We explore the structure of the p-adic automorphism group Gamma of the infinite rooted regular tree. We determine the asymptotic order of a typical element, answering an old question of Turan. We initiate the study of a general dimension…

群论 · 数学 2011-11-10 Miklos Abert , Balint Virag

Scale transformations have played an extremely successful role in studies of cosmological large-scale structure by relating the non-linear spectrum of cosmological density fluctuations to the linear primordial power at longer wavelengths.…

天体物理学 · 物理学 2009-11-13 Jun Pan , Peter Coles , Istvan Szapudi