scholarly journals When is non-trivial estimation possible for graphons and stochastic block models?‡

2017 ◽  
Vol 7 (2) ◽  
pp. 169-181
Author(s):  
Audra McMillan ◽  
Adam Smith
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Upper Bound ◽  
Upper And Lower Bounds ◽  
Random Networks ◽  
Block Models

Abstract Block graphons (also called stochastic block models) are an important and widely studied class of models for random networks. We provide a lower bound on the accuracy of estimators for block graphons with a large number of blocks. We show that, given only the number $k$ of blocks and an upper bound $\rho$ on the values (connection probabilities) of the graphon, every estimator incurs error ${\it{\Omega}}\left(\min\left(\rho, \sqrt{\frac{\rho k^2}{n^2}}\right)\right)$ in the $\delta_2$ metric with constant probability for at least some graphons. In particular, our bound rules out any non-trivial estimation (that is, with $\delta_2$ error substantially less than $\rho$) when $k\geq n\sqrt{\rho}$. Combined with previous upper and lower bounds, our results characterize, up to logarithmic terms, the accuracy of graphon estimation in the $\delta_2$ metric. A similar lower bound to ours was obtained independently by Klopp et al.

scholarly journals On the Rank of $p$-Schemes

10.37236/3097 ◽  
2013 ◽  
Vol 20 (2) ◽  
Author(s):  
Fateme Raei Barandagh ◽  
Amir Rahnamai Barghi
Keyword(s):  
Lower Bound ◽  
Prime Number ◽  
Lower Bounds ◽  
Upper Bound ◽  
Upper And Lower Bounds ◽  
Minimum Rank

Let $n>1$ be an integer and $p$ be a prime number. Denote by $\mathfrak{C}_{p^n}$ the class of non-thin association $p$-schemes of degree $p^n$. A sharp upper and lower bounds on the rank of schemes in $\mathfrak{C}_{p^n}$ with a certain order of thin radical are obtained. Moreover, all schemes in this class whose rank are equal to the lower bound are characterized and some schemes in this class whose rank are equal to the upper bound are constructed. Finally, it is shown that the scheme with minimum rank in $\mathfrak{C}_{p^n}$ is unique up to isomorphism, and it is a fusion of any association $p$-schemes with degree $p^n$.

scholarly journals ON THE POSSIBLE RANKS AMONG MATRICES WITH A GIVEN PATTERN

2010 ◽  
Vol 02 (03) ◽  
pp. 363-377 ◽  
Author(s):  
CHARLES R. JOHNSON ◽  
YULIN ZHANG
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Upper Bound ◽  
Null Space ◽  
Upper And Lower Bounds ◽  
Minimum Rank

Given are tight upper and lower bounds for the minimum rank among all matrices with a prescribed zero–nonzero pattern. The upper bound is based upon solving for a matrix with a given null space and, with optimal choices, produces the correct minimum rank. It leads to simple, but often accurate, bounds based upon overt statistics of the pattern. The lower bound is also conceptually simple. Often, the lower and an upper bound coincide, but examples are given in which they do not.

BOUNDS ON THE PRICE OF STABILITY OF UNDIRECTED NETWORK DESIGN GAMES WITH THREE PLAYERS

2011 ◽  
Vol 12 (01n02) ◽  
pp. 1-17 ◽  
Author(s):  
VITTORIO BILÒ ◽  
ROBERTA BOVE
Keyword(s):  
Lower Bound ◽  
Network Design ◽  
Lower Bounds ◽  
Upper Bound ◽  
Cost Allocation ◽  
Upper And Lower Bounds ◽  
Price Of Stability ◽  
Undirected Network ◽  
Basic Case

