Dieter Mitsche, Roland Diel
We consider the random hyperbolic graph model introduced by [KPK + 10] and then formalized by [GPP12]. We show that, in the subcritical case $α$ > 1, the size of the largest component is n^{1/(2$α$)+o(1)} , thus strengthening a result of [BFM15] which gave only an upper bound of n^{1/$α$+o(1)}.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A uniformly random graph on $n$ vertices with a fixed degree sequence, obeying a $γ$ subpower law, is studied. It is shown that, for $γ>3$, in a subcritical phase with high probability the largest component size does not exceed $n^{1/γ+\varepsilon_n}$, $\varepsilon_n=O(\ln\ln n/\ln n)$, $1/γ$ being the best power for this random graph. This is similar to the best possible $n^{1/(γ-1)}$ bound for a different model of the random graph, one with independent vertex degrees, conjectured by Durrett, and proved recently by Janson.
We study the size of the largest component of two models of random graphs with prescribed degree sequence, the configuration model (CM) and the uniform model (UM), in the (barely) subcritical regime. For the CM, we give upper bounds that are asymptotically tight for certain degree sequences. These bounds hold under mild conditions on the sequence and improve previous results of Hatami and Molloy on the barely subcritical regime. For the UM, we give weaker upper bounds that are tight up to logarithmic terms but require no assumptions on the degree sequence. In particular, the latter result appl…
The largest subcritical component in inhomogeneous random graphs of preferential attachment type
研究确定了偏好附加类型不均匀随机图中最大连通组件的大小，揭示其多项式增长特性及与传统不均匀随机图行为的差异。
It is shown that in a subcritical random graph with given vertex degrees satisfying a power law degree distribution with exponent $γ>3$, the largest component is of order $n^{1/(γ-1)}$. More precisely, the order of the largest component is approximatively given by a simple constant times the largest vertex degree. These results are extended to several other random graph models with power law degree distributions. This proves a conjecture by Durrett.
We study the inhomogeneous random graphs in the subcritical case. We derive an exact formula for the size of the largest connected component scaled to $\log n$ where $n$ is the size of the graph. This generalizes the recent result for the "rank 1 case". Here we discover that the same well-known equation for the survival probability, whose positive solution determines the asymptotics of the size of the largest component in the supercritical case, plays the crucial role in the subcritical case as well. But now these are the negative solutions which come into play.
Largest component and sharpness in continuum percolation
本文研究了在非临界情况下泊松随机连接模型中大连接组件的行为，证明了在亚临界情况下最大组件大小在窗口体积上以对数增长，在超临界情况下线性增长，并证明了在亚临界情况下原点集群的尾部呈指数衰减。
We study the behaviour of the largest components of the directed configuration model in the barely subcritical regime. We show that with high probability all strongly connected components in this regime are either cycles or isolated vertices and give an asymptotic distribution of the size of the $k$th largest cycle. This gives a configuration model analogue of a result of Łuczak and Seierstad for the binomial random digraph.
Kang, Perkins and Spencer showed that the size of the largest component of the Bohman-Frieze process at a fixed time $t$ smaller than $t_c$, the critical time for the process is $L_1(t)=Ω(\log n/(t_c-t)^2)$ with high probability. They also conjectured that this is the correct order, that is $L_1(t)=O(\log n/(t_c-t)^2)$ with high probability for fixed $t$ smaller than $t_c$. Using a different approach, Bhamidi, Budhiraja and Wang showed that $L_1(t_n)=O((\log n)^4/(t_c-t_n)^2)$ with high probability for $t_n\leq t_c-n^{-γ}$ where $γ\in(0,1/4)$. In this paper, we improve their result by showing …
The statistical behavior of the size (or mass) of the largest cluster in subcritical percolation on a finite lattice of size $N$ is investigated (below the upper critical dimension, presumably $d_c=6$). It is argued that as $N \to \infty$ the cumulative distribution function converges to the Fisher-Tippett (or Gumbel) distribution $e^{-e^{-z}}$ in a certain weak sense (when suitably normalized). The mean grows like $s_ξ^* \log N$, where $s_ξ^*(p)$ is a ``crossover size''. The standard deviation is bounded near $s_ξ^* π/\sqrt{6}$ with persistent fluctuations due to discreteness. These predictio…
Fix a graph $G$ in which every edge is colored in some of $k\ge 2$ colors. Two vertices $u$ and $v$ are CA-connected if $u$ and $v$ may be connected using any subset of $k - 1$ colors. CA-connectivity is an equivalence relation dividing the vertex set into classes called CA-components. In two recent papers, Ráth, Varga, Fekete, and Molontay, and Lichev and Schapira studied the size of the largest CA-component in a randomly colored random graph. The second of these works distinguished and studied three regimes (supercritical, intermediate, and subcritical) in which the largest CA-component has …
We study the "rank 1 case" of the inhomogeneous random graph model. In the subcritical case we derive an exact formula for the asymptotic size of the largest connected component scaled to log n. This result is new, it completes the corresponding known result in the supercritical case. We provide some examples of application of a new formula.
Sharp Asymptotics for the Largest Component in the Subcritical Regime of Preferential Attachment Without Vertex Growth
研究Pittel无顶点增长优先连接过程中最大分量大小，在亚临界区域给出精确渐近公式，常数随参数变化并趋于Erdős–Rényi值。
Let $\{Z_n\}_{n\geq 0 }$ be a critical or subcritical $d$-dimensional branching random walk started from a Poisson random measure whose intensity measure is the Lebesugue measure on $\mathbb{R}^d$. Denote by $R_n:=\sup\{u>0:Z_n(\{x\in\mathbb{R}^d:|x|<u\})=0\}$ the radius of the largest empty ball centered at the origin of $Z_n$. In this work, we prove that after suitable renormalization, $R_n$ converges in law to some non-degenerate distribution as $n\to\infty$. Furthermore, our work shows that the renormalization scales depend on the offspring law and the dimension of the branching random wal…
Subcritical percolation and network archaeology on random recursive tree substrate networks
研究随机递归树基底网络的网络考古学问题，利用辅助亚临界键渗流揭示树状重整化结构，通过在最大辅助渗流组件内应用乔丹中心性，为循环网络构建确定性大小的根置信集。
We study bond percolation on the hypercube $\{0,1\}^m$ in the slightly subcritical regime where $p = p_c (1-\varepsilon_m)$ and $\varepsilon_m = o(1)$ but $\varepsilon_m \gg 2^{-m/3}$ and study the clusters of largest volume and diameter. We establish that with high probability the largest component has cardinality $Θ\left(\varepsilon_m^{-2} \log(\varepsilon_m^3 2^m)\right)$, that the maximal diameter of all clusters is $(1+o(1)) \varepsilon_m^{-1} \log(\varepsilon_m^3 2^m)$, and that the maximal mixing time of all clusters is $Θ\left(\varepsilon_m^{-3} \log^2(\varepsilon_m^3 2^m)\right)$. The…
On the size of temporal cliques in subcritical random temporal graphs
本文改进了次临界随机时间图中最大时间团大小的上界，证明了当 $p=c\log n/n$ 且 $c<1$ 时，高概率最大时间团的大小为常数。
Large components in the subcritical Norros-Reittu model
本文研究亚临界 Norros-Reittu 随机图中各分量的顶点计数，证明其点过程收敛于泊松过程，并由此得到最大分量规模及最大叶子数的渐近结果，结果也适用于 Chung-Lu 模型和广义随机图。
We show that in the random hyperbolic graph model as formalized by Gugelmann et al. in the most interesting range of $\frac12 < α< 1$ the size of the second largest component is $Θ((\log n)^{1/(1-α)})$, thus answering a question of Bode et al. We also show that for $α=\frac12$ with constant probability the corresponding size is $Θ(\log n)$, whereas for $α=1$ it is $Ω(n^{b})$ for some $b > 0$.
We consider a Yule process until the total population reaches size $n\gg 1$, and assume that neutral mutations occur with high probability $1-p$ (in the sense that each child is a new mutant with probability $1-p$, independently of the other children), where $p=p_n\ll 1$. We establish a general strategy for obtaining Poisson limit laws for the number of subpopulations exceeding a given size and apply this to some mutation regimes of particular interest. Finally, we give an application to subcritical Bernoulli bond percolation on random recursive trees with percolation parameter $p_n$ tending t…
We consider the component structure of a recent model of random graphs on the hyperbolic plane that was introduced by Krioukov et al. The model exhibits a power law degree sequence, small distances and clustering, features that are associated with the so-called complex networks. The model is controlled by two parameters $α$ and $ν$ where, roughly speaking, $α$ controls the exponent of the power law and $ν$ controls the average degree. Refining earlier results, we are able to show a law of large numbers for the largest component. That is, we show that the fraction of points in the largest compo…
Bounded-size rules are dynamic random graph processes which incorporate limited choice along with randomness in the evolution of the system. One starts with the empty graph and at each stage two edges are chosen uniformly at random. One of the two edges is then placed into the system according to a decision rule based on the sizes of the components containing the four vertices. For bounded-size rules, all components of size greater than some fixed $K\geq 1$ are accorded the same treatment. Writing $\BS(t)$ for the state of the system with nt/2 edges, Spencer and Wormald proved that for such ru…
We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In particular, we show that there is a scaling window of width n^{-1/3} around p_c in which the sizes of the largest components are roughly n^{2/3} and we describe their limiting joint distribution. We also show that for the subcritical regime, i.e. p = (1-eps(n))p_c where eps(n)=o(1) but \eps(n)n^{1/3} tends to infinity, the sizes of the largest components are concent…
We apply here methods of inhomogeneous random graphs to a class of random distance graphs. This provides an example outside of the rank 1 models which is still solvable as long as the largest connected component is concerned. In particular, we show that some random distance graphs behave exactly as the classical Erdős-Rényi model not only in the supercritical phase (as was already known) but in the subcritical case as well.
The 2-dimensional Hamming graph H(2,n) consists of the $n^2$ vertices $(i,j)$, $1\leq i,j\leq n$, two vertices being adjacent when they share a common coordinate. We examine random subgraphs of H(2,n) in percolation with edge probability $p$, so that the average degree $2(n-1)p=1+ε$. Previous work by van der Hofstad and Luczak had shown that in the barely supercritical region $n^{-2/3}\ln^{1/3}n\ll ε\ll 1$ the largest component has size $\sim 2εn$. Here we show that the second largest component has size close to $ε^{-2}$, so that the dominant component has emerged. This result also suggests th…
We consider vertex percolation on pseudo-random $d-$regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in $\frac{n}{d}$) sized component, at $p=\frac{1}{d}$. In the supercritical regime, our main result recovers the sharp asymptotic of the size of the largest component, and shows that all other components are typically much smaller. Furthermore, we consider other typical properties of the largest component such as the number of edges, existence of a long cycle and expansion. In the subcritical regime, we stre…
We show that the largest subsurface projection distance between a marking and its image under the nth step of a random walk grows logarithmically in n, with probability approaching 1 as n tends to infinity. Our setup is general and also applies to (relatively) hyperbolic groups and to $\mathrm{Out}(F_n)$. We then use this result to prove Rivin's conjecture that for a random walk $(w_n)$ on the mapping class group, the shortest geodesic in the hyperbolic mapping torus $M_{w_n}$ has length on the order of $1/ \log^2(n)$.
Color-avoiding percolation on the Erdős-Rényi random graph
本文研究常数平均度的随机染色 Erdős-Rényi 随机图中的避色渗流，刻画最大 CA 分量呈线性、对数及有界大小的三种状态。
Random hyperbolic graphs were recently introduced by Krioukov et. al. [KPKVB10] as a model for large networks. Gugelmann, Panagiotou, and Peter [GPP12] then initiated the rigorous study of random hyperbolic graphs using the following model: for $α> \tfrac{1}{2}$, $C\in\mathbb{R}$, $n\in\mathbb{N}$, set $R=2\ln n+C$ and build the graph $G=(V,E)$ with $|V|=n$ as follows: For each $v\in V$, generate i.i.d. polar coordinates $(r_{v},θ_{v})$ using the joint density function $f(r,θ)$, with $θ_{v}$ chosen uniformly from $[0,2π)$ and $r_{v}$ with density $f(r)=\frac{α\sinh(αr)}{\cosh(αR)-1}$ for $0\le…
Random graph models with limited choice have been studied extensively with the goal of understanding the mechanism of the emergence of the giant component. One of the standard models are the Achlioptas random graph processes on a fixed set of $n$ vertices. Here at each step, one chooses two edges uniformly at random and then decides which one to add to the existing configuration according to some criterion. An important class of such rules are the bounded-size rules where for a fixed $K\geq 1$, all components of size greater than $K$ are treated equally. While a great deal of work has gone int…
Percolation on High-dimensional Product Graphs
本文研究基图正则且阶数有界的高维乘积图上的渗流，刻画次临界与超临界区域最大分支阶数，并证明其相变定量上类似于二项随机图。
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such results were derived by Bhamidi, van der Hofstad, Sen [Probab. Theory Relat. Fields 2018]. We develop general principles under which the identical scaling limits as the rank-one case can be obtained. Of independent interest, we derive refined asymptotics for various susceptibility functions and the maximal diameter in the barely subcritical regime.
The critical percolation window in growing random graphs
研究了生长随机图中临界渗流窗口的性质，揭示了窗口宽度、最大组件大小及易感性特征。
We investigate the scaling of the largest critical percolation cluster on a large d-dimensional torus, for nearest-neighbor percolation in high dimensions, or when d>6 for sufficient spread-out percolation. We use a relatively simple coupling argument to show that this largest critical cluster is, with high probability, bounded above by a large constant times $V^{2/3}$ and below by a small constant times $V^{2/3}(log V)^{-4/3}$, where V is the volume of the torus. We also give a simple criterion in terms of the subcritical percolation two-point function on Z^d under which the lower bound can b…
Block-weighted random graphs: planar and beyond
研究基于块数加权的连通随机图，提出装饰块树概念，揭示生成函数奇点行为和块树结构相变，确定不同阶段最大块大小。
Let $\mathcal{C}_1$ be the largest component of the Erdős--Rényi random graph $\mathcal{G}(n,p)$. The mixing time of random walk on $\mathcal {C}_1$ in the strictly supercritical regime, $p=c/n$ with fixed $c>1$, was shown to have order $\log^2n$ by Fountoulakis and Reed, and independently by Benjamini, Kozma and Wormald. In the critical window, $p=(1+\varepsilon)/n$ where $λ=\varepsilon^3n$ is bounded, Nachmias and Peres proved that the mixing time on $\mathcal{C}_1$ is of order $n$. However, it was unclear how to interpolate between these results, and estimate the mixing time as the giant co…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。