scholarly journals A Study on f Number of Points for Number of Points with Inter-Distance of Less Than, or for Number of Points with Inter-Distance of or More to Necessarily Exist on Plane

2018 ◽  
Author(s):  
Benjamin Smith
Keyword(s):  
Upper Bound ◽  
Ramsey Number ◽  
Minimum Value ◽  
Special Case

We defined number of points with an inter-distance of β or more to necessarily exist on a plane. Furthermore, we aimed to reduce the range of this minimum value. We first showed that the upper bound of this value could be scaled by , and further reduced the constant that was multiplied. We compared the upper bound of and the Ramsey number in a special case and confirmed that was a better upper bound than except when were both small or trivial.

Poisson approximation for (k1, k2)-events via the Stein-Chen method

2004 ◽  
Vol 41 (4) ◽  
pp. 1081-1092 ◽  
Author(s):  
P. Vellaisamy
Keyword(s):  
Limit Theorem ◽  
Rate Of Convergence ◽  
Upper Bound ◽  
Success Probability ◽  
Random Variable ◽  
Poisson Approximation ◽  
Bernoulli Trials ◽  
Poisson Random Variable ◽  
Markov Dependent Trials ◽  
Special Case

Consider a sequence of independent Bernoulli trials with success probability p. Let N(n; k1, k2) denote the number of times that k1 failures are followed by k2 successes among the first n Bernoulli trials. We employ the Stein-Chen method to obtain a total variation upper bound for the rate of convergence of N(n; k1, k2) to a suitable Poisson random variable. As a special case, the corresponding limit theorem is established. Similar results are obtained for Nk3(n; k1, k2), the number of times that k1 failures followed by k2 successes occur k3 times successively in n Bernoulli trials. The bounds obtained are generally sharper than, and improve upon, some of the already known results. Finally, the technique is adapted to obtain Poisson approximation results for the occurrences of the above-mentioned events under Markov-dependent trials.

On norm of single layer potentials on segments

2016 ◽  
Vol 22 (1) ◽  
Author(s):  
Seyed M. Zoalroshd
Keyword(s):  
Upper Bound ◽  
Single Layer ◽  
Exact Expression ◽  
Operator Norm ◽  
Equal Length ◽  
Layer Potentials ◽  
Schmidt Norm ◽  
Special Case

AbstractWe show that, for a special case, equality of the spectra of single layer potentials defined on two segments implies that these segments must have equal length. We also provide an upper bound for the operator norm and exact expression for the Hilbert–Schmidt norm of single layer potentials on segments.

scholarly journals Every Local Minimum Value Is the Global Minimum Value of Induced Model in Nonconvex Machine Learning

2019 ◽  
Vol 31 (12) ◽  
pp. 2293-2323 ◽  
Author(s):  
Kenji Kawaguchi ◽  
Jiaoyang Huang ◽  
Leslie Pack Kaelbling
Keyword(s):  
Machine Learning ◽  
Neural Networks ◽  
Local Minimum ◽  
Deep Neural Networks ◽  
Representation Learning ◽  
Minimum Value ◽  
Special Cases ◽  
Optimal Value ◽  
Special Case ◽  
Theoretical Results

For nonconvex optimization in machine learning, this article proves that every local minimum achieves the globally optimal value of the perturbable gradient basis model at any differentiable point. As a result, nonconvex machine learning is theoretically as supported as convex machine learning with a handcrafted basis in terms of the loss at differentiable local minima, except in the case when a preference is given to the handcrafted basis over the perturbable gradient basis. The proofs of these results are derived under mild assumptions. Accordingly, the proven results are directly applicable to many machine learning models, including practical deep neural networks, without any modification of practical methods. Furthermore, as special cases of our general results, this article improves or complements several state-of-the-art theoretical results on deep neural networks, deep residual networks, and overparameterized deep neural networks with a unified proof technique and novel geometric insights. A special case of our results also contributes to the theoretical foundation of representation learning.

scholarly journals Analysis of Ring Compression Test by Upper Bound Theorem as Special Case of Non-symmetric Part

2015 ◽  
Vol 132 ◽  
pp. 334-341 ◽  
Author(s):  
A. Moncada ◽  
F. Martín ◽  
L. Sevilla ◽  
A.M. Camacho ◽  
M.A. Sebastián
Keyword(s):  
Compression Test ◽  
Upper Bound ◽  
Symmetric Part ◽  
Ring Compression Test ◽  
Upper Bound Theorem ◽  
Ring Compression ◽  
Bound Theorem ◽  
Special Case

scholarly journals TESTING EMBEDDABILITY BETWEEN METRIC SPACES

2009 ◽  
Vol 20 (02) ◽  
pp. 313-329
Author(s):  
CHING-LUEH CHANG ◽  
YUH-DAUH LYUU ◽  
YEN-WU TI
Keyword(s):  
Metric Space ◽  
Upper Bound ◽  
Metric Spaces ◽  
Graph Isomorphism ◽  
Upper And Lower Bounds ◽  
Wrong Answer ◽  
Probability Of Error ◽  
Finite Metric Space ◽  
Finite Metric Spaces ◽  
Special Case

