ترغب بنشر مسار تعليمي؟ اضغط هنا

Shortest-weight paths in random regular graphs

232   0   0.0 ( 0 )
 نشر من قبل Hamed Amini
 تاريخ النشر 2012
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Consider a random regular graph with degree $d$ and of size $n$. Assign to each edge an i.i.d. exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edges on the shortest-weight paths between a fixed vertex and all the other vertices, as well as between any pair of vertices. Namely, for any fixed $d geq 3$, we show that the longest of these shortest-weight paths has about $hat{alpha}log n$ edges where $hat{alpha}$ is the unique solution of the equation $alpha log(frac{d-2}{d-1}alpha) - alpha = frac{d-3}{d-2}$, for $alpha > frac{d-1}{d-2}$.



قيم البحث

اقرأ أيضاً

We study some percolation problems on the complete graph over $mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the probability, such as independency, is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory.
A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process g lobal information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length and the transition to the frustrated regime are analysed. The performance of the suggested algorithm is evaluated through a comparison against a greedy algorithm.
Consider random $d$-regular graphs, i.e., random graphs such that there are exactly $d$ edges from each vertex for some $dge 3$. We study both the configuration model version of this graph, which has occasional multi-edges and self-loops, as well as the simple version of it, which is a $d$-regular graph chosen uniformly at random from the collection of all $d$-regular graphs. In this paper, we discuss mixing times of Glauber dynamics for the Ising model with an external magnetic field on a random $d$-regular graph, both in the quenched as well as the annealed settings. Let $beta$ be the inverse temperature, $beta_c$ be the critical temperature and $B$ be the external magnetic field. Concerning the annealed measure, we show that for $beta > beta_c$ there exists $hat{B}_c(beta)in (0,infty)$ such that the model is metastable (i.e., the mixing time is exponential in the graph size $n$) when $beta> beta_c$ and $0 leq B < hat{B}_c(beta)$, whereas it exhibits the cut-off phenomenon at $c_star n log n$ with a window of order $n$ when $beta < beta_c$ or $beta > beta_c$ and $B>hat{B}_c(beta)$. Interestingly, $hat{B}_c(beta)$ coincides with the critical external field of the Ising model on the $d$-ary tree (namely, above which the model has a unique Gibbs measure). Concerning the quenched measure, we show that there exists $B_c(beta)$ with $B_c(beta) leq hat{B}_c(beta)$ such that for $beta> beta_c$, the mixing time is at least exponential along some subsequence $(n_k)_{kgeq 1}$ when $0 leq B < B_c(beta)$, whereas it is less than or equal to $Cnlog n$ when $B>hat{B}_c(beta)$. The quenched results also hold for the model conditioned on simplicity, for the annealed results this is unclear.
A bootstrap percolation process on a graph G is an infection process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round every uninfected node which has at least r infected neighbours becomes infected and remains so forever. The parameter r > 1 is fixed. We consider this process in the case where the underlying graph is an inhomogeneous random graph whose kernel is of rank 1. Assuming that initially every vertex is infected independently with probability p > 0, we provide a law of large numbers for the number of vertices that will have been infected by the end of the process. We also focus on a special case of such random graphs which exhibit a power-law degree distribution with exponent in (2,3). The first two authors have shown the existence of a critical function a_c(n) such that a_c(n)=o(n) with the following property. Let n be the number of vertices of the underlying random graph and let a(n) be the number of the vertices that are initially infected. Assume that a set of a(n) vertices is chosen randomly and becomes externally infected. If a(n) << a_c(n), then the process does not evolve at all, with high probability as n grows, whereas if a(n)>> a_c(n), then with high probability the final set of infected vertices is linear. Using the techniques of the previous theorem, we give the precise asymptotic fraction of vertices which will be eventually infected when a(n) >> a_c (n) but a(n) = o(n). Note that this corresponds to the case where p approaches 0.
For each $n ge 1$, let $mathrm{d}^n=(d^{n}(i),1 le i le n)$ be a sequence of positive integers with even sum $sum_{i=1}^n d^n(i) ge 2n$. Let $(G_n,T_n,Gamma_n)$ be uniformly distributed over the set of simple graphs $G_n$ with degree sequence $mathrm {d}^n$, endowed with a spanning tree $T_n$ and rooted along an oriented edge $Gamma_n$ of $G_n$ which is not an edge of $T_n$. Under a finite variance assumption on degrees in $G_n$, we show that, after rescaling, $T_n$ converges in distribution to the Brownian continuum random tree as $n to infty$. Our main tool is a new version of Pitmans additive coalescent (https://doi.org/10.1006/jcta.1998.2919), which can be used to build both random trees with a fixed degree sequence, and random tree-weighted graphs with a fixed degree sequence. As an input to the proof, we also derive a Poisson approximation theorem for the number of loops and multiple edges in the superposition of a fixed graph and a random graph with a given degree sequence sampled according to the configuration model; we find this to be of independent interest.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا