Expected Maximum Block Size in Critical Random Graphs

2019 ◽  
Vol 28 (4) ◽  
pp. 638-655
Author(s):  
V. Rasendrahasina ◽  
A. Rasoanaivo ◽  
V. Ravelomanana
Keyword(s):  
Real Number ◽  
Random Graphs ◽  
Function Theory ◽  
Block Size ◽  
Maximum Size ◽  
Induced Subgraphs ◽  
Symbolic Method ◽  
Exact Analytic Expression ◽  
Analytic Expression ◽  
Image Position

AbstractLet G(n,M) be a uniform random graph with n vertices and M edges. Let ${\wp_{n,m}}$ be the maximum block size of G(n,M), that is, the maximum size of its maximal 2-connected induced subgraphs. We determine the expectation of ${\wp_{n,m}}$ near the critical point M = n/2. When n − 2M ≫ n2/3, we find a constant c1 such that $$c_1 = \lim_{n \rightarrow \infty} \left({1 - \frac{2M}{n}} \right) \,\E({\wp_{n,m}}).$$ Inside the window of transition of G(n,M) with M = (n/2)(1 + λn−1/3), where λ is any real number, we find an exact analytic expression for $$c_2(\lambda) = \lim_{n \rightarrow \infty} \frac{\E{\left({\wp_{n,{{(n/2)}({1+\lambda n^{-1/3}})}}}\right)}}{n^{1/3}}.$$ This study relies on the symbolic method and analytic tools from generating function theory, which enable us to describe the evolution of $n^{-1/3}\,\E{\left({\wp_{n,{{(n/2)}({1+\lambda n^{-1/3}})}}}\right)}$ as a function of λ.

scholarly journals ENERGY EXTRACTION FROM GRAVITATIONAL COLLAPSE TO STATIC BLACK HOLES

2003 ◽  
Vol 12 (01) ◽  
pp. 121-127 ◽  
Author(s):  
REMO RUFFINI ◽  
LUCA VITAGLIANO
Keyword(s):  
Black Holes ◽  
Black Hole ◽  
Extraction Process ◽  
Maximum Efficiency ◽  
Energy Extraction ◽  
Mass Energy ◽  
Classical Level ◽  
Static Black Hole ◽  
Exact Analytic Expression ◽  
Analytic Expression

The mass-energy formula of black holes implies that up to 50% of the energy can be extracted from a static black hole. Such a result is reexamined using the recently established analytic formulas for the collapse of a shell and the expression for the irreducible mass of a static black hole. It is shown that the efficiency of energy extraction process during the formation of the black hole is linked in an essential way to the gravitational binding energy, the formation of the horizon and the reduction of the kinetic energy of implosion. Here a maximum efficiency of 50% in the extraction of the mass energy is shown to be generally attainable in the collapse of a spherically symmetric shell: surprisingly this result holds as well in the two limiting cases of the Schwarzschild and extreme Reissner–Nordström space–times. Moreover, the analytic expression recently found for the implosion of a spherical shell to an already formed black hole leads to a new exact analytic expression for the energy extraction which results in an efficiency strictly less than 100% for any physical implementable process. There appears to be no incompatibility between General Relativity and Thermodynamics at this classical level.

scholarly journals Homogeneous orbit closures and applications

2011 ◽  
Vol 32 (2) ◽  
pp. 785-807 ◽  
Author(s):  
ELON LINDENSTRAUSS ◽  
URI SHAPIRA
Keyword(s):  
Real Number ◽  
Unit Volume ◽  
Orbit Closures ◽  
Image Position

AbstractWe give new classes of examples of orbits of the diagonal group in the space of unit volume lattices in ℝd for d≥3 with nice (homogeneous) orbit closures, as well as examples of orbits with explicitly computable but irregular orbit closures. We give Diophantine applications to the former; for instance, we show that, for all γ,δ∈ℝ, where 〈c〉 denotes the distance of a real number c to the integers.

scholarly journals Large Holes in Quasi-Random Graphs

10.37236/784 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Joanna Polcyn
Keyword(s):  
Random Graphs ◽  
Induced Subgraphs ◽  
Degree Condition ◽  
Almost All

Quasi-random graphs have the property that the densities of almost all pairs of large subsets of vertices are similar, and therefore we cannot expect too large empty or complete bipartite induced subgraphs in these graphs. In this paper we answer the question what is the largest possible size of such subgraphs. As an application, a degree condition that guarantees the connection by short paths in quasi-random pairs is stated.

Ballots, queues and random graphs

1989 ◽  
Vol 26 (1) ◽  
pp. 103-112 ◽  
Author(s):  
Lajos Takács
Keyword(s):  
Real Number ◽  
Random Graph ◽  
Random Graphs ◽  
Limit Distribution ◽  
Positive Real Number ◽  
Positive Real ◽  
Ballot Theorem

This paper demonstrates how a simple ballot theorem leads, through the interjection of a queuing process, to the solution of a problem in the theory of random graphs connected with a study of polymers in chemistry. Let Γn(p) denote a random graph with n vertices in which any two vertices, independently of the others, are connected by an edge with probability p where 0 < p < 1. Denote by ρ n(s) the number of vertices in the union of all those components of Γn(p) which contain at least one vertex of a given set of s vertices. This paper is concerned with the determination of the distribution of ρ n(s) and the limit distribution of ρ n(s) as n → ∞and ρ → 0 in such a way that np → a where a is a positive real number.

On colouring random graphs

1975 ◽  
Vol 77 (2) ◽  
pp. 313-324 ◽  
Author(s):  
G. R. Grimmett ◽  
C. J. H. McDiarmid
Keyword(s):  
Random Graph ◽  
Random Graphs ◽  
Complete Subgraph ◽  
Vertex Set ◽  
Image Position

AbstractLet ωn denote a random graph with vertex set {1, 2, …, n}, such that each edge is present with a prescribed probability p, independently of the presence or absence of any other edges. We show that the number of vertices in the largest complete subgraph of ωn is, with probability one,

scholarly journals An estimate for trigonometrical sums over square-free integers with a constant number of prime factors

1967 ◽  
Vol 15 (4) ◽  
pp. 249-255
Author(s):  
Sean Mc Donagh
Keyword(s):  
Positive Integer ◽  
Real Number ◽  
Prime Number ◽  
Rational Number ◽  
Large Integer ◽  
Constant Number ◽  
The Real ◽  
Prime Factors ◽  
Squarefree Number ◽  
Image Position

1. In deriving an expression for the number of representations of a sufficiently large integer N in the formwhere k: is a positive integer, s(k) a suitably large function of k and pi is a prime number, i = 1, 2, …, s(k), by Vinogradov's method it is necessary to obtain estimates for trigonometrical sums of the typewhere ω = l/k and the real number a satisfies 0 ≦ α ≦ 1 and is “near” a rational number a/q, (a, q) = 1, with “large” denominator q. See Estermann (1), Chapter 3, for the case k = 1 or Hua (2), for the general case. The meaning of “near” and “arge” is made clear below—Lemma 4—as it is necessary for us to quote Hua's estimate. In this paper, in Theorem 1, an estimate is obtained for the trigonometrical sumwhere α satisfies the same conditions as above and where π denotes a squarefree number with r prime factors. This estimate enables one to derive expressions for the number of representations of a sufficiently large integer N in the formwhere s(k) has the same meaning as above and where πri, i = 1, 2, …, s(k), denotes a square-free integer with ri prime factors.

AN EXACT FORMULA FOR THE HARMONIC CONTINUED FRACTION

2020 ◽  
pp. 1-11
Author(s):  
MARTIN BUNDER ◽  
PETER NICKOLAS ◽  
JOSEPH TONIEN
Keyword(s):  
Real Number ◽  
Continued Fraction ◽  
Positive Real Number ◽  
Exact Formula ◽  
Positive Real ◽  
Image Position

