Related papers: Resistance values under transformations in regular…
Reggeized gluon interactions due to a single quark loop are studied in the full triple-regge limit and in closely related helicity-flip helicity-pole limits. Triangle diagram reggeon interactions are generated that include local…
Message passing is the core operation in graph neural networks, where each node updates its embeddings by aggregating information from its neighbors. However, in deep architectures, this process often leads to diminished expressiveness. A…
The triangle-free process begins with an empty graph on n vertices and iteratively adds edges chosen uniformly at random subject to the constraint that no triangle is formed. We determine the asymptotic number of edges in the maximal…
The exact expression for the effective resistance between any two vertices of the $N$-cycle graph with four nearest neighbors $C_{N}(1,2)$, is given. It turns out that this expression is written in terms of the effective resistance of the…
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 study properties of spectral minimal partitions of metric graphs within the framework recently introduced in [Kennedy et al, Calc. Var. 60 (2021), 61]. We provide sharp lower and upper estimates for minimal partition energies in…
In this article we consider resistance matrix of a connected graph. For unweighted graph we study some necessary and sufficient conditions for resistance regular graphs. Also we find some relationship between Laplacian matrix and resistance…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
This paper challenges the convention of using graph-theoretic shortest distance in stress-based graph drawing. We propose a new paradigm based on resistance distance, derived from the graph Laplacian's spectrum, which better captures global…
How do real graphs evolve over time? What are ``normal'' growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large…
In this paper we study the convergence behavior of grafting rays to the Thurston boundary of Teichmuller space. When the grafting is done along a weighted system of simple closed curves or along a maximal uniquely ergodic lamination this…
Recently, the stability of graph filters has been studied as one of the key theoretical properties driving the highly successful graph convolutional neural networks (GCNs). The stability of a graph filter characterizes the effect of…
We study a mean field model of a complex network, focusing on edge and triangle densities. Our first result is the derivation of a variational characterization of the entropy density, compatible with the infinite node limit. We then…
The existence of adversarial examples has led to considerable uncertainty regarding the trust one can justifiably put in predictions produced by automated systems. This uncertainty has, in turn, lead to considerable research effort in…
We study asymptotic behaviour of stochastic approximation procedures with three main characteristics: truncations with random moving bounds, a matrix valued random step-size sequence, and a dynamically changing random regression function.…
We introduce weak oddness $\omega_{\textrm w}$, a new measure of uncolourability of cubic graphs, defined as the least number of odd components in an even factor. For every bridgeless cubic graph $G$, $\rho(G)\le\omega_{\textrm…
The \emph{resistance matrix} of a simple connected graph $G$ is denoted by $R$, and is defined by $R =(r_{ij})$, where $r_{ij}$ is the resistance distance between the vertices $i$ and $j$ of $G$. In this paper, we consider the resistance…
We show, through local estimates and simulation, that if one constrains simple graphs by their densities $\varepsilon$ of edges and $\tau$ of triangles, then asymptotically (in the number of vertices) for over $95\%$ of the possible range…
Contraction of triangles is a standard operation in the study of cubic graphs, as it reduces the order of the graph while typically preserving many of its properties. In this paper, we investigate the converse problem, wherein certain…
One of Erdos's conjectures states that every triangle-free graph on $n$ vertices has an induced subgraph on $n/2$ vertices with at most $n^2/50$ edges. We report several partial results towards this conjecture. In particular, we establish…