Results 141 to 150 of about 8,902 (235)
ABSTRACT In this article, we apply the notion of gravitational fields to commercial attraction, with the aim of providing valuable insights to inform the development of an econophysical methodology. We revisit the traditional notion of gravitational fields, extending it to encompass multiple economic variables and incorporating mobility and production ...
Luigi Capoani +3 more
wiley +1 more source
Factorization norms and an inverse theorem for MaxCut. [PDF]
Balla I, Hambardzumyan L, Tomon I.
europepmc +1 more source
Conditional Randomization Tests for the Specification of Interference Structure
ABSTRACT This study proposes specification tests for interference structure in causal inference with spillovers. We focus on experimental settings in which the treatment assignment mechanism is known. To test whether a given exposure mapping adequately summarizes the true interference structure, we develop conditional randomization tests by utilizing ...
Tadao Hoshino, Takahide Yanagi
wiley +1 more source
Beyond the Vertex: A Contemporary Review of Graph Theory
openaire +1 more source
A Mathematical Analysis of IPT-DMFT. [PDF]
Cancès E, Kirsch A, Perrin-Roussel S.
europepmc +1 more source
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch +5 more
wiley +1 more source
Functional network contributions to longitudinal tau spread in Posterior Cortical Atrophy. [PDF]
Katsumi Y +7 more
europepmc +1 more source
Weak Degeneracy of Planar Graphs
ABSTRACT The weak degeneracy of a graph G $G$ is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for graph coloring. Every d $d$‐degenerate graph is weakly d $d$‐degenerate, but the converse is not true in general (e.g., all connected d $d$‐regular graphs except ...
Anton Bernshteyn +2 more
wiley +1 more source
Symmetric and Antisymmetric Quantum States from Graph Structure and Orientation. [PDF]
de Jesus MR, Hoefel EOC, Angelo RM.
europepmc +1 more source
Linear Versus Centred Colouring via Pseudogrids
ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique. For a graph G $G$, the centred chromatic number χ cen ( G ) ${\chi }_{\text{cen}}(G)$
Prosenjit Bose +4 more
wiley +1 more source