For a positive real number $t$ , define the harmonic continued fraction $$\begin{eqnarray}\text{HCF}(t)=\biggl[\frac{t}{1},\frac{t}{2},\frac{t}{3},\ldots \biggr].\end{eqnarray}$$ We prove that $$\begin{eqnarray}\text{HCF}(t)=\frac{1}{1-2t(\frac{1}{t+2}-\frac{1}{t+4}+\frac{1}{t+6}-\cdots \,)}.\end{eqnarray}$$

scholarly journals On Komlós’ tiling theorem in random graphs

2019 ◽  
Vol 29 (1) ◽  
pp. 113-127
Author(s):  
Rajko Nenadov ◽  
Nemanja Škorić
Keyword(s):  
Chromatic Number ◽  
Random Graph ◽  
Random Graphs ◽  
Upper Bound ◽  
Minimum Degree ◽  
Arbitrary Graph ◽  
Spanning Subgraph ◽  
Delta G ◽  
Image Position ◽  
Vertex Disjoint

AbstractGiven graphs G and H, a family of vertex-disjoint copies of H in G is called an H-tiling. Conlon, Gowers, Samotij and Schacht showed that for a given graph H and a constant γ>0, there exists C>0 such that if $p \ge C{n^{ - 1/{m_2}(H)}}$ , then asymptotically almost surely every spanning subgraph G of the random graph 𝒢(n, p) with minimum degree at least $\delta (G) \ge (1 - \frac{1}{{{\chi _{{\rm{cr}}}}(H)}} + \gamma )np$ contains an H-tiling that covers all but at most γn vertices. Here, χcr(H) denotes the critical chromatic number, a parameter introduced by Komlós, and m2(H) is the 2-density of H. We show that this theorem can be bootstrapped to obtain an H-tiling covering all but at most $\gamma {(C/p)^{{m_2}(H)}}$ vertices, which is strictly smaller when $p \ge C{n^{ - 1/{m_2}(H)}}$ . In the case where H = K3, this answers the question of Balogh, Lee and Samotij. Furthermore, for an arbitrary graph H we give an upper bound on p for which some leftover is unavoidable and a bound on the size of a largest H -tiling for p below this value.

Ballots, queues and random graphs

1989 ◽  
Vol 26 (01) ◽  
pp. 103-112 ◽  
Author(s):  
Lajos Takács
Keyword(s):  
Real Number ◽  
Random Graph ◽  
Random Graphs ◽  
Limit Distribution ◽  
Positive Real Number ◽  
Positive Real ◽  
Ballot Theorem

This paper demonstrates how a simple ballot theorem leads, through the interjection of a queuing process, to the solution of a problem in the theory of random graphs connected with a study of polymers in chemistry. Let Γ n (p) denote a random graph with n vertices in which any two vertices, independently of the others, are connected by an edge with probability p where 0 &lt; p &lt; 1. Denote by ρ n (s) the number of vertices in the union of all those components of Γ n (p) which contain at least one vertex of a given set of s vertices. This paper is concerned with the determination of the distribution of ρ n (s) and the limit distribution of ρ n (s) as n → ∞and ρ → 0 in such a way that np → a where a is a positive real number.

Eigenvalues of Finite Band-Width Hilbert Space Operators and Their Application to Orthogonal Polynomials

1989 ◽  
Vol 41 (1) ◽  
pp. 106-122 ◽  
Author(s):  
Attila Máté ◽  
Paul Nevai
Keyword(s):  
Hilbert Space ◽  
Orthogonal Polynomials ◽  
Real Number ◽  
Main Diagonal ◽  
Band Width ◽  
Positive Part ◽  
Hilbert Space Operators ◽  
Image Position ◽  
Finite Band

The main result of this paper concerns the eigenvalues of an operator in the Hilbert space l2that is represented by a matrix having zeros everywhere except in a neighborhood of the main diagonal. Write (c)+ for the positive part of a real number c, i.e., put (c+ = cif c≧ 0 and (c)+=0 otherwise. Then this result can be formulated as follows. Theorem 1.1. Let k ≧ 1 be an integer, and consider the operator S on l2 such that

Sign in / Sign up

Export Citation Format

Share Document