After almost seven years from its definition,2 the price of stability of undirected network design games with fair cost allocation remains to be elusive. Its exact characterization has been achieved only for the basic case of two players2,7 and, as soon as the number of players increases, the gap between the known upper and lower bounds becomes super-constant, even in the special variants of multicast and broadcast games. Motivated by the intrinsic difficulties that seem to characterize this problem, we analyze the already challenging case of three players and provide either new or improved bounds. For broadcast games, we prove an upper bound of 1.485 which exactly matches a lower bound given in Ref. 4; for multicast games, we show new upper and lower bounds which confine the price of stability in the interval [1.524; 1.532]; while, for the general case, we give an improved upper bound of 1.634. The techniques exploited in this paper are a refinement of those used in Ref. 7 and can be easily adapted to deal with all the cases involving a small number of players.

Lower bounds to eigenvalues

1969 ◽  
Vol 47 (17) ◽  
pp. 1877-1879 ◽  
Author(s):  
Maurice Cohen ◽  
Tova Feldmann
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Upper Bound ◽  
Hamiltonian Operator ◽  
Upper And Lower Bounds ◽  
Quantum Mechanical ◽  
Classical Procedure ◽  
Ritz Procedure ◽  
Reasonable Choice ◽  
Lowest Eigenvalue

The classical procedure of Weinstein has been employed to obtain rigorous upper and lower bounds to the eigenvalues E of a quantum mechanical Hamiltonian operator H. The new bounds represent an improvement over Weinstein's bounds for any reasonable choice of variational trial function. In the case of the lowest eigenvalue E0, for which the Rayleigh–Ritz procedure gives the optimum upper bound, the new lower bound is an improvement over the lower bound formula of Stevenson and Crawford.

Complementary variational principles in perturbation theory

1968 ◽  
Vol 303 (1475) ◽  
pp. 503-509 ◽  
Keyword(s):  
Perturbation Theory ◽  
Lower Bound ◽  
Harmonic Oscillator ◽  
Lower Bounds ◽  
Upper Bound ◽  
Variational Principles ◽  
Upper And Lower Bounds ◽  
Quantum Mechanical ◽  
Simple Application ◽  
Mechanical Perturbation

Complementary upper and lower bounds are derived for second-order quantum-mechanical perturbation energies. The upper bound is equivalent to that of Hylleraas. The lower bound appears to be new, but reduces to that of Prager & Hirschfelder if a certain constraint is applied. A simple application to a perturbed harmonic oscillator is presented.

scholarly journals Maximal prime gaps bounds

2021 ◽  
Author(s):  
Jan Feliksiak
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Upper Bound ◽  
Estimation Error ◽  
The Other ◽  
Upper And Lower Bounds ◽  
Close Approximation ◽  
Implicit Constant ◽  
Error Cost ◽  
Prime Gaps

This paper presents research results, pertinent to the maximal prime gaps bounds. Four distinct bounds are presented: Upper bound, Infimum, Supremum and finally the Lower bound. Although the Upper and Lower bounds incur a relatively high estimation error cost, the functions representing them are quite simple. This ensures, that the computation of those bounds will be straightforward and efficient. The Lower bound is essential, to address the issue of the value of the lower bound implicit constant C, in the work of Ford et al (Ford, 2016). The concluding Corollary in this paper shows, that the value of the constant C does diverge, although very slowly. The constant C, will eventually take any arbitrary value, providing that a large enough N (for p <= N) is considered. The Infimum/Supremum bounds on the other hand are computationally very demanding. Their evaluation entails computations at an extreme level of precision. In return however, we obtain bounds, which provide an extremely close approximation of the maximal prime gaps. The Infimum/Supremum estimation error gradually increases over the range of p and attains at p = 18361375334787046697 approximately the value of 0.03.

A Quantitative Model of Cellular Elasticity Based on Tensegrity

1999 ◽  
Vol 122 (1) ◽  
pp. 39-43 ◽  
Author(s):  
Dimitrije Stamenovic´ ◽  
Mark F. Coughlin
Keyword(s):  
Lower Bound ◽  
Young’S Modulus ◽  
Lower Bounds ◽  
Upper Bound ◽  
Young's Modulus ◽  
Quantitative Model ◽  
Upper And Lower Bounds ◽  
Probe Diameter ◽  
Critical Buckling Force ◽  
Yield Force

