Related papers: On some recent selective properties involving netw…
In this paper, we show that the existence of certain first-countable compact-like extensions is equivalent to the equality between corresponding cardinal characteristics of the continuum. For instance, $\mathfrak b=\mathfrak s=\mathfrak c$…
How can we model networks with a mathematically tractable model that allows for rigorous analysis of network properties? Networks exhibit a long list of surprising properties: heavy tails for the degree distribution; small diameters; and…
Noncommutative spectral geometry offers a purely geometric explanation for the standard model of strong and electroweak interactions, including a geometric explanation for the origin of the Higgs field. Within this framework, the…
We consider $\text{\rm II}_1$ factors $L_\mu(G)$ arising from 2-cocyles $\mu \in \text{\rm H}^2(G,\Bbb T)$ on groups $G$ containing infinite normal subgroups $H \subset G$ with the relative property $\text{\rm(T)}$ (i.e. $G$ {\it w-rigid}).…
There is a growing use of neural network classifiers as unbinned, high-dimensional (and variable-dimensional) reweighting functions. To date, the focus has been on marginal reweighting, where a subset of features are used for reweighting…
We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…
Motivated by applications to the study of stochastic processes, we introduce a new analysis of positive definite kernels $K$, their reproducing kernel Hilbert spaces (RKHS), and an associated family of feature spaces that may be chosen in…
We study the problem of extracting a selective connector for a given set of query vertices $Q \subseteq V$ in a graph $G = (V,E)$. A selective connector is a subgraph of $G$ which exhibits some cohesiveness property, and contains the query…
Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…
Let $R$ be a commutative ring. In \cite{KK_2025(1)}, the authors introduced $R$-weighted graphs as a tool for studying commutators in groups and Lie algebras. These graphs are equivalent to a system of balance equations, and their…
Black-hole (BH) binaries with single-BH masses m=5--20 Msun, moving on quasicircular orbits, are among the most promising sources for first-generation ground-based gravitational-wave (GW) detectors. Until now, the development of…
Highly-repetitive collections of strings are increasingly being amassed by genome sequencing and genetic variation experiments, as well as by storing all versions of human-generated files, like webpages and source code. Existing indexes for…
We study the computational content of the Radon-Nokodym theorem from measure theory in the framework of the representation approach to computable analysis. We define computable measurable spaces and canonical representations of the measures…
A space $X$ is strongly $Y$-selective (resp., $Y$-selective) if every lower semicontinuous mapping from $Y$ to the nonempty subsets (resp., nonempty closed subsets) of $X$ has a continuous selection. We also call $X$ (strongly)…
We use the recently released cosmic chronometer data and the latest measured value of the local Hubble parameter, combined with the latest joint light curves of Supernovae Type Ia, and Baryon Acoustic Oscillation distance measurements, in…
The statistical significance of network properties is conditioned on null models which satisfy spec- ified properties but that are otherwise random. Exponential random graph models are a principled theoretical framework to generate such…
The spectrum of network is an important tool to study the function and dynamic properties of network, and graph operation and product is an effective mechanism to construct a specific local and global topological structure. In this study, a…
We develop a general theory for irreducible homogeneous spaces $M= G/H$, in relation to the nullity $\nu$ of their curvature tensor. We construct natural invariant (different and increasing) distributions associated with the nullity, that…
This paper introduces a new and ubiquitous framework for establishing achievability results in \emph{network information theory} (NIT) problems. The framework uses random binning arguments and is based on a duality between channel and…
In this paper we introduce the class of weak Heyting Brouwer algebras (WHB-algebras, for short). We extend the well known duality between distributive lattices and Priestley spaces, in order to exhibit a relational Priestley-like duality…