Results 31 to 40 of about 1,253 (97)
The Incipient Giant Component in Bond Percolation on General Finite Weighted Graphs
, 2016 On a large finite connected graph let edges $e$ become "open" at independent random Exponential times of arbitrary rates $w_e$. Under minimal assumptions, the time at which a giant component starts to emerge is weakly concentrated around its ...
Aldous, David J.
core +2 more sources
INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES
Forum of Mathematics, Sigma, 2016 Let $L$ be a countable language. We say that a countable infinite $L$
NATHANAEL ACKERMAN +2 more
doaj +1 more source
Mixing Cutoff for Simple Random Walks on the Chung–Lu Digraph
Random Structures &Algorithms, Volume 66, Issue 1, January 2025.ABSTRACT In this article, we are interested in the mixing behavior of simple random walks on inhomogeneous directed graphs. We focus our study on Chung–Lu digraphs, which are inhomogeneous networks that generalize Erdös–Rényi digraphs, and where edges are included independently and according to given Bernoulli laws.
Alessandra Bianchi, Giacomo Passuello
wiley +1 more source
Local Large deviation: A McMillian Theorem for Coloured Random Graph Processes
, 2017 For a finite typed graph on $n$ nodes and with type law $\mu,$ we define the so-called spectral potential $\rho_{\lambda}(\,\cdot,\,\mu),$ of the graph.From the $\rho_{\lambda}(\,\cdot,\,\mu)$ we obtain Kullback action or the deviation function ...
Doku-Amponsah, Kwabena
core +1 more source
Subcritical graph classes containing all planar graphs [PDF]
, 2018 We construct minor-closed addable families of graphs that are subcritical and contain all planar graphs.
Georgakopoulos, Agelos, Wagner, Stephan
core +2 more sources
Zagreb connection indices on polyomino chains and random polyomino chains
Open MathematicsIn this manuscript, we delve into the exploration of the first and second Zagreb connection indices of both polyomino chains and random polyomino chains. Our methodology relies on the utilization of Markov chain theory. Within this framework, the article
Sigarreta Saylé, Cruz-Suárez Hugo
doaj +1 more source
The $(k,\ell)$-rainbow index of random graphs [PDF]
, 2013 A tree in an edge colored graph is said to be a rainbow tree if no two edges on the tree share the same color. Given two positive integers $k$, $\ell$ with $k\geq 3$, the \emph{$(k,\ell)$-rainbow index} $rx_{k,\ell}(G)$ of $G$ is the minimum number of ...
Cai, Qingqiong +2 more
core
Two-Point Concentration of the Independence Number of the Random Graph
Forum of Mathematics, SigmaWe show that the independence number of $ G_{n,p}$ is concentrated on two values if $ n^{-2/3+ \epsilon } < p \le 1$ . This result is roughly best possible as an argument of Sah and Sawhney shows that the independence number is not, in ...
Tom Bohman, Jakob Hofstad
doaj +1 more source
Cycles in Random Bipartite Graphs [PDF]
, 2013 In this paper we study cycles in random bipartite graph $G(n,n,p)$. We prove that if $p\gg n^{-2/3}$, then $G(n,n,p)$ a.a.s. satisfies the following. Every subgraph $G'\subset G(n,n,p)$ with more than $(1+o(1))n^2p/2$ edges contains a cycle of length $t$
Shang, Yilun
core
Sharp thresholds for Ramsey properties
Forum of Mathematics, SigmaIn this work, we develop a unified framework for establishing sharp threshold results for various Ramsey properties. To achieve this, we view such properties as noncolourability of auxiliary hypergraphs.
Ehud Friedgut +3 more
doaj +1 more source