Let L ≥ 1, ε > 0 be real numbers, (M, d) be a finite metric space and (N, ρ) be a metric space. A query to a metric space consists of a pair of points and asks for the distance between these points. We study the number of queries to metric spaces (M, d) and (N, ρ) needed to decide whether (M, d) is L-bilipschitz embeddable into (N, ρ) or ∊-far from being L-bilipschitz embeddable into N, ρ). When (M, d) is ∊-far from being L-bilipschitz embeddable into (N, ρ), we allow an o(1) probability of error (i.e., returning the wrong answer "L-bilipschitz embeddable"). However, no error is allowed when (M, d) is L-bilipschitz embeddable into (N, ρ). That is, algorithms with only one-sided errors are studied in this paper. When |M| ≤ |N| are both finite, we give an upper bound of [Formula: see text] on the number of queries for determining with one-sided error whether (M, d) is L-bilipschitz embeddable into (N, ρ) or ∊-far from being L-bilipschitz embeddable into (N, ρ). For the special case of finite |M| = |N|, the above upper bound evaluates to [Formula: see text]. We also prove a lower bound of Ω(|N|3/2) for the special case when |M| = |N| are finite and L = 1, which coincides with testing isometry between finite metric spaces. For finite |M| = |N|, the upper and lower bounds thus match up to a multiplicative factor of at most [Formula: see text], which depends only sublogarithmically in |N|. We also investigate the case when (N, ρ) is not necessarily finite. Our results are based on techniques developed in an earlier work on testing graph isomorphism.

scholarly journals On Partitioning and Packing Products with Rectangles

1994 ◽  
Vol 3 (4) ◽  
pp. 429-434 ◽  
Author(s):  
Rudolf Ahlswede ◽  
Ning Cai
Keyword(s):  
Upper Bound ◽  
Complete Graphs ◽  
Minimal Size ◽  
Uniform Hypergraphs ◽  
Image Position ◽  
Special Case

In [1] we introduced and studied for product hypergraphs where ℋi = (i,ℰi), the minimal size π(ℋn) of a partition of into sets that are elements of . The main result was thatif the ℋis are graphs with all loops included. A key step in the proof concerns the special case of complete graphs. Here we show that (1) also holds when the ℋi are complete d-uniform hypergraphs with all loops included, subject to a condition on the sizes of the i. We also present an upper bound on packing numbers.

scholarly journals Collision-avoidance and flocking in the Cucker–Smale-type model with a discontinuous controller

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Jianfei Cheng ◽  
Xiao Wang ◽  
Yicheng Liu
Keyword(s):  
Weight Function ◽  
Collision Avoidance ◽  
Upper Bound ◽  
Finite Time ◽  
Relative Velocity ◽  
Sufficient Conditions ◽  
Repulsive Force ◽  
Type Model ◽  
Movement Tendency ◽  
Special Case

<p style='text-indent:20px;'>The collision-avoidance and flocking of the Cucker–Smale-type model with a discontinuous controller are studied. The controller considered in this paper provides a force between agents that switches between the attractive force and the repulsive force according to the movement tendency between agents. The results of collision-avoidance are closely related to the weight function <inline-formula><tex-math id="M1">\begin{document}$ f(r) = (r-d_0)^{-\theta } $\end{document}</tex-math></inline-formula>. For <inline-formula><tex-math id="M2">\begin{document}$ \theta \ge 1 $\end{document}</tex-math></inline-formula>, collision will not appear in the system if agents' initial positions are different. For the case <inline-formula><tex-math id="M3">\begin{document}$ \theta \in [0,1) $\end{document}</tex-math></inline-formula> that not considered in previous work, the limits of initial configurations to guarantee collision-avoidance are given. Moreover, on the basis of collision-avoidance, we point out the impacts of <inline-formula><tex-math id="M4">\begin{document}$ \psi (r) = (1+r^2)^{-\beta } $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M5">\begin{document}$ f(r) $\end{document}</tex-math></inline-formula> on the flocking behaviour and give the decay rate of relative velocity. We also estimate the lower and upper bound of distance between agents. Finally, for the special case that agents moving on the 1-D space, we give sufficient conditions for the finite-time flocking.</p>

scholarly journals A Note on Edge-Colourings Avoiding Rainbow $K_4$ and Monochromatic $K_m$

10.37236/257 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Veselin Jungić ◽  
Tomáš Kaiser ◽  
Daniel Král'
Keyword(s):  
Lower Bound ◽  
Complete Graph ◽  
Upper Bound ◽  
Projective Planes ◽  
Ramsey Number ◽  
Complete Subgraph ◽  
Finite Projective Planes ◽  
Edge Colourings ◽  
Edge Colouring

We study the mixed Ramsey number $maxR(n,{K_m},{K_r})$, defined as the maximum number of colours in an edge-colouring of the complete graph $K_n$, such that $K_n$ has no monochromatic complete subgraph on $m$ vertices and no rainbow complete subgraph on $r$ vertices. Improving an upper bound of Axenovich and Iverson, we show that $maxR(n,{K_m},{K_4}) \leq n^{3/2}\sqrt{2m}$ for all $m\geq 3$. Further, we discuss a possible way to improve their lower bound on $maxR(n,{K_4},{K_4})$ based on incidence graphs of finite projective planes.

scholarly journals A Note on Odd Cycle-Complete Graph Ramsey Numbers

10.37236/1662 ◽  
2001 ◽  
Vol 9 (1) ◽  
Author(s):  
Benny Sudakov
Keyword(s):  
Positive Integer ◽  
Complete Graph ◽  
Upper Bound ◽  
Short Note ◽  
Ramsey Number ◽  
Ramsey Numbers ◽  
Odd Cycle

The Ramsey number $r(C_l, K_n)$ is the smallest positive integer $m$ such that every graph of order $m$ contains either cycle of length $l$ or a set of $n$ independent vertices. In this short note we slightly improve the best known upper bound on $r(C_l, K_n)$ for odd $l$.

Sign in / Sign up

Export Citation Format

Share Document