相关论文: A note on general epidemic region for infinite reg…
Using digitized images of the three-dimensional, branching structures for root systems of bean seedlings, together with analytical and numerical methods that map a common 'SIR' epidemiological model onto the bond percolation problem, we…
We study the curing of epidemics of a network contagion, which is modelled using a variation of the classical Polya urn process that takes into account spatial infection among neighbouring nodes. We introduce several quantities for…
The susceptible-infected-susceptible epidemic model is analyzed through a degree-based mean-field approach. In this work, a mitigation factor is introduced in the probability of finding an infected individual following an edge. This…
Designing algorithms that generate networks with a given degree sequence while varying both subgraph composition and distribution of subgraphs around nodes is an important but challenging research problem. Current algorithms lack control of…
Datasets from several domains, such as life-sciences, semantic web, machine learning, natural language processing, etc. are naturally structured as acyclic graphs. These datasets, particularly those in bio-informatics and computational…
Population structure affects the outcome of natural selection. Static population structures can be described by graphs, where individuals occupy the nodes, and interactions occur along the edges. General conditions for evolutionary success…
Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…
The incidence matrix of a graph is totally unimodular if and only if the graph is bipartite, i.e., it contains no odd cycles. We extend the characterization of total unimodularity to hypergraphs whose hyperedges of size at least four are…
The field of epidemiology has presented fascinating and relevant questions for mathematicians, primarily concerning the spread of viruses in a community. The importance of this research has greatly increased over time as its applications…
In this work we study the dynamics of systems composed of numerous interacting elements interconnected through a random weighted directed graph, such as models of random neural networks. We develop an original theoretical approach based on…
Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs.…
A key characteristic of the spread of infectious diseases is their ability to use efficient transmission paths within contact graphs. This enables the pathogen to maximise infection rates and spread within a target population. In this work,…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
Epidemics have so far been mostly studied in undirected networks. However, many real-world networks, such as the social network Twitter and the WWW networks, upon which information, emotion or malware spreads, are shown to be directed…
In this paper, we introduce a modified epidemic model on regular and scale-free networks respectively. We consider the birth rate $\delta$, cure rate $\gamma$, infection rate $\lambda$, $\alpha$ from the infectious disease, and death rate…
The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by…
We introduce the Graph Mixture Density Networks, a new family of machine learning models that can fit multimodal output distributions conditioned on graphs of arbitrary topology. By combining ideas from mixture models and graph…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
The Susceptible-Infected-Susceptible model is a canonical model for emerging disease outbreaks. Such outbreaks are naturally modeled as taking place on networks. A theoretical challenge in network epidemiology is the dynamic correlations…
Let $X$ be a (repetitive) infinite connected simple graph with a finite upper bound $\Delta$ on the vertex degrees. The main theorem states that $X$ admits a (repetitive) limit aperiodic vertex coloring by $\Delta$ colors. This refines a…