455 research outputs found
Graph-based Features for Automatic Online Abuse Detection
While online communities have become increasingly important over the years,
the moderation of user-generated content is still performed mostly manually.
Automating this task is an important step in reducing the financial cost
associated with moderation, but the majority of automated approaches strictly
based on message content are highly vulnerable to intentional obfuscation. In
this paper, we discuss methods for extracting conversational networks based on
raw multi-participant chat logs, and we study the contribution of graph
features to a classification system that aims to determine if a given message
is abusive. The conversational graph-based system yields unexpectedly high
performance , with results comparable to those previously obtained with a
content-based approach
Exact Ground States of Large Two-Dimensional Planar Ising Spin Glasses
Studying spin-glass physics through analyzing their ground-state properties
has a long history. Although there exist polynomial-time algorithms for the
two-dimensional planar case, where the problem of finding ground states is
transformed to a minimum-weight perfect matching problem, the reachable system
sizes have been limited both by the needed CPU time and by memory requirements.
In this work, we present an algorithm for the calculation of exact ground
states for two-dimensional Ising spin glasses with free boundary conditions in
at least one direction. The algorithmic foundations of the method date back to
the work of Kasteleyn from the 1960s for computing the complete partition
function of the Ising model. Using Kasteleyn cities, we calculate exact ground
states for huge two-dimensional planar Ising spin-glass lattices (up to
3000x3000 spins) within reasonable time. According to our knowledge, these are
the largest sizes currently available. Kasteleyn cities were recently also used
by Thomas and Middleton in the context of extended ground states on the torus.
Moreover, they show that the method can also be used for computing ground
states of planar graphs. Furthermore, we point out that the correctness of
heuristically computed ground states can easily be verified. Finally, we
evaluate the solution quality of heuristic variants of the Bieche et al.
approach.Comment: 11 pages, 5 figures; shortened introduction, extended results; to
appear in Physical Review E 7
Meeting the Expectations of Your Heritage Culture: Links between Attachment Style, Intragroup Marginalisation, and Psychological Adjustment
This article has been made available through the Brunel Open Access Publishing Fund.This article has been made available through the Brunel Open Access Publishing Fund.Do insecurely-attached individuals perceive greater rejection from their heritage culture? Few studies have examined the antecedents and outcomes of this perceived rejection – termed intragroup marginalisation – in spite of its implications for the adjustment of cultural migrants to the mainstream culture. The present study investigated whether anxious and avoidant attachment orientations among cultural migrants were associated with greater intragroup marginalisation and, in turn, with lower subjective well-being and flourishing, and higher acculturative stress. Anxious attachment was associated with heightened intragroup marginalisation from friends and, in turn, with increased acculturative stress; anxious attachment was also associated with increased intragroup marginalisation from family. Avoidant attachment was linked with increased intragroup marginalisation from family and, in turn, with decreased subjective well-being
"Almost stable" matchings in the Roommates problem
An instance of the classical Stable Roommates problem (SR) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, i.e. admits the fewest number of blocking pairs. In this paper we prove that, given an SR instance with n agents, in which all preference lists are complete, the problem of finding a matching with the fewest number of blocking pairs is NP-hard and not approximable within n^{\frac{1}{2}-\varepsilon}, for any \varepsilon>0, unless P=NP. If the preference lists contain ties, we improve this result to n^{1-\varepsilon}. Also, we show that, given an integer K and an SR instance I in which all preference lists are complete, the problem of deciding whether I admits a matching with exactly K blocking pairs is NP-complete. By contrast, if K is constant, we give a polynomial-time algorithm that finds a matching with at most (or exactly) K blocking pairs, or reports that no such matching exists. Finally, we give upper and lower bounds for the minimum number of blocking pairs over all matchings in terms of some properties of a stable partition, given an SR instance I
Smallest Cubic and Quartic Graphs With a Given Number of Cutpoints and Bridges
For positive integers b and c, with c even, satisfying the inequalities b+1≤c≤2b, the minimum order of a connected cubic graph with b bridges and c cutpoints is computed. Furthermore, the structure of all such smallest cubic graphs is determined. For each positive integer c, the minimum order of a quartic graph with c cutpoints is calculated. Moreover, the structure and number of all such smallest quartic graphs are determined
Scanning Tunneling Microscopy and Fabrication of Nanometer Scale Structures at the Liquid-Gold Interface
The Scanning Tunneling Microscope (STM) can image gold surfaces covered with a variety of liquids. This paper reviews the results obtained using the STM to image gold surfaces covered with liquid. These results include the creation of 10 nm structures, images of the electrochemical process of electroplating, and the production of atomically flat Au (111) surfaces. We conclude that in the future STM will find further application in the area of nanostructure fabrication and electrochemistry. The trend in the field is toward greater control of the electrochemical environment
The Local Time Distribution of a Particle Diffusing on a Graph
We study the local time distribution of a Brownian particle diffusing along
the links on a graph. In particular, we derive an analytic expression of its
Laplace transform in terms of the Green's function on the graph. We show that
the asymptotic behavior of this distribution has non-Gaussian tails
characterized by a nontrivial large deviation function.Comment: 8 pages, two figures (included
Eulerian Walkers as a model of Self-Organised Criticality
We propose a new model of self-organized criticality. A particle is dropped
at random on a lattice and moves along directions specified by arrows at each
site. As it moves, it changes the direction of the arrows according to fixed
rules. On closed graphs these walks generate Euler circuits. On open graphs,
the particle eventually leaves the system, and a new particle is then added.
The operators corresponding to particle addition generate an abelian group,
same as the group for the Abelian Sandpile model on the graph. We determine the
critical steady state and some critical exponents exactly, using this
equivalence.Comment: 4 pages, RevTex, 4 figure
A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs
The \emph{zero forcing number}, , of a graph is the minimum
cardinality of a set of black vertices (whereas vertices in are
colored white) such that is turned black after finitely many
applications of "the color-change rule": a white vertex is converted black if
it is the only white neighbor of a black vertex. The \emph{strong metric
dimension}, , of a graph is the minimum among cardinalities of all
strong resolving sets: is a \emph{strong resolving set} of
if for any , there exists an such that either
lies on an geodesic or lies on an geodesic. In this paper, we
prove that for a connected graph , where is
the cycle rank of . Further, we prove the sharp bound
when is a tree or a unicyclic graph, and we characterize trees
attaining . It is easy to see that can be
arbitrarily large for a tree ; we prove that and
show that the bound is sharp.Comment: 8 pages, 5 figure
- …