Related papers: The L2 strong maximum principle on arbitrary count…
We consider solving a generalized Allen-Cahn equation coupled with a passive convection for a given incompressible velocity field. The numerical scheme consists of the first order accurate stabilized implicit explicit time discretization…
In this paper we study the maximum degree of interaction which may emerge in distributed systems. It is assumed that a distributed system is represented by a graph of nodes interacting over edges. Each node has some amount of data. The…
The maximum entropy principle from statistical mechanics states that a closed system attains an equilibrium distribution that maximizes its entropy. We first show that for graphs with fixed number of edges one can define a stochastic edge…
The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…
We study the problem of maximizing the number of spanning trees in a connected graph by adding at most $k$ edges from a given candidate edge set. We give both algorithmic and hardness results for this problem: - We give a greedy algorithm…
In the quest to produce quantum technology, superconducting networks, working at temperatures just above absolute zero, have arisen as one of the most promising physical implementations. The precise analysis and synthesis of such circuits…
Previously, the controllability problem of a linear time-invariant dynamical system was mapped to the maximum matching (MM) problem on the bipartite representation of the underlying directed graph, and the sizes of MMs on random bipartite…
We consider the problem of how much edge connectivity is necessary to force a graph G to contain a fixed graph H as an immersion. We show that if the maximum degree in H is D, then all the examples of D-edge connected graphs which do not…
Let $G$ be a connected simple graph on $n$ vertices and $m$ edges. Denote $N_{i}^{(j)}(G)$ the number of spanning subgraphs of $G$ having precisely $i$ edges and not more than $j$ connected components. The graph $G$ is \emph{strong} if…
We introduce a notion of subunit vector field for fully nonlinear degenerate elliptic equations. We prove that an interior maximum of a viscosity subsolution of such an equation propagates along the trajectories of subunit vector fields.…
The necessity of a Maximum Principle arises naturally when one is interested in the study of qualitative properties of solutions to partial differential equations. In general, to ensure the validity of these kind of principles one has to…
We provide a novel method for constructing asymptotics (to arbitrary accuracy) for the number of directed graphs that realize a fixed bidegree sequence $d = a \times b$ with maximum degree $d_{max}=O(S^{\frac{1}{2}-\tau})$ for an…
In this paper, we present an on-line fully dynamic algorithm for maintaining strongly connected component of a directed graph in a shared memory architecture. The edges and vertices are added or deleted concurrently by fixed number of…
The energy $E(G)$ of a graph $G$ is defined as the sum of the absolute values of its eigenvalues. Let $S_2$ be the star of order 2 (or $K_2$) and $Q$ be the graph obtained from $S_2$ by attaching two pendent edges to each of the end…
Using the theory of $L^p$-graphons (Borgs et al, 2014), we derive and rigorously justify the continuum limit for systems of differential equations on sparse random graphs. Specifically, we show that the solutions of the initial value…
We study the uniqueness of solutions to a class of heat equations with positive density posed on infinite weighted graphs. We separately consider the case when the density is bounded from below by a positive constant and the case of…
For a graph $G$, let $\nu_s(G)$ be the induced matching number of $G$. We prove that $\nu_s(G) \geq \frac{n(G)}{(\lceil\frac{\Delta}{2}\rceil+1) (\lfloor\frac{\Delta}{2}\rfloor+1)}$ for every graph of sufficiently large maximum degree…
In this article, we first introduce the concepts of vector fields and their divergence, and we recall the concepts of the gradient, Laplacian operator, Cheeger constants, eigenvalues, and heat kernels on a locally finite graph $V$. We give…
The characterization of network and biophysical properties from neural spiking activity is an important goal in neuroscience. A framework that provides unbiased inference on causal synaptic interaction and single neural properties has been…
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…