Results 21 to 30 of about 1,190 (81)
High-Precision Entropy Values for Spanning Trees in Lattices
, 2003 Shrock and Wu have given numerical values for the exponential growth rate of the number of spanning trees in Euclidean lattices. We give a new technique for numerical evaluation that gives much more precise values, together with rigorous bounds on the ...
Ball K +11 more
core +1 more source
EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
Forum of Mathematics, Sigma, 2015 Let $p(k)$ denote the partition function of $k$. For each $k\geqslant 2$, we describe a list of $p(k)-1$ quasirandom properties that a $k$-uniform hypergraph can have. Our work connects previous notions on linear hypergraph quasirandomness by Kohayakawa,
JOHN LENZ, DHRUV MUBAYI
doaj +1 more source
TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
Forum of Mathematics, Sigma, 2015 For natural numbers $n,r\in \mathbb{N}$ with $n\geqslant r$, the Kneser graph $K(n,r)$ is the graph on the family of $r$-element subsets of $\{1,\ldots ,n\}$ in which two sets are adjacent if and only if they are disjoint.
JÓZSEF BALOGH +2 more
doaj +1 more source
Connectivity of inhomogeneous random graphs [PDF]
, 2012 We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c log n/n.
Devroye, Luc, Fraiman, Nicolas
core +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
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
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
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