Related papers: Metric Graphs with Totally Disconnected Boundary
Metric spaces are a fundamental component of mathematics and have a paramount importance as a framework for measuring distance. They can be found in many different branches of mathematics, such as analysis and topology. This paper offers an…
Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…
We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
Let $G = (V,E)$ be a connected graph. A probability measure $\mu$ on $V$ is called "balanced" if it has the following property: if $T_\mu(v)$ denotes the "earth mover's" cost of transporting all the mass of $\mu$ from all over the graph to…
We study the spectrum of complete noncompact manifolds with bounded curvature and positive injectivity radius. We give general conditions which imply that their essential spectrum has an arbitrarily large finite number of gaps. In…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We study semifinite harmonic functions on arbitrary branching graphs. We give a detailed exposition of an algebraic method which allows one to classify semifinite indecomposable harmonic functions on some multiplicative branching graphs.…
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that,…
Metrizable spaces are studied in which every closed set is an $\alpha$-limit set for some continuous map and some point. It is shown that this property is enjoyed by every space containing sufficiently many arcs (formalized in the notion of…
We consider an elliptic problem with nonlinear boundary condition involving nonlinearity with superlinear and subcritical growth at infinity and a bifurcation parameter as a factor. We use re-scaling method, degree theory and continuation…
Nonstandard graphs have been defined and examined in prior works. The present work does the same for nonstandard digraphs. Since digraphs have more structure than do graphs, the present discussion requires more complicated definitions and…
For elliptic systems with block structure in the upper half-space and t-independent coefficients, we settle the study of boundary value problems by proving compatible well-posedness of Dirichlet, regularity and Neumann problems in optimal…
Our work builds on known results for k-uniform hypergraphs including the existence of limits, a Regularity Lemma and a Removal Lemma. Our main tool here is a theory of measures on ultraproduct spaces which establishes a correspondence…
R. M. Brown's theorem on mixed Dirichlet and Neumann boundary conditions is extended in two ways for the special case of polyhedral domains. A (1) more general partition of the boundary into Dirichlet and Neumann sets is used on (2)…
In graph-based applications, a common task is to pinpoint the most important or ``central'' vertex in a (directed or undirected) graph, or rank the vertices of a graph according to their importance. To this end, a plethora of so-called…
We are interested in evolution phenomena on star-like networks composed of several branches which vary considerably in physical properties. The initial boundary value problem for singularly perturbed hyperbolic differential equation on a…
We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…
In this paper we propose and study a class of simple, nonparametric, yet interpretable measures of association between two random variables $X$ and $Y$ taking values in general topological spaces. These nonparametric measures -- defined…
We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…