Related papers: Upper Bound for Permanent Saturation of Metric Gra…
We prove distributional limit theorems (conditional and integrated) for the occupation times of certain weakly mixing, pointwise dual ergodic transformations at "tied-down" times immediately after "excursions". The limiting random variables…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
We introduce and study VERSs (vertex and edge replacement systems) as a technology of graph expansions. We consider its history graph, an augmented tree that records each graph expansion, and we provide sufficient conditions under which it…
We study the maximum matching problem in fully dynamic graphs: a graph is undergoing both edge insertions and deletions, and the goal is to efficiently maintain a large matching after each edge update. This problem has received considerable…
The tight upper bound $\operatorname{pt}_+(G) \leq \left\lceil \frac{\left\vert \operatorname{V}(G) \right\vert - \operatorname{Z}_+(G)}{2} \right\rceil$ is established for the positive semidefinite propagation time of a graph in terms of…
Electromagnetic information theory (EIT) is an interdisciplinary subject that serves to integrate deterministic electromagnetic theory with stochastic Shannon's information theory. Existing EIT analysis operates in the continuous space…
Given positive integer $n$ and graph $F$, the saturation number $\mathrm{sat}(n, F)$ is the minimum number of edges in an edge-maximal $F$-free graph on $n$ vertices. In this paper, we determine asymptotic behavior of $\mathrm{sat}(n, F)$…
We introduce a new technique for bounding the cover time of random walks by relating it to the runtime of randomized broadcast. In particular, we strongly confirm for dense graphs the intuition of Chandra et al. \cite{CRRST97} that "the…
In graph analysis, a classic task consists in computing similarity measures between (groups of) nodes. In latent space random graphs, nodes are associated to unknown latent variables. One may then seek to compute distances directly in the…
This paper presents an approach to study initial-boundary value (IBV) problems for integrable nonlinear differential-difference equations (DDEs) posed on a graph. As an illustrative example, we consider the Ablowitz-Ladik system posed on a…
In this paper we present a general procedure that allows for the reduction or expansion of any network (considered as a weighted graph). This procedure maintains the spectrum of the network's adjacency matrix up to a set of eigenvalues…
Let $G=(V,E)$ be a complete $n$-vertex graph with distinct positive edge weights. We prove that for $k\in\{1,2,...,n-1\}$, the set consisting of the edges of all minimum spanning trees (MSTs) over induced subgraphs of $G$ with $n-k+1$…
We consider the problem of sampling a bipartite graph with given vertex degrees where a set $F$ of edges and non-edges which need to be contained is predefined. Our general result shows that the repeated swap of edges and non-edges in…
In the present work, a new time-dependent exchange theory is presented wherein the symmetry constraints, on a multi-electron wavefunction, are properly accounted for. In so doing, the equations of motion, incorporating the required…
One of the most important algorithmic meta-theorems is a famous result by Courcelle, which states that any graph problem definable in monadic second-order logic with edge-set quantifications (i.e., MSO2 model-checking) is decidable in…
A graph $G$ is called interval colorable if it has a proper edge coloring with colors $1,2,3,\dots$ such that the colors of the edges incident to every vertex of $G$ form an interval of integers. Not all graphs are interval colorable; in…
We prove linear upper and lower bounds for the Hausdorff dimension set of minimal interval exchange transformations with flips (in particular without periodic points), and a linear lower bound for the Hausdorff dimension of the set of…
We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…
We present a new method of analysis of measure-preserving dynamical systems, based on frequency analysis and ergodic theory, which extends our earlier work [1]. Our method employs the novel concept of harmonic time average [2], and is…
Ensemble Density Functional Theory (EDFT) is a generalization of ground-state Density Functional Theory (GS DFT), which is based on an exact formal theory of finite collections of a system's ground and excited states. EDFT in various forms…