In traditional blockchains consensus is maintained by proof of work such that the valid chain containing the most cumulative work is agreed to be the consensus chain.
IOTA lacks blocks and transactions are appended to the tangle (approximately) individually.
If two conflicting transactions are incorporated relatively synchronously and portions of the network build on each of the transactions the tangle will lack consensus.
I'm curious about general consensus properties of the tangle in adversarial conditions, but the following closely-related questions follow from this scenario and are a solid starting point:
When a node gets word of a larger conflicting graph by what logic does it decide between the two?
Evaluating the conflicting region of the tangle seems like a computationally hard problem, can a node do this efficiently and trustlessly? How can we detect conflicts if no node sees the whole tangle?
What guarantees of convergence do we have? Is there a time frame in which we expect convergence?