A tensegrity structure composed of six struts interconnected with 24 elastic cables is used as a quantitative model of the steady-state elastic response of cells, with the struts and cables representing microtubules and actin filaments, respectively. The model is stretched uniaxially and the Young’s modulus E0 is obtained from the initial slope of the stress versus strain curve of an equivalent continuum. It is found that E0 is directly proportional to the pre-existing tension in the cables (or compression in the struts) and inversely proportional to the cable (or strut) length square. This relationship is used to predict the upper and lower bounds of E0 of cells, assuming that the cable tension equals the yield force of actin (∼400 pN) for the upper bound, and that the strut compression equals the critical buckling force of microtubules for the lower bound. The cable (or strut) length is determined from the assumption that model dimensions match the diameter of probes used in standard mechanical tests on cells. Predicted values are compared to reported data for the Young’s modulus of various cells. If the probe diameter is greater than or equal to 3 μm, these data are closer to the lower bound than to the upper bound. This, in turn, suggests that microtubules of the CSK carry initial compression that exceeds their critical buckling force (order of 100-101 pN), but is much smaller than the yield force of actin. If the probe diameter is less than or equal to 2 μm, experimental data fall outside the region defined by the upper and lower bounds. [S0148-0731(00)00101-1]

Topographic waves in open domains. Part 1. Boundary conditions and frequency estimates

1989 ◽  
Vol 200 ◽  
pp. 69-76 ◽  
Author(s):  
E. R. Johnson
Keyword(s):  
Variational Principle ◽  
Lower Bound ◽  
Boundary Conditions ◽  
Lower Bounds ◽  
Mass Flux ◽  
Upper Bound ◽  
Normal Modes ◽  
Upper And Lower Bounds ◽  
Open Boundary ◽  
Depth Gradients

The problem is considered of topographic waves propagating on depth gradients in rotating domains. A variational principle is derived for the eigenfunctions and eigenfrequencies of normal modes on a domain, and applied to subdomains of the whole domain. Considering suitable boundary conditions on the open boundary between the subdomain and the remainder of the whole domain gives upper and lower bounds and estimates for the frequencies of normal modes localized in the subdomain without the complication of solving over the whole domain. It is shown that applying a zero-mass-flux condition at the open boundary leads to a lower bound on the frequency whereas requiring a particular form of the energy flux to vanish identically at each point of the boundary provides an upper bound.

scholarly journals Inequalities for the Minimum Eigenvalue of Doubly Strictly Diagonally DominantM-Matrices

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Ming Xu ◽  
Suhua Li ◽  
Chaoqian Li
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Upper Bound ◽  
Upper And Lower Bounds ◽  
Matrix Inequalities ◽  
Minimum Eigenvalue ◽  
Minimal Eigenvalue ◽  
Diagonally Dominant ◽  
Linear Differential ◽  
New Inequalities

LetAbe a doubly strictly diagonally dominantM-matrix. Inequalities on upper and lower bounds for the entries of the inverse ofAare given. And some new inequalities on the lower bound for the minimal eigenvalue ofAand the corresponding eigenvector are presented to establish an upper bound for theL1-norm of the solutionx(t)for the linear differential systemdx/dt=-Ax(t),x(0)=x0>0.

Upper and lower bounds for the torsional stiffness of a prismatic bar

1972 ◽  
Vol 328 (1573) ◽  
pp. 295-299 ◽  
Keyword(s):  
Lower Bound ◽  
Cross Section ◽  
Lower Bounds ◽  
Upper Bound ◽  
Variational Principles ◽  
Circular Cross Section ◽  
Torsional Stiffness ◽  
Upper And Lower Bounds ◽  
Steady Creep

Upper and lower bounds for the torsional stiffness of a prismatic bar in steady creep are derived in a unified manner from the theory of complementary variational principles. The lower bound is known in the literature, but the upper bound appears to be new. The results are illustrated with calculations for a bar with circular cross-section.

Sign in / Sign up

Export Citation Format

Share Document