Related papers: Nonstandard Analysis of Graphs
In this note we study the eigenvalue growth of infinite graphs with discrete spectrum. We assume that the corresponding Dirichlet forms satisfy certain Sobolev-type inequalities and that the total measure is finite. In this sense, the…
In this paper we further develop the theory of one sided shift spaces over infinite alphabets, characterizing one-step shifts as edge shifts of ultragraphs and partially answering a conjecture regarding shifts of finite type (we show that…
We establish geometric relationships between the average scale-invariant Cassinian metric and other hyperbolic type metrics. In addition, we study the local convexity properties of the scale-invariant metric balls in Euclidean once…
In this paper we consider nonnegatively curved finite dimensional Alexandrov spaces with a non-collapsing condition, i.e., such that unit balls have volumes uniformly bounded from below away from zero. We study the relation between the…
We consider a Random Graph Model on $\mathbb{Z}^{d}$ that incorporates the interplay between the statistics of the graph and the underlying space where the vertices are located. Based on a graphical construction of the model as the…
Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, diameter and girth of these linearized Wenger graphs are…
Geodesic balls in a simply connected space forms $\mathbb{S}^n$, $\mathbb{R}^{n}$ or $\mathbb{H}^{n}$ are distinguished manifolds for comparison in bounded Riemannian geometry. In this paper we show that they have the maximum possible…
We prove a randomized version of the generalized Urysohn inequality relating mean-width to the other intrinsic volumes. To do this, we introduce a stochastic approximation procedure that sees each convex body K as the limit of intersections…
We study the logical properties of infinite geometric random graphs, introduced by Bonato and Janssen. These are graphs whose vertex set is a dense ``generic'' subset of a metric space, where two vertices are adjacent with probability $p>0$…
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…
A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its…
Volume of metric balls relates to rate-distortion theory and packing bounds on codes. In this paper, the volume of balls in complex Grassmann manifolds is evaluated for an arbitrary radius. The ball is defined as a set of hyperplanes of a…
We prove properties of extremal graphs of girth 5 and order 20 <=v <= 32. In each case we identify the possible minimum and maximum degrees, and in some cases prove the existence of (non-trivial) embedded stars. These proofs allow for…
An attempt is made to extend some of the basic paradigms of dynamics, from the viewpoint of (continuous) flows, to non-metric manifolds.
Kinematic algebras can be realised on geometric spaces and constrain the physical models that can live on these spaces. Different types of kinematic algebras exist and we consider the interplay of these algebras for non-relativistic limits…
We prove that an open manifold with nonnegative Ricci curvature, linear volume growth and noncollapsed ends always splits off a line at infinity. This completes the final step to prove the existence of isoperimetric sets given large volumes…
Graph Anomaly Detection (GAD) has recently become a hot research spot due to its practicability and theoretical value. Since GAD emphasizes the application and the rarity of anomalous samples, enriching the varieties of its datasets is…
Visual insights into a wide variety of statistical methods, for both didactic and data analytic purposes, can often be achieved through geometric diagrams and geometrically based statistical graphs. This paper extols and illustrates the…
We survey geometric properties which imply the stochastic incompleteness of the minimal diffusion process associated to the Laplacian on manifolds and graphs. In particular, we completely characterize stochastic incompleteness for…
This paper has dual aims. First is to develop practical universal coding methods for unlabeled graphs. Second is to use these for graph anomaly detection. The paper develops two coding methods for unlabeled graphs: one based on the degree…