Model distinguishes homophily and triadic closure in network analysis.
problem Conflated properties of homophily and transitivity in network analysis.
method Generative model with triadic closure edges and inference procedure.
result Can identify mechanisms responsible for network edges and community structure.
The (variational) graph auto-encoder and its variants have been popularly used for representation learning on graph-structured data. While the encoder is often a powerful graph convolutional network, the decoder reconstructs the graph structure by only considering two nodes at a time, thus ignoring possible interaction…
It has often been taken as a working assumption that directed links in information networks are frequently formed by "short-cutting" a two-step path between the source and the destination -- a kind of implicit "link copying" analogous to the process of triadic closure in social networks. Despite the role of this assump…
Study predicts social relationships using triadic influence from social networks.
problem Difficulty in quantifying social relationships and their dynamics.
method Real social networks of 13 schools, neural networks, high-dimensional embedding.
result Triadic influence achieves highest accuracy in predicting student relationships.
TTERGM models improve social network predictions by incorporating triadic relationships.
problem Lack of models capturing triadic relationships and social learning theories in temporal network data.
method Introduced TTERGM, a generative model that includes triadic relationships and social learning theory as additional probability distributions. Parameters are estimated via Monte Carlo maximum likelihood.
result TTERGM achieves improved accuracy and fidelity compared to existing models on social network data.
Triadic-OCD detects changes in data streams robustly and optimally, even in asynchronous settings.
problem Online change detection in data streams with practical constraints.
method Triadic-OCD framework for asynchronous online change detection with provable robustness, optimality, and convergence.
result The proposed triadic-OCD algorithm achieves optimal performance and convergence in asynchronous settings.
New method detects inconsistencies in AHP matrices using triadic preference reversals.
problem Challenges in assessing consistency in AHP pairwise comparison matrices.
method Triadic preference reversals to detect inconsistencies between pairs of elements.
result 97% accuracy in detecting inconsistencies, significantly surpassing traditional methods.
We demonstrate that future market correlation structure can be predicted with high out-of-sample accuracy using a multiplex network approach that combines information from social media and financial data. Market structure is measured by quantifying the co-movement of asset prices returns, while social structure is meas…
A new method predicts links better across various networks.
problem Adaptive link prediction for diverse network types.
method MOLI method using local information from neighbors of different distances.
result MOLI outperforms other link prediction algorithms.
A motif-based framework identifies local spillover structures in financial markets.
problem Aggregate risk spillovers obscure local interaction patterns in systemic risk.
method Develops a motif-based framework using multiscale backbones and colored motifs.
result Motif-based portfolios outperform traditional benchmarks on risk-adjusted returns.
In a context of document co-clustering, we define a new similarity measure which iteratively computes similarity while combining fuzzy sets in a three-partite graph. The fuzzy triadic similarity (FT-Sim) model can deal with uncertainty offers by the fuzzy sets. Moreover, with the development of the Web and the high ava…
In self-organizing networks, topology and dynamics coevolve in a continuous feedback, without exogenous driving. The World Trade Network (WTN) is one of the few empirically well documented examples of self-organizing networks: its topology strongly depends on the GDP of world countries, which in turn depends on the str…
CAWs learn temporal network dynamics without node identities or edge attributes.
problem Learning temporal network dynamics without node identities or edge attributes.
method Causal Anonymous Walks (CAWs) using temporal random walks and hitting counts.
result CAW-N outperforms previous methods in predicting links over 6 real temporal networks.
Algorithm converts plat to standard closure of braids in 3D and related spaces.
problem Converting plat to standard closure of braids in different spaces.
method Algorithmic approach for plat to standard closure conversion in \(\mathbb{R}^3\), handlebodies, and thickened surfaces.
result Algorithm is quadratic for plat to standard closure and linear for standard to plat closure.
The paper studies knitted surfaces and surface-links, showing their isotopy and closure properties.
problem Understanding the isotopy and closure properties of knitted surfaces and surface-links.
method Analyzing the structure and closure of knitted surfaces and surface-links in R4. result Any surface-link is ambient isotopic to the closure of a 2-dimensional knit.
The paper models reciprocity in interbank markets using a statistical null model.
problem Understanding the importance of individual banks in financial networks.
method Developed an exponential random graph model to account for reciprocal links on both topological and weighted levels.
result Weighted reciprocity in interbank markets is more significant than network size and volume before the financial crisis.
Study on knot classification using 3-braid closures and ribbon surfaces.
problem Classifying smoothly slice knots from 3-braid closures.
method Construct ribbon surfaces and use twisted Alexander polynomial.
result Classification of knots up to 20 crossings.
New proof classifies orbit closures in Hodge bundle.
problem Classifying mGL+(2,R)-orbit closures in Hodge bundle. method Using deformations of flat pairs of pants.
result Short proof of absolute period foliation classification.
We study a regular closure operator in the category of quandles. We show that the regular closure operator and the pullback closure operator corresponding to the reflector from the category of quandles to its full subcategory of trivial quandles coincide, we give a simple description of this closure operator, and analy…
The study connects lamination and orbit closures in hyperbolic manifolds.
problem Understanding the geometric and dynamical properties of horocycle orbit closures in Z-covers of compact hyperbolic manifolds. method Exposes connections between distance minimizing laminations and horospherical orbit closures in Z-covers of compact hyperbolic manifolds. Provides novel constructions and explicit descriptions. result Even slight perturbations to hyperbolic metrics can drastically change horocycle orbit closures.
Study orbits in right triangles, deducing periodic billiard paths and classifying orbit closures.
problem Understanding periodic billiard paths in right triangles and orbit closures in strata of Abelian and quadratic differentials.
method Classifying orbit closures of rank at least two in hyperelliptic components of strata of Abelian and quadratic differentials.
result Computed orbit closures and deduced asymptotic number of periodic billiard trajectories in right triangles.
Proves closure for specific spacetimes with certain conditions.
problem Proving closure for globally hyperbolic spacetimes.
method Using a Bonnet-Myers type result.
result Proves closure for spacetimes with specific conditions.
Classifies Zariski closures of positive representations in Lie groups.
problem Classifying Zariski closures of positive representations in Lie groups.
method Classifies the Lie algebra of the Zariski closure of a discrete subgroup with specific properties.
result Obtains a new proof of Guichard's classification of Zariski closures of Hitchin representations.
Study proposes curvature flow model for Drosophila dorsal closure.
problem Modeling and understanding Drosophila dorsal closure during embryonic development.
method Curvature-based mathematical model, analysis of maximum-principle and integral-estimates, numerical approximation scheme.
result Established global existence and convergence for the model.
Classifies orbit closures in translation surface strata.
problem Classifying orbit closures in translation surface strata.
method Classification of extGL(2,R) orbit closures. result Applications to joinings of certain Masur-Veech measures.
Uniform Closure Method and Bayes classifier perform similarly in classifying open knots.
problem Classifying knots in open macromolecular chains.
method Used the Bayes MAP classifier and compared it to the Uniform Closure Method.
result Both methods have comparable accuracy and positive predictive value.
We discuss two different in general natural approaches to the ideal closure and ideal boundary of Busemann nonpositively curved metric space. It is shown that the identity map of the space admits surjective continuation from its coarse ideal closure to the weak one. We consider some situations when these closures coinc…
A new method predicts non-Markovian closure terms for complex systems.
problem Predicting the effect of unresolved variables on resolved dynamics in high-dimensional systems.
method Mamba-Assisted Closure (MAC) framework: sequence model trained to predict closure from resolved trajectory, coupled with reduced-order equations.
result Substantially outperforms existing methods in predictive accuracy and long-time stability.
The study bounds the number of closed geodesics in a specific orbit closure of surfaces.
problem Counting closed geodesics in a specific orbit closure of surfaces.
method Analyzes triangulations and Teichmüller geodesics to bound the number of closed geodesics.
result Obtains exponential bounds on the number of closed geodesics of length at most R.
Extends graph degree theorem to simplicial closure of Auter space.
problem Connectivity of graphs in Auter space.
method Defines degree for simplicial closure, extends Hatcher-Vogtmann theorem.
result Simplicial closure of Auter space is (d-1)-connected for degree d.
We study a certain type of braid closure which resembles the plat closure but has certain advantages; for example, it maps pure braids to knots. The main results of this note are a Markov-type theorem and a description of how Vassiliev invariants behave under this braid closure.
We give a Dehn-Nielsen type theorem for the homology cobordism group of homology cylinders by considering its action on the acyclic closure, which was defined by Levine, of a free group. Then we construct an additive invariant of those homology cylinders which act on the acyclic closure trivially. We also describe some…
The paper defines plat closures for spherical braids and shows links in RP3 can be realized this way.
problem Defining and analyzing plat closures for spherical braids in RP3. method Defining plat closures, associating residual permutations, and presenting moves on spherical braids.
result The number of components of the plat closure link of a spherical braid is equal to the number of disjoint cycles in its residual permutation.
The paper classifies orbit closures of symplectic Lie algebras.
problem Classifying orbit closures of symplectic Lie algebras under the action of Sp(4,R). method Analyzing the natural action of Sp(4,R) on the set of 4-dimensional Lie algebras with symplectic structures. result A complete classification of orbit closures of 4-dimensional symplectic Lie algebras.
We prove Ptolemaean Inequality and Ptolemaeus' Theorem in the closure complex hyperbolic plane endowed with the Cygan metric.
Characterizes closures of mapping class group orbits on non-orientable surfaces.
problem Understanding closures of orbits in Teichmüller spaces for non-orientable surfaces.
method Analyzes closures in ML and PML for measured laminations, projective measured laminations, and points. result Characterizes closures of weighted two-sided curves in ML. The article finds equivalence moves for links in specific manifolds using plat closure of braids.
problem Finding equivalence moves for links in Dunwoody and periodic Takahashi manifolds.
method Representing manifolds with Heegaard splitting and braids, determining equivalence moves algorithmically and computing them explicitly.
result Explicit computation of equivalence moves for some cases.
Simplified proof of foliation closure theorem for linear foliations.
problem Proving the closure of linear foliations on Riemannian manifolds.
method Direct geometric approach, focusing on projectable foliations and compatible connections.
result Smoothness of the closure of linear foliations directly proven.
We show that if a braid B can be parametrised in a certain way, then previous work can be extended to a construction of a polynomial f:R4→R2 with the closure of B as the link of an isolated singularity of f, showing that the closure of B is real algebraic. In particular, we prove that cl…
We determine the condition on a given lens space having a realization as a closure of homology cobordism over a planar surface with a given number of boundary components. As a corollary, we see that every lens space is represented as a closure of homology cobordism over a planar surface with three boundary components. …
Normal closures of certain finite subgroups in automorphism and outer automorphism groups of free groups are determined.
problem Determining the normal closures of specific finite subgroups in automorphism and outer automorphism groups of free groups.
method Analyzing the structure of finite subgroups and their normal closures in Aut(Fn) and Out(Fn). result The normal closure of certain finite subgroups in Aut(Fn) and Out(Fn) are determined. Specialized knot theory theorems for strongly involutive links.
problem Classical Alexander and Markov theorems for links.
method Equivariant closure map for strongly involutive links.
result Surjective equivariant closure map up to equivalence of strongly involutive links.
New method for knot closures from 1-tangles and annulus twists.
problem Understanding knot closures from 1-tangles and annulus twists.
method Wrapping index, sutured manifold theory, band sums.
result At most two closures for a given nontrivial 1-tangle, and one twist producing an unknot if it exists.
Study horocycle orbits in Z-covers of hyperbolic surfaces.
problem Classify horocycle orbit closures in Z-covers of compact hyperbolic surfaces. method Careful analysis of distance minimizing geodesic rays in the cover.
result All non-maximal horocycle orbit closures have integer Hausdorff dimension.
Single-colored ADO-3 invariant matches Links-Gould polynomial for 5-braid closures.
problem Matching ADO-3 invariant with Links-Gould polynomial for specific knot types.
method Proved for closures of 5-braids, conjectured for all knots and links.
result Single-colored ADO-3 invariant equals Links-Gould polynomial for 5-braid closures.
Let n be a positive integer. We provide a Khovanov homology proof of the following classical fact: If the closure of an n-strand braid is the n-component unlink, then the braid is trivial.
We study the Morton-Franks-Williams inequality for closures of simple braids (also known as positive permutation braids). This allows to prove, in a simple way, that the set of simple braids is a orthonormal basis for the inner product of the Hecke algebra of the braid group defined by Kálmán, who first obtained this r…
Floating geodesic planes in Hitchin manifolds have fractal closures with non-integer dimensions.
problem Rigidity of geodesic planes in Hitchin manifolds.
method Constructing a specific surface group and analyzing its action on the Hitchin manifold.
result Existence of floating geodesic planes in Hitchin manifolds with fractal closures.