We consider a natural model of inhomogeneous random graphs that extends the classical Erd\H os-Rényi graphs and shares a close connection with the multiplicative coalescence, as pointed out by Aldous [AOP 1997]. In this model, the vertices are assigned weights that govern their tendency to form edges. It is by looking at the asymptotic distributions of the masses (sum of the weights) of the connected components of these graphs that Aldous and Limic [EJP 1998] have identified the entrance boundary of the multiplicative coalescence, which is intimately related to the excursion lengths of certain Lévy-type processes. We, instead, look at the metric structure of these components and prove their Gromov-Hausdorff-Prokhorov convergence to a class of random compact measured metric spaces that have been introduced in a companion paper. Our asymptotic regimes relate directly to the general convergence condition appearing in the work of Aldous and Limic. Our techniques provide a unified approach for this general "critical" regime, and relies upon two key ingredients: an encoding of the graph by some Lévy process as well as an embedding of its connected components into Galton-Watson forests. This embedding transfers asymptotically into an embedding of the limit objects into a forest of Lévy trees, which allows us to give an explicit construction of the limit objects from the excursions of the Lévy-type process. The mains results combined with the ones in the other paper allow us to extend and complement several previous results that had been obtained via regime-specific proofs, for instance: the case of Erd\H os-Rényi random graphs obtained by Addario-Berry, Goldschmidt and B. [PTRF 2012], the asymptotic homogeneous case as studied by Bhamidi, Sen and Wang [PTRF 2017], or the power-law case as considered by Bhamidi, Sen and van der Hofstad [PTRF 2018].
Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the multiplicative coalescent (the Erdős--Rényi random graph, more generally the so-called rank-one inhomogeneous random graphs of various types, and the configuration model). At the discrete level, the construction relies on a new point of view on (discrete) inhomogeneous random graphs that involves an embedding into a Galton--Watson forest. The new representatio…
We study a fragmentation of the $\mathbf p$-trees of Camarri and Pitman [Elect. J. Probab., vol. 5, pp. 1--18, 2000]. We give exact correspondences between the $\mathbf p$-trees and trees which encode the fragmentation. We then use these results to study the fragmentation of the ICRTs (scaling limits of $\mathbf p$-trees) and give distributional correspondences between the ICRT and the tree encoding the fragmentation. The theorems for the ICRT extend the ones by Bertoin and Miermont [Ann. Appl. Probab., vol. 23(4), pp. 1469--1493, 2013] about the cut tree of the Brownian continuum random tree.
Strong averaging principle for multiscale time-inhomogeneous SDEs with multiplicative $α$-stable noises
Research Center for Mathematics and Interdisciplinary Sciences, Shandong University（山东大学数学与交叉科学研究中心）；Durham University（杜伦大学）；School of Mathematics, Shandong University（山东大学数学学院）
We define some new sequences of recursively constructed random combinatorial trees, and show that, after properly rescaling graph distance and equipping the trees with the uniform measure on vertices, each sequence converges almost surely to a real tree in the Gromov-Hausdorff-Prokhorov sense. The limiting real trees are constructed via line-breaking the real half-line with a Poisson process having rate $(\ell+1)t^\ell dt$, for each positive integer $\ell$, and the growth of the combinatorial trees may be viewed as an inhomogeneous generalization of Rémy's algorithm.
It has been claimed in Aldous, Miermont and Pitman [PTRF, 2004] that all Lévy trees are mixings of inhomogeneous continuum random trees. We give a rigorous proof of this claim in the case of a stable branching mechanism, relying on a new procedure for recovering the tree distance from the graphical spanning trees that works simultaneously for stable trees and inhomogeneous continuum random trees.
We introduce a new stick-breaking construction for inhomogeneous continuum random trees (ICRT). This new construction allows us to prove the necessary and sufficient condition for compactness conjectured by Aldous, Miermont and Pitman arXiv:math/0401115 by comparison with Lévy trees. We also compute the fractal dimensions (Minkowski, Packing, Hausdorff).
One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random graph models with degree exponent $τ\in (3,4)$, distances between typical points both within maximal components in the critical regime as well as on the minimal spanning tree on the giant component in the supercritical regime scale like $n^{(τ-3)/(τ-1)}$. In this paper we study the metric space structure of maximal components of the multiplicative coalescent, i…
We study the inhomogeneous continuum random trees (ICRT) that arise as weak limits of birthday trees. We give a description of the exploration process, a function defined on [0,1] that encodes the structure of an ICRT, and also of its width process, determining the size of layers in order of height. These processes turn out to be transformations of bridges with exchangeable increments, which have already appeared in other ICRT related topics such as stochastic additive coalescence. The results rely on two different constructions of birthday trees from processes with exchangeable increments, on…
We study the asymptotics of the $p$-mapping model of random mappings on $[n]$ as $n$ gets large, under a large class of asymptotic regimes for the underlying distribution $p$. We encode these random mappings in random walks which are shown to converge to a functional of the exploration process of inhomogeneous random trees, this exploration process being derived (Aldous-Miermont-Pitman 2003) from a bridge with exchangeable increments. Our setting generalizes previous results by allowing a finite number of ``attracting points'' to emerge.
We study the solutions of the stochastic heat equation driven by spatially inhomogeneous multiplicative white noise based on a fractal measure. We prove pathwise uniqueness for solutions of this equation when the noise coefficient is Hölder continuous of index $γ>1-\fracη{2(η+1)}$. Here $η\in(0,1)$ is a constant that defines the spatial regularity of the noise.
We consider the ferromagnetic Ising model with spatially dependent external fields on a Cayley tree, and we investigate the conditions for the existence of the phase transition for a class of external fields, asymptotically approaching a homogeneous critical external field. Our results extend earlier results by Rozikov and Ganikhodjaev.
We study a new type of random minimum spanning trees. It is built on the complete graph where each vertex is given a weight, which is a positive real number. Then, each edge is given a capacity which is a random variable that only depends on the product of the weights of its endpoints. We then study the minimum spanning tree corresponding to the edge capacities. Under a condition of finite moments on the node weights, we show that the expected diameter and typical distances of this minimum spanning tree are of order $n^{1/3}$. This is a generalization of the results of Addario-Berry, Broutin, …
We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random environment. A related problem, with only one type of vertices and quite stringent conditions on the transition probabilities but on general trees has been considered previously in the literature LyoPem. In the presentation we give here, we restrict the study of the process on a regular graph instead of the irregular graph used in LyoPem. The close connection betw…
We consider simply generated trees and study multiplicative functions on rooted plane trees. We show that the associated generating functions satisfy differential equations or difference equations. Our approach considers B-series from Butcher's theory, the generating functions are seen as generalized Runge-Kutta methods
A multiplicative cascade can be thought of as a randomization of a measure on the boundary of a tree, constructed from an iid collection of random variables attached to the tree vertices. Given an initial measure with certain regularity properties, we construct a continuous time, measure-valued process whose value at each time is a cascade of the initial one. We do this by replacing the random variables on the vertices with independent increment processes satisfying certain moment assumptions. Our process has a Markov property: at any given time it is a cascade of the process at any earlier ti…
We consider $\mathbb Z$-valued $p$-SOS-models with nearest neighbor interactions of the form $|ω_v-ω_w|^p$, and finite-spin ferromagnetic models on regular trees. This includes the classical SOS-model, the discrete Gaussian model and the Potts model. We exhibit a family of extremal inhomogeneous (i.e. tree automorphism non-invariant) Gibbs measures arising as low temperature perturbations of ground states (local energy minimizers), which have a sparse enough set of broken bonds together with uniformly bounded increments along them. These low temperature states in general do not possess any sym…
The purpose of this article is threefold. First, we introduce a new type of boundary condition for the multiplicative-noise stochastic heat equation on the half space. This is essentially a Dirichlet boundary condition but with a nontrivial normalization near the boundary which leads to inhomogeneous transition densities (roughly, those of a Brownian \textit{meander}) within the associated chaos series. Secondly, we prove a new convergence result of the directed-polymer partition function in an octant to the multiplicative stochastic heat equation with this type of boundary condition, which in…
Motivated by applications, the last few years have witnessed tremendous interest in understanding the structure as well as the behavior of dynamics for inhomogeneous random graph models. In this study we analyze the maximal components at criticality of one famous class of such models, the rank-one inhomogeneous random graph model. Viewing these components as measured random metric spaces, under finite moment assumptions for the weight distribution, we show that the components in the critical scaling window with distances scaled by $n^{-1/3}$ converge in the Gromov-Haussdorf-Prokhorov metric to…
In this paper we study non-interactive correlation distillation (NICD), a generalization of the study of noise sensitivity of boolean functions. We extend the model to NICD on trees. In this model there is a fixed undirected tree with players at some of the nodes. One node is given a uniformly random string and this string is distributed throughout the network, with the edges of the tree acting as independent binary symmetric channels. The goal of the players is to agree on a shared random bit without communicating. Our new contributions include the following: 1. In the case of a k-leaf star g…
We revisit the discrete additive and multiplicative coalescents, starting with $n$ particles with unit mass. These cases are known to be related to some "combinatorial coalescent processes": a time reversal of a fragmentation of Cayley trees or a parking scheme in the additive case, and the random graph process $(G(n,p))_p$ in the multiplicative case. Time being fixed, encoding these combinatorial objects in real-valued processes indexed by the line is the key to describing the asymptotic behaviour of the masses as $n\to +\infty$. We propose to use the Prim order on the vertices instead of the…
We study the asymptotic behavior of the clique number in rank-1 inhomogeneous random graphs, where edge probabilities between vertices are roughly proportional to the product of their vertex weights. We show that the clique number is concentrated on at most two consecutive integers, for which we provide an expression. Interestingly, the order of the clique number is primarily determined by the overall edge density, with the inhomogeneity only affecting multiplicative constants or adding at most a $\log\log(n)$ multiplicative factor. For sparse enough graphs the clique number is always bounded …
We find scaling limits for the sizes of the largest components at criticality for rank-1 inhomogeneous random graphs with power-law degrees with power-law exponent τ. We investigate the case where $τ\in(3,4)$, so that the degrees have finite variance but infinite third moment. The sizes of the largest clusters, rescaled by $n^{-(τ-2)/(τ-1)}$, converge to hitting times of a "thinned" Lévy process, a special case of the general multiplicative coalescents studied by Aldous [Ann. Probab. 25 (1997) 812-854] and Aldous and Limic [Electron. J. Probab. 3 (1998) 1-59]. Our results should be contrasted …
Multiplicative cascades, under weak or strong disorder, refer to sequences of positive random measures $μ_{n,β}, n = 1,2,\dots$, parameterized by a positive disorder parameter $β$, and defined on the Borel $σ$-field ${\mathcal B}$ of $\partial T = \{0,1,\dots b-1\}^\infty$ for the product topology. The normalized cascade is defined by the corresponding sequence of random probability measures $prob_{n,β}:= Z_{n,β}^{-1}μ_{n,β}, n = 1,2\dots,$ normalized to a probability by the partition function $Z_{n,β}$. In this note, a recent result of Madaule (2011) is used to explicitly construct a family o…
We study fine properties of Lévy trees that are random compact metric spaces introduced by Le Gall and Le Jan in 1998 as the genealogy of continuous state branching processes. Lévy trees are the scaling limits of Galton-Watson trees and they generalize Aldous's continuum random tree which corresponds to the Brownian case. In this paper we prove that Lévy trees have always an exact packing measure: We explicitely compute the packing gauge function and we prove that the corresponding packing measure coincides with the mass measure up to a multiplicative constant.
A dynamical approach to spanning and surplus edges of random graphs
Univ Paris Est Créteil, Univ Gustave Eiffel, CNRS, LAMA UMR 8050（巴黎东克雷泰伊大学，古斯塔夫·埃菲尔大学，法国国家科学研究中心，LAMA）；Institut de Recherche Mathématique Avancée, UMR 7501 Université de Strasbourg et CNRS（斯特拉斯堡大学与法国国家科学研究中心联合高级数学研究所）
We consider a pruning of the inhomogeneous continuum random trees, as well as the cut trees that encode the genealogies of the fragmentations that come with the pruning. We propose a new approach to the reconstruction problem, which has been treated for the Brownian CRT in [Electron. J. Probab. vol. 22, 2017] and for the stable trees in [Ann. IHP B, vol 55, 2019]. Our approach does not rely upon self-similarity and can potentially apply to general Lévy trees as well.
Given a solution to a recursive distributional equation, a natural (and non-trivial) question is whether the corresponding recursive tree process is endogenous. That is, whether the random environment almost surely defines the tree process. We propose a new method of proving endogeny, which applies to various processes. As explicit examples, we establish endogeny of the random metrics on non-pivotal hierarchical graphs defined by multiplicative cascades and of mean-field optimization problems as the mean-field matching and travelling salesman problems in pseudo-dimension q>1.
We study the asymptotic behaviour of once-reinforced biased random walk (ORbRW) on Galton-Watson trees. Here the underlying (unreinforced) random walk has a bias towards or away from the root. We prove that in the setting of multiplicative once-reinforcement the ORbRW can be recurrent even when the underlying biased random walk is ballistic. We also prove that, on Galton-Watson trees without leaves, the speed is positive in the transient regime. Finally, we prove that, on regular trees, the speed of the ORbRW is monotone decreasing in the reinforcement parameter when the underlying random walk…
The aim of this study is tree-fold. First, we investigate the thermodynamics of the Ising models with respect to 2-multiple Hamiltonians. This extends the previous results of [Chazotte and Redig, Electron. J. Probably., 2014] to $\mathbb{N}^d$. Second, we establish the large deviation principle (LDP) of the average $\frac{1}{N} S_N^G$, where $S_N^G$ is a 2-multiple sum along a semigroup generated by k numbers which are k co-primes. This extends the previous results [Ban et al. Indag. Math., 2021] to a board class of the long-range interactions. Finally, the results described above are generali…
In these expository notes, we describe some features of the multiplicative coalescent and its connection with random graphs and minimum spanning trees. We use Pitman's proof of Cayley's formula, which proceeds via a calculation of the partition function of the additive coalescent, as motivation and as a launchpad. We define a random variable which may reasonably be called the empirical partition function of the multiplicative coalescent, and show that its typical value is exponentially smaller than its expected value. Our arguments lead us to an analysis of the susceptibility of the Erdős-Rény…
The a.s. existence of a polymer probability in the infinite volume limit is readily obtained under general conditions of weak disorder from standard theory on multiplicative cascades or branching random walk. However, speculations in the case of strong disorder have been mixed. In this note existence of an infinite volume probability is established at critical strong disorder for which one has convergence in probability. Some calculations in support of a specific formula for the a.s. asymptotic variance of the polymer path under strong disorder are also provided.
We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results allow us to prove a conjecture and settle an open problem of Janson (https://doi.org/10.1214/11-PS188), and nearly prove another conjecture and settle another open problem from the same work (up to a polylogarithmic factor). The key tool for our work is an equivalence in law between the degrees along the path to a random node in a random tree with given degr…
Rank 1 inhomogeneous random graphs are a natural generalization of Erdős Rényi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of the nodes it is connecting. In this article, we give precise and uniform exponential bounds on the size, weight and surplus of rank 1 inhomogeneous random graphs where the weights of the nodes behave like a random variable with finite fourth moment. We focus on the case where the mean degree of a random node is slightly larger than 1, we call that case the barely su…
In this article a collection of random self-similar fractal dendrites is constructed, and their Hausdorff dimension is calculated. Previous results determining this quantity for random self-similar structures have relied on geometrical properties of an underlying metric space or the scaling factors being bounded uniformly away from 0. However, using a percolative argument, and taking advantage of the tree-like structure of the sets considered here, it is shown that conditions such as these are not necessary. The scaling factors of the recursively defined structures in consideration form what i…
The goal of this paper is to provide a general purpose result for the coupling of exploration processes of random graphs, both undirected and directed, with their local weak limits when this limit is a marked Galton-Watson process. This class includes in particular the configuration model and the family of inhomogeneous random graphs with rank-1 kernel. Vertices in the graph are allowed to have attributes on a general separable metric space and can potentially influence the construction of the graph itself. The coupling holds for any fixed depth of a breadth-first exploration process.
We are interested in the random walk in random environment on an infinite tree. Lyons and Pemantle [11] give a precise recurrence/transience criterion. Our paper focuses on the almost sure asymptotic behaviours of a recurrent random walk $(X\_n)$ in random environment on a regular tree, which is closely related to Mandelbrot [13]'s multiplicative cascade. We prove, under some general assumptions upon the distribution of the environment, the existence of a new exponent $ν\in (0, {1\over 2}]$ such that $\max\_{0\le i \le n} |X\_i|$ behaves asymptotically like $n^ν$. The value of $ν$ is explicitl…
We study ASEP in a spatially inhomogeneous environment on a torus $ \mathbb{T}^{(N)} = \mathbb{Z}/N\mathbb{Z} $ of $ N $ sites. A given inhomogeneity $ \widetilde{a}(x) \in (0,\infty) $, $x \in \mathbb{T} $, perturbs the overall asymmetric jumping rates $ r < \ell \in (0,1) $ at bonds, so that particles jump from site $ x $ to $ x+1 $ with rate $ r\widetilde{a}(x) $ and from $x+1$ to $x$ with rate $ \ell\widetilde{a}(x) $ (subject to the exclusion rule in both cases). Under the limit $ N\to\infty $, we suitably tune the asymmetry $ (\ell-r) $ to zero like $N^{-\frac{1}{2}}$ and the inhomogenei…
We continue the development of the theory of pathwise stochastic entropy solutions for scalar conservation laws in $\R^N$ with quasilinear multiplicative ''rough path'' dependence by considering inhomogeneous fluxes and a single rough path like, for example, a Brownian motion. Following our previous note where we considered spatially independent fluxes, we introduce the notion of pathwise stochastic entropy solutions and prove that it is well posed, that is we establish existence, uniqueness and continuous dependence in the form of a (pathwise) $L^1$-contraction. Our approach is motivated by t…
